ACM Transactions on Computation Theory · 2010 · 41 citations · 32 references
ComputingComputer ScienceAlgorithmsFormal MethodsTheory Of ComputationCachingProof ComplexityTheorem ProvingFrege SystemsProof SystemsResolutionsSatisfiabilitySatisfiability Problem
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, FCW reason . 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.
32
Lecture Notes in Artificial Intelligence
Patrick Brézillon, Paolo Bouquet · 1999 · 7.4K citations
Matthew W. Moskewicz, Conor Madigan, Ying Zhao et al. · 2001 · 2.9K citations
A Computing Procedure for Quantification Theory
Martin Davis, Hilary Putnam · Journal of the ACM · 1960 · 2.6K citations · Full text
GRASP - A New Search Algorithm for Satisfiability
1996 · 860 citations
The intractability of resolution
Armin Haken · Theoretical Computer Science · 1985 · 829 citations