Refine
Has Fulltext
- yes (1) (remove)
Year of publication
- 2009 (1)
Document Type
- Preprint (1) (remove)
Language
- English (1) (remove)
Is part of the Bibliography
- no (1) (remove)
Keywords
- Automatisches Beweisen (1) (remove)
Institute
Many formal descriptions of DPLL-based SAT algorithms either do not include all essential proof techniques applied by modern SAT solvers or are bound to particular heuristics or data structures. This makes it difficult to analyze proof-theoretic properties or the search complexity of these algorithms. In this paper we try to improve this situation by developing a nondeterministic proof calculus that models the functioning of SAT algorithms based on the DPLL calculus with clause learning. This calculus is independent of implementation details yet precise enough to enable a formal analysis of realistic DPLL-based SAT algorithms.