The existence of inconsistencies in databases has motivated the study of Consistent Query Answering (CQA) since the 1990s. Recent work proposed the use of Maximum Satisfiability (MaxSAT) for solving CQA for concrete types of inconsistencies. This paper shows that, for the types of inconsistencies solved with MaxSAT, it...
António Morgado, Jordi Planes, Alexey Ignatiev et al.· Proceedings of the 35th ACM...· 0 citations
This paper characterizes closest-world counterfactual explanations explicitly as a disjunctive normal form over all minimally distant counterexample instances, and introduces conjunctive counterfactual explanations (CFXps), a subclass of counterfactual antecedents restricted to conjunctions of feature literals that gua...
Alexey Ignatiev, Peter J. Stuckey, João Marques-Silva· 0 citations
This paper adapts an existing MaxSAT-based explanation framework designed for TEs to function with general REs, and devise a dedicated logic encoding for REs combining SAT solving with pseudo-Boolean (PB) constraints for determining the winning class.
Hao Hu, Alexey Ignatiev, João Marques-Silva· International Conference on...· 2 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.