Abstract
We consider extensions of the DPLL approach to satisfiability testing that add a version of memoization, in which formulas that the algorithm has previously shown to be unsatisfiable are remembered for later use. Such formula caching algorithms have been suggested for satisfiability and stochastic satisfiability by several authors. We formalize these methods by developing extensions of the fruitful connection that has previously been developed between DPLL algorithms for satisfiability and tree-like resolution proofs of unsatisfiability. We analyze a number of variants of these formula caching methods and characterize their strength in terms of proof systems. These proof systems are new and simple, and have a rich structure. We compare them to several studied proof systems: tree-like resolution, regular resolution, general resolution, Res(k), and Frege systems and present both simulation and separations. One of our most interesting results is the introduction of a natural and implementable form of DPLL with caching, FCWreason. This system is surprisingly powerful: we prove that it can polynomially simulate regular resolution, and furthermore, it can produce short proofs of some formulas that require exponential-size resolution proofs.
- Achlioptas, D., Beame, P., and Molloy, M. 2004. A sharp threshold in proof complexity. J. Comput. Syst. Sci. 68, 2, 238--268. Google Scholar
Digital Library
- Alekhnovich, M., Borodin, A., Buresh-Oppenheim, J., Impagliazzo, R., Magen, A., and Pitassi, T. 2005. Towards a model for backtracking and dynamic programming. In Proceedings of the 20th Annual IEEE Conference on Computational Complexity. 308--322. Google Scholar
Digital Library
- Alekhnovich, M., Johannsen, J., Pitassi, T., and Urquhart, A. 2001. An exponential separation between regular and general resolution. Tech. rep. TR01-56, Electronic Colloquium in Computation Complexity. http://www.eccc.uni-trier.de/eccc/.Google Scholar
- Bacchus, F., Dalmao, S., and Pitassi, T. 2003a. Algorithms and complexity results for #SAT and Bayesian inference. In Proceedings of the 44th Annual Symposium on Foundations of Computer Science. IEEE, 340--351. Google Scholar
Digital Library
- Bacchus, F., Dalmao, S., and Pitassi, T. 2003b. Value elimination: Bayesian inference via backtracking search. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI’03). 20--28. Google Scholar
Digital Library
- Beame, P., Impagliazzo, R., Krajíček, J., Pitassi, T., Pudlák, P., and Woods, A. 1992. Exponential lower bounds for the pigeonhole principle. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing. 200--220. Google Scholar
Digital Library
- Beame, P., Impagliazzo, R., Pitassi, T., and Segerlind, N. 2003. Memoization and DPLL: Formula caching proof systems. In Proceedings of the 18th Annual IEEE Conference on Computational Complexity. 225--236.Google Scholar
- Beame, P., Kautz, H., and Sabharwal, A. 2004. Towards understanding and harnessing the potential of clause learning. J. Artif. Intell. Res. 22, 319--351. Google Scholar
Cross Ref
- Ben-Sasson, E., Impagliazzo, R., and Wigderson, A. 2000. Near-optimal separation of treelike and general resolution. Tech. rep. TR00-005, Electronic Colloquium in Computation Complexity. http://www.eccc.uni-trier.de/eccc/.Google Scholar
- Ben-Sasson, E. and Wigderson, A. 2001. Short proofs are narrow -- Resolution made simple. J. ACM 48, 2, 149--169. Google Scholar
Digital Library
- Bonet, M. L., Esteban, J. L., Galesi, N., and Johansen, J. 2000. On the relative complexity of resolution refinements and cutting planes proof systems. SIAM J. Comput. 30, 5, 1462--1484. Google Scholar
Digital Library
- Bonet, M. L. and Galesi, N. 1999. A study of proof search algorithms for resolution and polynomial calculus. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science. IEEE, 422--432. Google Scholar
Digital Library
- Buss, S. 1995. Some remarks on the lengths of propositional proofs. Arc. Math. Logic 34, 377--394.Google Scholar
Cross Ref
- Buss, S. R. 1987. Polynomial size proofs of the pigeonhole principle. J. Symb. Logic 57, 916--927.Google Scholar
Cross Ref
- Chvátal, V. and Szemerédi, E. 1988. Many hard examples for resolution. J. ACM 35, 4, 759--768. Google Scholar
Digital Library
- Cook, S. A. and Reckhow, R. A. 1977. The relative efficiency of propositional proof systems. J. Symb. Logic 44, 1, 36--50.Google Scholar
Cross Ref
- Davis, M. and Putnam, H. 1960. A computing procedure for quantification theory. Comm. ACM 7, 201--215. Google Scholar
Digital Library
- Haken, A. 1985. The intractability of resolution. Theor. Comput. Sci. 39, 297--305.Google Scholar
Cross Ref
- Majercik, S. M. and Littman, M. L. 1998. Using caching to solve larger probabilistic planning problems. In Proceedings of the 15th National Conference on Artificial Intelligence. The AAAI Press/The MIT Press, 954--959. Google Scholar
Digital Library
- Marques-Silva, J. P. and Sakallah, K. A. 1996. Grasp -- A new search algorithm for satisfiability. In Proceedings of the International Conference on Computer-Aided Design. ACM/IEEE, 220--227. Google Scholar
Digital Library
- Monien, B. and Speckenmeyer, E. 1985. Solving satisfiability in less than 2n steps. Discr. Appl. Math. 10, 3, 287--295. Google Scholar
Digital Library
- Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., and Malik, S. 2001. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference. ACM/IEEE, 530--535. Google Scholar
Digital Library
- Pitassi, T. and Urquhart, A. 1995. The complexity of the Hajós calculus. SIAM J. Discr. Math. 8, 3, 464--483. Google Scholar
Digital Library
- Robson, J. M. 1986. Algorithms for maximum independent sets. J. Algor. 7, 3, 425--440.Google Scholar
Cross Ref
- Segerlind, N., Buss, S., and Impagliazzo, R. 2002. A switching lemma for small restrictions and lower bounds for k-DNF resolution. In Proceedings of the 43rd Annual Symposium on Foundations of Computer Science. IEEE, 604--613. Google Scholar
Digital Library
- Urquhart, A. 1995. The complexity of propositional proofs. Bull. Symb. Logic 1, 4, 425--467.Google Scholar
Cross Ref
- Zhang, H. 1997. Sato: An efficient propositional prover. In Proceedings of the International Conference on Automated Deduction. Lecture Notes in Artificial Intelligence vol. 1249. Springer, 272--275. Google Scholar
Digital Library
- Zhang, L., Madigan, C. F., Moskewicz, M. H., and Malik, S. 2001. Efficient conflict driven learning in a boolean satisfiability solver. In Proceedings of the International Conference on Computer-Aided Design. ACM/IEEE, 279--285. Google Scholar
Digital Library
Index Terms
Formula Caching in DPLL
Recommendations
The Efficiency of Resolution and Davis--Putnam Procedures
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, building on the work of Clegg, Edmonds, and Impagliazzo in [Proceedings of the ...
Level-ordered Q-resolution and tree-like Q-resolution are incomparable
We show that Level-ordered Q-resolution and Tree-like Q-resolution, two restrictions of the Q-resolution system for proving false QBFs false, are incomparable. While the Exp + Res system is known to p-simulate Tree-like Q-resolution, we observe that it ...
Parameterized Complexity of DPLL Search Procedures
We study the performance of DPLL algorithms on parameterized problems. In particular, we investigate how difficult it is to decide whether small solutions exist for satisfiability and other combinatorial problems. For this purpose we develop a Prover-...








Comments