Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas

Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson

Research output

41 Citations (Scopus)

Abstract

DPLL (for Davis, Putnam, Logemann, and Loveland) 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 treelike resolution proofs. Therefore, lower bounds for treelike resolution (known since the 1960s) apply to them. However, these lower bounds say nothing about the behavior of such algorithms on satisfiable formulas. Proving exponential lower bounds for them in the most general setting is impossible without proving P ≠ NP; therefore, 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, which read up to n 1-ε of clauses at each step and see the remaining part of the formula without negations, and drunk algorithms, which choose a variable using any complicated rule and then pick its value at random.

Original languageEnglish
Pages (from-to)51-72
Number of pages22
JournalJournal of Automated Reasoning
Volume35
Issue number1-3
DOIs
Publication statusPublished - 1 Oct 2005

Scopus subject areas

  • Software
  • Computational Theory and Mathematics
  • Artificial Intelligence

Cite this