Any Gound Associative-Commutative Theory Has a Finite Canonical System

We show that theories presented by a set of ground equations with several associative-commutative (AC) symbols always admit a finite canonical system. This result is obtained through the construction of a reduction ordering which is AC-compatible and total on the set of congruence classes generated by the associativity and commutativity axioms. As far as we know, this is the first ordering with such properties, when several AC function symbols and free function symbols are allowed. Such an ordering is also a fundamental tool for deriving complete theorem proving strategies with built-in associative commutative unification.

[1]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[2]  Wayne Snyder,et al.  Efficient Ground Completion: An O(n log n) Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E , 1989, RTA.

[3]  Michaël Rusinowitch,et al.  A New Method for Establishing Refutational Completeness in Theorem Proving , 1986, CADE.

[4]  Deepak Kapur,et al.  A New Method for Proving Termination of AC-Rewrite Systems , 1990, FSTTCS.

[5]  Paul S. Wang,et al.  MACSYMA from F to G , 1985, J. Symb. Comput..

[6]  Mark E. Stickel,et al.  Complete Sets of Reductions for Some Equational Theories , 1981, JACM.

[7]  Claude Marché,et al.  On Ground AC-Completion , 1991, RTA.

[8]  A. M. Ballantyne,et al.  New decision algorithms for finitely presented commutative semigroups , 1981 .

[9]  Paliath Narendran,et al.  A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System , 1985, Theor. Comput. Sci..

[10]  LEO BACHMAIR,et al.  Termination Orderings for Associative-Commutative Rewriting Systems , 1985, J. Symb. Comput..

[11]  Hélène Kirchner,et al.  Completion of a Set of Rules Modulo a Set of Equations , 1986, SIAM J. Comput..

[12]  L. Dickson.  Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[13]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[14]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[15]  Nachum Dershowitz,et al.  Termination of Rewriting , 1987, J. Symb. Comput..

[16]  Paliath Narendran,et al.  Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time , 1988, CADE.

[17]  Nachum Dershowitz,et al.  Commutation, Transformation, and Termination , 1986, CADE.

[18]  Nachum Dershowitz,et al.  Orderings for Equational Proofs , 1986, LICS.

[19]  Pierre Lescanne,et al.  Termination of Rewriting Systems by Polynomial Interpretations and Its Implementation , 1987, Sci. Comput. Program..

[20]  Ernst W. Mayr,et al.  An algorithm for the general Petri net reachability problem , 1981, STOC '81.

[21]  Joachim Steinbach,et al.  AC-Termination of Rewrite Systems: A Modified Knuth-Bendix Ordering , 1990, ALP.

[22]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.