Theorem Proving Modulo Revised Version - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2003

Theorem Proving Modulo Revised Version

Abstract

Deduction modulo is a way to remove computational arguments from proofs by reasoning modulo a congruence on propositions. Such a technique, issued from automated theorem proving, is of general interest because it permits to separate computations and deductions in a clean way. The first contribution of this paper is to define a sequent calculus modulo that gives a proof theoretic account of the combination of computations and deductions. The congruence on propositions is handled via rewrite rules and equational axioms. Rewrite rules apply to terms but also directly to atomic propositions. The second contribution is to give a complete proof search method, called Extended Narrowing and Resolution (ENAR), for theorem proving modulo such congruences. The completeness of this method is proved with respect to provability in sequent calculus modulo. An important application is that higher-order logic can be presented as a theory in deduction modulo. Applying the Extended Narrowing and Resolution method to this presentation of higher-order logic subsumes full higher-order resolution.
Fichier principal
Vignette du fichier
RR-4861.pdf (477.8 Ko) Télécharger le fichier

Dates and versions

inria-00071722 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071722 , version 1

Cite

Gilles Dowek, Thérèse Hardin, Claude Kirchner. Theorem Proving Modulo Revised Version. [Research Report] RR-4861, INRIA. 2003, pp.54. ⟨inria-00071722⟩
223 View
182 Download

Share

Gmail Facebook X LinkedIn More