Extracting a DPLL Algorithm

Authors:
Andrew Lawrence;Ulrich Berger;Monika Seisenberger
Affiliations:
Department of Computer, Science Swansea University, Swansea, UK;Department of Computer, Science Swansea University, Swansea, UK;Department of Computer, Science Swansea University, Swansea, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2012

Citing 13
Cited 0

GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
The Warshall Algorithm and Dickson's Lemma: Two Examples of Realistic Program Extraction

Journal of Automated Reasoning
An arithmetic for non-size-increasing polynomial-time computation

Theoretical Computer Science - Implicit computational complexity
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications

Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
A Brief Overview of Agda --- A Functional Language with Dependent Types

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic
Source-level proof reconstruction for interactive theorem proving

TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Formal Correctness Proof for DPLL Procedure

Informatica
Minlog: a tool for program extraction supporting algebras and coalgebras

CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Proofs and Computations

Proofs and Computations
Epigram: practical programming with dependent types

AFP'04 Proceedings of the 5th international conference on Advanced Functional Programming
Sledgehammer: judgement day

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We formalize a completeness proof for the DPLL proof system and extract a DPLL SAT solver from it. When applied to a propositional formula in conjunctive normal form the program produces either a satisfying assignment or a DPLL derivation which shows that it is unsatisfiable. We use non-computational quantifiers to remove redundant computational content from the extracted program and improve its performance. The formalization is carried out in the Minlog system.