Completion is an Instance of Abstract Canonical System Inference - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Completion is an Instance of Abstract Canonical System Inference


Abstract canonical systems and inference (ACSI) were introduced to formalize the intuitive notions of good proof and good inference appearing typically in first-order logic or in Knuth-Bendix like completion procedures. Since this abstract framework is intended to be generic, it is of fundamental interest to show its adequacy to represent the main systems of interest. This has been done for ground completion (where all equational axioms are ground) but was still an open question for the general completion process. By showing that the standard completion is an instance of the ACSI framework we close the question. For this purpose, two proof representations, proof terms and proofs by replacement, are compared to built a proof ordering that provides an instantiation adapted to the abstract canonical system framework.
Fichier principal
Vignette du fichier
bk4jag-final.pdf (300.37 Ko) Télécharger le fichier

Dates and versions

inria-00000775 , version 1 (17-11-2005)
inria-00000775 , version 2 (12-09-2006)



Guillaume Burel, Claude Kirchner. Completion is an Instance of Abstract Canonical System Inference. Algebra, Meaning, and Computation: A Festschrift Symposium in Honor of Joseph Goguen, Jun 2006, San Diego/USA, pp.497-520, ⟨10.1007/11780274_26⟩. ⟨inria-00000775v2⟩
70 View
160 Download



Gmail Facebook X LinkedIn More