Logo image
Back
The model evolution calculus as a first-order DPLL method
Journal article   Open access   Peer reviewed

The model evolution calculus as a first-order DPLL method

Peter Baumgartner and Cesare Tinelli
Artificial intelligence, Vol.172(4), pp.591-632
2008
DOI: 10.1016/j.artint.2007.09.005
url
https://doi.org/10.1016/j.artint.2007.09.005View
Published (Version of record) Open Access

Abstract

The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proof-procedure for first-order logic, it has been used almost exclusively for propositional logic so far because of its highly inefficient treatment of quantifiers, based on instantiation into ground formulas. The FDPLL calculus by Baumgartner was the first successful attempt to lift the procedure to the first-order level without resorting to ground instantiations. FDPLL lifts to the first-order case the core of the DPLL procedure, the splitting rule, but ignores other aspects of the procedure that, although not necessary for completeness, are crucial for its effectiveness in practice. In this paper, we present a new calculus loosely based on FDPLL that lifts these aspects as well. In addition to being a more faithful lifting of the DPLL procedure, the new calculus contains a more systematic treatment of universal literals, which are crucial to achieve efficiency in practice. The new calculus has been implemented successfully in the Darwin system, described elsewhere. The main results of this paper are theoretical, showing the soundness and completeness of the new calculus. In addition, the paper provides a high-level description of a proof procedure for the calculus, as well as a comparison with other calculi.
 DPLL procedure First-order logic Model generation Sequent calculi

Details

Metrics

15 Record Views
21 Times Cited - Web of Science
Logo image