Lower bounds for myopic DPLL algorithms with a cut heuristic

Authors:
Dmitry Itsykson;Dmitry Sokolov
Affiliations:
Steklov Institute of Mathematics at St. Petersburg, St. Petersburg, Russia;Steklov Institute of Mathematics at St. Petersburg, St. Petersburg, Russia
Venue:
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Year:
2011

Citing 6
Cited 1

Hard examples for resolution

Journal of the ACM (JACM)
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas

Journal of Automated Reasoning
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms

TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
The complexity of inversion of explicit goldreich's function by DPLL algorithms

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Lower bound on average-case complexity of inversion of goldreich’s function by drunken backtracking algorithms

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
On Optimal Heuristic Randomized Semidecision Procedures, with Applications to Proof Complexity and Cryptography

Theory of Computing Systems - Theoretical Aspects of Computer Science

Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms

Theory of Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper is devoted to lower bounds on the time complexity of DPLL algorithms that solve the satisfiability problem using a splitting strategy. Exponential lower bounds on the running time of DPLL algorithms on unsatisfiable formulas follow from the lower bounds for resolution proofs. Lower bounds on satisfiable instances are also known for some classes of DPLL algorithms; this lower bounds are usually based on reductions to unsatisfiable instances. In this paper we consider DPLL algorithms with a cut heuristic that may decide that some branch of the splitting tree will not be investigated. DPLL algorithms with a cut heuristic always return correct answer on unsatisfiable formulas while they may err on satisfiable instances. We prove the theorem about effectiveness vs. correctness trade-off for deterministic myopic DPLL algorithms with cut heuristic. Myopic algorithms can see formulas with erased signs of negations; they may also request a small number of clauses to read them precisely. We construct a family of unsatisfiable formulas Φ(n) and a polynomial time samplable ensemble of distributions Qn concentrated on satisfiable formulas such that every deterministic myopic algorithm that gives a correct answer with probability 1−o(1) on a random formula from the ensemble Qn runs exponential time on the formulas Φ(n).