DeepAI AI Chat
Log In Sign Up

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

by   Nadia Creignou, et al.
TU Wien
Aix-Marseille Université

Many reasoning problems are based on the problem of satisfiability (SAT). While SAT itself becomes easy when restricting the structure of the formulas in a certain way, the situation is more opaque for more involved decision problems. For instance, the CardMinSat problem which asks, given a propositional formula ϕ and an atom x, whether x is true in some cardinality-minimal model of ϕ, is easy for the Horn fragment, but, as we will show in this paper, remains Θ_2P-complete (and thus NP-hard) for the Krom fragment (which is given by formulas in CNF where clauses have at most two literals). We will make use of this fact to study the complexity of reasoning tasks in belief revision and logic-based abduction and show that, while in some cases the restriction to Krom formulas leads to a decrease of complexity, in others it does not. We thus also consider the CardMinSat problem with respect to additional restrictions to Krom formulas towards a better understanding of the tractability frontier of such problems.


page 1

page 2

page 3

page 4


Complexity of Reasoning with Cardinality Minimality Conditions

Many AI-related reasoning problems are based on the problem of satisfiab...

A criterion for "easiness" of certain SAT problems

A generalized 1-in-3SAT problem is defined and found to be in complexity...

Are Hitting Formulas Hard for Resolution?

Hitting formulas, introduced by Iwama, are an unusual class of propositi...

A Study of Associative Evidential Reasoning

Evidential reasoning is cast as the problem of simplifying the evidence-...

Backdoors to Abduction

Abductive reasoning (or Abduction, for short) is among the most fundamen...

Separation of bounded arithmetic using a consistency statement

This paper proves Buss's hierarchy of bounded arithmetics S^1_2 ⊆ S^2_2 ...

The Complexity of Reasoning with FODD and GFODD

Recent work introduced Generalized First Order Decision Diagrams (GFODD)...