Two simulations about DPLL(T)

Mahfuza Farooque 1, 2 Stéphane Lengrand 2, 1 Assia Mahboubi 2, 3, 4
1 PARSIFAL - Proof search and reasoning with logic specifications
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
4 TYPICAL - Types, Logic and computing
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : In this paper we relate different formulations of the DPLL(T ) procedure. The first formulation is based on a system of rewrite rules, which we denote DPLL(T ). The second formulation is an inference system of, which we denote LKDPLL(T ). The third formulation is the application of a standard proof-search mechanism in a sequent calculus LKp(T ) introduced here. We formalise an encoding from DPLL(T ) to LKDPLL(T ) that was, to our knowledge, never explicitly given and, in the case where DPLL(T ) is extended with backjumping and Lemma learning, never even implicitly given. We also formalise an encoding from LKDPLL(T ) to LKp(T ), building on Ivan Gazeau's previous work: we extend his work in that we handle the "-modulo-Theory" aspect of SAT-modulo-theory, by extending the sequent calculus to allow calls to a theory solver (seen as a blackbox). We also extend his work in that we handle advanced features of DPLL such as backjumping and Lemma learning, etc. Finally, we re fine the approach by starting to formalise quantitative aspects of the simulations: the complexity is preserved (number of steps to build complete proofs). Other aspects remain to be formalised (non-determinism of the search / width of search space).
Document type :
Reports
Complete list of metadatas

Cited literature [2 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00690044
Contributor : Stéphane Graham-Lengrand <>
Submitted on : Monday, April 23, 2012 - 4:57:11 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:29 PM
Long-term archiving on: Tuesday, July 24, 2012 - 2:20:54 AM

Files

Main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00690044, version 1
  • ARXIV : 1204.5159

Collections

Citation

Mahfuza Farooque, Stéphane Lengrand, Assia Mahboubi. Two simulations about DPLL(T). 2012. ⟨hal-00690044⟩

Share

Metrics

Record views

720

Files downloads

259