We give an example of a set of linear equational axioms such that no finite canonical rewrite system can be computed by ordered completion with a complete reduction ordering, although such a rewrite system does trivially exist. We then describe a set of inference rules for a completion procedure, called linear completion, that solves the problem when the axioms are linear.
Unable to display preview. Download preview PDF.
- L. Bachmair, “Proofs Methods for Equational Theories”, Thesis: University of Illinois at Urbana-Champaign, 1987.Google Scholar
- L. Bachmair, N. Dershowitz and J. Hsiang, “Orderings for Equational Proofs”, Symposium on Logic in Computer Science, Boston, June 1986.Google Scholar
- N. Dershowitz, “Personal Communication”, Montréal, June 1990.Google Scholar
- N. Dershowitz and J.-P. Jouannaud, “Term Rewriting Systems”, in Handbook for Theoretical Computer Science, North-Holland, to appear.Google Scholar
- N. Dershowitz and J.-P. Jouannaud, “Notations for Rewriting”, to appear Google Scholar
- N. Dershowitz, L. Marcus and A. Tarlecki, “Existence, Uniqueness, and Construction of Rewrite Systems”, Technical Report.Google Scholar
- J. Hsiang and M. Rusinowitch, “On Word Problems in Equational Theories”, 14th ICALP, 1987.Google Scholar
- G. Huet, “Confluence Reductions: Abstract Properties and Applications to Term Rewritings, JACM, 27, 1980, pp. 797–821.Google Scholar
- G. Huet, “A Complete Proof of Correctness of Knuth-Bendix Completion Algorithm”, JCSS, 23, 1981, pp.11–21.Google Scholar
- G. Huet and D.C. Oppen, “Equations and Rewrite Rules: A Survey”, Formal Langages: Perspectives and Open Problems, R. Book, Academic Press, 1980.Google Scholar
- D.E. Knuth and P.B. Bendix, “Simple Word Problems in Universal Algebra”, Computational Algebra, J. Leach, Pergamon Press, 1970, pp.263–297.Google Scholar