The satisfiability problem for a class consisting of Horn sentences and some non-Horn sentences in porportional logic

Extended Horn sets in propositional logic

Journal of the ACM (JACM)

Finding almost-satisfying assignments

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems

Annals of Mathematics and Artificial Intelligence

Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing

Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions

A Bottom-Up Approach to Clausal Tableaux

TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods

Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing

Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions