Skip to Main content Skip to Navigation

Preuve par induction dans le calcul des séquents modulo

Fabrice Nahon 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We are presenting an original narrowing-based proof search method for inductive theorems. It has the specificity to be grounded on deduction modulo and to rely on narrowing to provide both induction variables and instantiation schemes. It also yields a direct translation from a successful proof search derivation to a proof in the sequent calculus. The method is shown to be correct and refutationally complete in a proof theoretical way. We are extending this first approach to equational rewrite theories given by a rewrite system R and a set E of equalities. Whenever the equational rewrite system (R,E) has good properties of termination, sufficient completeness, and whenever E is constructor preserving, narrowing at defined-innermost positions is performed with unifiers which are constructor substitutions. This is especially interesting for associative and associative-commutative theories for which the general proof search system is refined.
Document type :
Complete list of metadatas

Cited literature [2 references]  Display  Hide  Download
Contributor : Fabrice Nahon <>
Submitted on : Friday, February 29, 2008 - 6:57:45 PM
Last modification on : Tuesday, April 21, 2020 - 1:19:40 AM
Long-term archiving on: : Tuesday, September 21, 2010 - 4:12:21 PM


  • HAL Id : tel-01748243, version 3



Fabrice Nahon. Preuve par induction dans le calcul des séquents modulo. Autre [cs.OH]. Université Henri Poincaré - Nancy 1, 2007. Français. ⟨tel-01748243v3⟩



Record views


Files downloads