Axioms vs. rewrite rules: from completeness to cut elimination - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2000

Axioms vs. rewrite rules: from completeness to cut elimination

Gilles Dowek

Abstract

Combining a standard proof search method, such as resolution or tableaux, and rewriting is a powerful way to cut off search space in automated theorem proving, but proving the completeness of such combined methods may be challenging. It may require in particular to prove cut elimination for an extended notion of proof that combines deductions and computations. This suggests new interactions between automated theorem proving and proof theory.
Fichier principal
Vignette du fichier
frocos.pdf (374.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04112760 , version 1 (01-06-2023)

Licence

Attribution

Identifiers

Cite

Gilles Dowek. Axioms vs. rewrite rules: from completeness to cut elimination. 2000. ⟨hal-04112760⟩

Collections

INRIA INRIA2
5 View
4 Download

Altmetric

Share

Gmail Facebook X LinkedIn More