Abstract canonical presentations

Nachum Dershowitz Claude Kirchner 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Solving goals -- like proving properties, deciding word problems or resolving constraints -- is much easier with some presentations of the underlying theory than with others. Typically, what have been called "completion processes", in particular in the study of equational logic, involve finding appropriate presentations of a given theory to more easily solve a given class of problems. We provide a general proof-theoretic setting that relies directly on the fundamental concept of "good", that is, normal-form, proofs, itself defined using well-founded orderings on proof objects. This foundational framework allows for abstract definitions of canonical presentations and very general characterizations of saturation and redundancy criteria.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00121760
Contributor : Claude Kirchner <>
Submitted on : Thursday, December 21, 2006 - 6:35:56 PM
Last modification on : Friday, April 12, 2019 - 10:18:03 AM

Links full text

Identifiers

Collections

Citation

Nachum Dershowitz, Claude Kirchner. Abstract canonical presentations. Theoretical Computer Science, Elsevier, 2006, Theoretical Computer Science, 357 (1-3), pp.53--69. ⟨10.1016/j.tcs.2006.03.012⟩. ⟨inria-00121760⟩

Share

Metrics

Record views

157