Simulating the DPLLT procedure in a sequent calculus with focusingReportar como inadecuado




Simulating the DPLLT procedure in a sequent calculus with focusing - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

* Corresponding author 1 LIX - Laboratoire d-informatique de l-École polytechnique Palaiseau 2 PARSIFAL - Proof search and reasoning with logic specifications LIX - Laboratoire d-informatique de l-École polytechnique Palaiseau, Inria Saclay - Ile de France, Polytechnique - X, CNRS - Centre National de la Recherche Scientifique : UMR7161 3 SPECFUN - Symbolic Special Functions : Fast and Certified 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, Polytechnique - X, CNRS - Centre National de la Recherche Scientifique : UMR

Abstract : This paper gives an abstract description of decision procedures for Satisfiability Modulo Theory SMT as proof search procedures in a sequent calculus with polarities and focusing. In particular, we show how to simulate the execution of standard techniques based on the Davis-Putnam- Logemann-Loveland DPLL procedure modulo theory as the gradual construction of a proof tree in sequent calculus. The construction mimicking a run of DPLL-modulo-Theory can be obtained by a meta-logical control on the proof-search in sequent calculus. This control is provided by polarities and focusing features, which there- fore narrow the corresponding search space in a sense we discuss. This simulation can also account for backjumping and learning steps, which correspond to the use of general cuts in sequent calculus.





Autor: Mahfuza Farooque - Stéphane Lengrand - Assia Mahboubi -

Fuente: https://hal.archives-ouvertes.fr/



DESCARGAR PDF




Documentos relacionados