no code implementations • 21 Jul 2023 • Teresa Alsinet, Josep Argelich, Ramón Béjar, Santi Martínez
The average complexity results we obtain are consistent with our hypothesis: the higher the polarization of the instance, the easier is to find the corresponding polarized bipartition.
no code implementations • 27 Jun 2023 • Ramón Béjar, António Morgado, Jordi Planes, Joao Marques-Silva
The paper shows that most of the algorithms proposed in recent years for computing logic-based explanations can be generalized for computing explanations given the partially specified inputs.
