A hierarchy of tractable satisfiability problems
References (8)
- et al.
An O(n2) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all Horn sentences
Inform. Process. Lett.
(1987) - et al.
Linear-time algorithms for testing the satisfiability of propositional Horn formulae
J. Logic Programming
(1984) - et al.
Polynomially solvable satisfiability problems
Inform. Process. Lett.
(1988) - et al.
The satisfiability problem for a class consisting of Horn sentences and some non-Horn sentences in propositional logic
Inform. and Control
(1983)
There are more references available in the full text version of this article.
Cited by (35)
Complexity issues related to propagation completeness
2013, Artificial IntelligenceLean clause-sets: Generalizations of minimally unsatisfiable clause-sets
2003, Discrete Applied MathematicsA perspective on certain polynomial-time solvable classes of satisfiability
2003, Discrete Applied MathematicsOn some tractable classes in deduction and abduction
2000, Artificial IntelligenceAn algorithm for the class of pure implicational formulas
1999, Discrete Applied Mathematics
Copyright © 1992 Published by Elsevier B.V.