TaMeD: A Tableau Method for Deduction Modulo

Richard Bonichon 1
1 SPI - Sémantiques, preuves et implantation
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : Deduction modulo is a formalism introduced to separate cleanly computations and deductions by reasoning modulo a congruence on propositions. A sequent calculus modulo has been defined by Dowek, Hardin and Kirchner as well as a resolution-based proof search method called Extended Narrowing And Resolution (ENAR), in which the congruences are handled through rewrite rules on terms and atomic propositions. We define a tableau-based proof search method, called Tableau Method for Deduction modulo (TaMeD), for theorem proving modulo. We then give a syntactic proof of the completeness of the method with respect to provability in the sequent calculus modulo. Moreover, we follow in our proofs the same steps as the ENAR method in such a way that it allows to try and compare the characteristics of both methods.
Document type :
Conference papers
Complete list of metadatas

Contributor : Lip6 Publications <>
Submitted on : Wednesday, May 10, 2017 - 3:38:51 PM
Last modification on : Thursday, March 21, 2019 - 2:32:16 PM

Links full text



Richard Bonichon. TaMeD: A Tableau Method for Deduction Modulo. IJCAR 2004 - 2nd International Joint Conference on Automated Reasoning, Jul 2004, Cork, Ireland. pp.445-459, ⟨10.1007/978-3-540-25984-8_33⟩. ⟨hal-01520537⟩



Record views