Theorem Proving modulo

Gilles Dowek Thérèse Hardin 1 Claude Kirchner
1 SPI - Sémantiques, preuves et implantation
LIP6 - Laboratoire d'Informatique de Paris 6
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 one 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 through 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 ENAR method to this presentation of higher-order logic subsumes full higher-order resolution.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01199506
Contributor : Lip6 Publications <>
Submitted on : Tuesday, September 15, 2015 - 3:00:06 PM
Last modification on : Thursday, March 21, 2019 - 2:23:18 PM

Links full text

Identifiers

Citation

Gilles Dowek, Thérèse Hardin, Claude Kirchner. Theorem Proving modulo. Journal of Automated Reasoning, Springer Verlag, 2003, 31 (1), pp.33-72. ⟨10.1023/A:1027357912519⟩. ⟨hal-01199506⟩

Share

Metrics

Record views

77