Abstract
We introduce a new method for checking satisfiability of conjunctive normal forms (CNFs). The method is based on the fact that if no clause of a CNF contains a satisfying assignment in its 1-neighborhood, then this CNF is unsatisfiable. (The 1-neighborhood of a clause is the set of all assignments satisfying only one literal of this clause.) The idea of 1-neighborhood exploration allows one to prove unsatisfiability without generating an empty clause. The reason for avoiding the generation of an empty clause is that we believe that no deterministic algorithm can efficiently reach a global goal (deducing an empty clause) using an inherently local operation (resolution). At the same time, when using 1-neighborhood exploration, a global goal is replaced with a set of local subgoals, which makes it possible to optimize steps of the proof. We introduce two proof systems formalizing 1-neighborhood exploration. An interesting open question is whether there exists a class of CNFs for which the introduced systems have proofs that are exponentially shorter than the ones that can be obtained by general resolution.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ben-Sasson, E., Impagliazzo, R. and Wigderson, A.: Near optimal separation of treelike and general resolution, Presented as SAT-2000, Third Workshop on the Satisfiability Problem, Renesse, the Netherlands, May 14-18, 2000. The paper can be downloaded from the Web page www.cs.huji.ac.il/~elli/.
Bonet, M., Domingo, C., Galesi, N. and Johannsen, J.: Exponential separations between restricted resolutions and cutting planes proof systems, in FOCS-1998, pp. 638–647.
Chvatal, V. and Szmeredi, E.: Many hard examples for resolution, J. ACM 35(4) (1988), 759–768.
Davis, M., Logemann, G. and Loveland, D.: A machine program for theorem proving, Comm. ACM 5 (1962), 394–397.
Davis, M. and Putnam, H.: A computing procedure for quantification theory, J. ACM 7 (1960), 201–215.
Galil, Z.: On the complexity and validity of bounded resolution, in Proceedings of Seventh Annual ACM Symposium on Theory of Computing, May 1975, pp.72–82.
Ginsberg, M.: Dynamic backtracking, J. Artificial Intelligence Res. 1 (1993), 25–46.
Haken, A.: The intractability of resolution, Theoret. Comput. Sci. 39 (1995), 297–308.
Mitchell, D., Selman, B. and Levesque, H.: Hard and easy distribution of SAT problems, in Proceedings of AAAI-92, San Jose, CA, 1992, pp. 459–465.
Marques-Silva, J. and Sakallah, K.: Grasp - A new search algorithm for satisfiability, Proceedings of the International Conference on Computer-Aided Design, November 1996.
Robinson, J.: A machine-oriented logic based on resolution principle, J. ACM 12(1) (1965), 23–41.
Selman, B., Kautz, H. and Cohen, B.: Noise strategies for local search, in Proceedings of AAAI-94, Seattle, WA, 1994, pp. 337–343.
Selman, B., Kautz, H. and McAllister, D.: Ten challenges in propositional reasoning and search, in Proceedings of IJCAI-97.
Selman, B., Levesque, H. and Mitchell, D.: A new method for solving hard satisfiability problems, in Proceedings of AAAI-92, San Jose, CA, 1992, pp. 440–446.
Urquhart, A.: Hard examples for resolution, J. ACM 34(1) (1987), 209–219.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Goldberg, E. Proving Unsatisfiability of CNFs Locally. Journal of Automated Reasoning 28, 417–434 (2002). https://doi.org/10.1023/A:1015803927637
Issue Date:
DOI: https://doi.org/10.1023/A:1015803927637