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

page 1

page 2

page 3

page 4

research
11/21/2017

Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?

Many reasoning problems are based on the problem of satisfiability (SAT)...
research
03/31/2018

Efficient Encodings of Conditional Cardinality Constraints

In the encoding of many real-world problems to propositional satisfiabil...
research
04/22/2013

Backdoors to Abduction

Abductive reasoning (or Abduction, for short) is among the most fundamen...
research
05/31/2021

Parameterised Complexity of Propositional Logic in Team Semantics

In this work we analyse the parameterised complexity of propositional in...
research
12/04/2017

Principle of Conservation of Computational Complexity

In this manuscript, we derive the principle of conservation of computati...
research
02/23/2021

Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework

Logic-based argumentation is a well-established formalism modelling nonm...
research
07/08/2021

The Satisfiability Problem for a Quantitative Fragment of PCTL

We give a sufficient condition under which every finite-satisfiable form...

Please sign up or login with your details

Forgot password? Click here to reset