Completion is an Instance of Abstract Canonical System Inference

Guillaume Burel 1 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 : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [39 references]  Display  Hide  Download

https://hal.inria.fr/inria-00000775
Contributor : Guillaume Burel <>
Submitted on : Tuesday, September 12, 2006 - 5:54:51 PM
Last modification on : Thursday, January 11, 2018 - 6:19:58 AM
Long-term archiving on : Monday, September 20, 2010 - 4:56:41 PM

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

131

Files downloads

107