Complexity of Reasoning with Cardinality Minimality Conditions

03/02/2023
by   Nadia Creignou, et al.
0

Many AI-related reasoning problems are based on the problem of satisfiability of propositional formulas with some cardinality-minimality condition. While the complexity of the satisfiability problem (SAT) is well understood when considering systematically all fragments of propositional logic within Schaefer's framework (STOC 1978) this is not the case when such minimality condition is added. We consider the CardMinSat problem, which asks, given a formula F and an atom x, whether x is true in some cardinality-minimal model of F. We completely classify the computational complexity of the CardMinSat problem within Schaefer's framework, thus paving the way for a better understanding of the tractability frontier of many AI-related reasoning problems. To this end we use advanced algebraic tools developed by (Schnoor Schnoor 2008) and (Lagerkvist 2014).

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset