Abstract canonical presentations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2006

Abstract canonical presentations


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.

Dates and versions

inria-00121760 , version 1 (21-12-2006)



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



Gmail Facebook X LinkedIn More