Abstract
DPLL algorithms form the largest family of contemporary algorithms for SAT (the propositional satisfiability problem) and are widely used in applications. The recursion trees of DPLL algorithm executions on unsatisfiable formulas are equivalent to tree-like resolution proofs. Therefore, lower bounds for tree-like resolution (known since 1960s) apply to them. However, these lower bounds say nothing about their behavior on satisfiable formulas. Proving exponential lower bounds for them in the most general setting is impossible without proving P ≠ NP; thus, in order to prove lower bounds one has to restrict the power of branching heuristics. In this paper, we give exponential lower bounds for two families of DPLL algorithms: generalized myopic algorithms (that read up to n 1 − − ε of clauses at each step and see the remaining part of the formula without negations) and drunk algorithms (that choose a variable using any complicated rule and then pick its value at random).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Achlioptas, D., Beame, P., Molloy, M.: A sharp threshold in proof complexity. JCSS (2003)
Achlioptas, D., Beame, P., Molloy, M.: Exponential bounds for DPLL below the satisfiability threshold. In: SODA 2004 (2004)
Achlioptas, D., Sorkin, G.B.: Optimal myopic algorithms for random 3-SAT. In: FOCS 2000 (2000)
Alekhnovich, M., Ben-Sasson, E.: Analysis of the random walk algorithm on random 3-CNFs (2002) (manuscript)
Alekhnovich, M., Ben-Sasson, E., Razborov, A., Wigderson, A.: Pseudorandom generators in propositional complexity. In: FOCS 2000 (2000); Journal version is to appear in SIAM J. Comp.
Alekhnovich, M., Razborov, A.: Lower bounds for the polynomial calculus: non-binomial case. In: FOCS 2001 (2001)
Ben-Sasson, E., Wigderson, A.: Short proofs are narrow — resolution made simple. JACM 48(2), 149–169 (2001)
Davis, M., Logemann, G., Loveland, D.: A machine program for theoremproving. Comm. ACM 5, 394–397 (1962)
Davis, M., Putnam, H.: A computing procedure for quantification theory. JACM 7, 201–215 (1960)
Hirsch, E.A.: SAT local search algorithms: Worst-case study. JAR 24(1/2), 127–143 (2000)
Nikolenko, S.I.: Hard satisfiable formulas for DPLL-type algorithms. Zapiski nauchnyh seminarov POMI 293, 139–148 (2002); English translation is to appear in Journal of Mathematical Sciences
Pudlák, P., Impagliazzo, R.: A lower bound for DLL algorithms for k-SAT. In: SODA 2000 (2000)
Simon, L., Le Berre, D., Hirsch, E.A.: The SAT 2002 Competition. To appear in AMAI (2002)
Tseitin, G.S.: On the complexity of derivation in the propositional calculus. Zapiski nauchnykh seminarov LOMI 8, 234–259 (1968); English translation of this volume: Consultants Bureau, N.Y., pp. 115–125 (1970)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alekhnovich, M., Hirsch, E.A., Itsykson, D. (2004). Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-27836-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22849-3
Online ISBN: 978-3-540-27836-8
eBook Packages: Springer Book Archive