Abstract
We show that a conjunctive normal form (CNF) formula F is unsatisfiable if and only if there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiability of a CNF formula reduces to looking for a stable set of points (SSP). We give some properties of SSPs and describe a simple algorithm for constructing an SSP for a CNF formula. Building an SSP can be viewed as a “natural” way of search space traversal. This naturalness of search space examination allows one to make use of the regularity of CNF formulas to be checked for satisfiability. We illustrate this point by showing that if a CNF F formula is symmetric with respect to a group of permutations, it is very easy to make use of this symmetry when constructing an SSP. As an example, we show that the unsatisfiability of pigeon-hole CNF formulas can be proven by examining only a set of points whose size is quadratic in the number of holes. Finally, we introduce the notion of an SSP with excluded directions and sketch a procedure of satisfiability testing based on the construction of such SSPs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C.A. Brown, L. Finkelstein and P.W. Purdom, Backtrack searching in the presence of symmetry, in: Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Sixth International Conference (Springer, 1988) pp. 990–110.
V. Chvatal and E. Szmeredi, Many hard examples for resolution, Journal of the ACM 35(4) 759–768.
W. Cook, C.R. Coullard and G. Turan, On the complexity of cutting planes proofs, Discrete Applied Mathematics 18 (1987) 25–38.
J. Crawford, M. Ginsberg, E. Luks and A. Roy, Symmetry breaking predicates for search problems, in: Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR’96) (1996).
M. Davis, G. Logemann and D. Loveland, A Machine program for theorem proving, Communications of the ACM 5 (1962) 394–397.
E. Goldberg, Proving unsatisfiability of CNFs locally, in: Proceedings of LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (2001).
A. Haken, The intractability of resolution, Theor. Comput. Sci. 39 (1985) 297–308.
B. Krishnamurthy, Short proofs for tricky formulas, Acta Informatica 22 (1985) 253–275.
D. Mitchell, B. Selman and H.J. Levesque, Hard and easy distributions of SAT problems, in: Proceedings of AAAI-92, San Jose, CA (1992) pp. 459–465.
M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang and S. Malik, Chaff: Engineering an efficient SAT solver, in: Proceedings of DAC-2001 (2001).
C. Papadimitriou, On selecting a satisfying truth assignment, in: Proceedings of FOC-91 (1991).
A. Roy, Symmetry breaking and fault tolerance in Boolean satisfiability, PhD thesis, http://www.cs.uoregon.edu/~aroy/
B. Selman, H. Kautz and B. Cohen, Noise strategies for improving local search, in: Proceedings of AAAI-94 (1994).
I. Shlyakhter, Generating effective symmetry breaking predicates for search problems, in: Proceedings of LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (2001).
A. Urquhart, The symmetry rule in propositional logic, Discrete Applied Mathematics 96–97 (1999) 177–193.
H. Wong-Toi, Private communication.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Goldberg, E. Testing satisfiability of CNF formulas by computing a stable set of points. Ann Math Artif Intell 43, 65–89 (2005). https://doi.org/10.1007/s10472-005-0420-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10472-005-0420-x