Termination of Associative-Commutative Rewriting by Dependency Pairs

A new criterion for termination of rewriting has been described by Arts and Giesl in 1997. We show how this criterion can be generalized to rewriting modulo associativity and commutativity. We also show how one can build weak AC-compatible reduction orderings which may be used in this criterion.

[1]  J. Urgen Giesl.  Generating Polynomial Orderings for Termination Proofs ? , 1995 .

[2]  Jürgen Giesl,et al.  Automatically Proving Termination Where Simplification Orderings Fail , 1997, TAPSOFT.

[3]  Gérard P. Huet,et al.  A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm , 1981, J. Comput. Syst. Sci..

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

[5]  Leo Bachmair.  Associative-Commutative Reduction Orderings , 1992, Inf. Process. Lett..

[6]  Albert Rubio,et al.  A Precedence-Based Total AC-Compatible Ordering , 1993, RTA.

[7]  Claude Marché,et al.  CiME: Completion Modulo E , 1996, RTA.

[8]  Pierre Lescanne.  Uniform Termination of Term Rewriting Systems: Recursive Decomposition Ordering with Status , 1984, CAAP.

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

[10]  Nachum Dershowitz.  Orderings for Term-Rewriting Systems , 1979, FOCS.

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

[12]  Claude Marché,et al.  Normalized Rewriting: An Alternative to Rewriting Modulo a Set of Equations , 1996, J. Symb. Comput..

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

[14]  Deepak Kapur,et al.  A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems , 1997, RTA.

[15]  Pierre Lescanne,et al.  An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial Interpretations , 1986, CADE.

[16]  Nachum Dershowitz,et al.  Critical Pair Criteria for Completion , 1988, J. Symb. Comput..

[17]  Joachim Steinbach.  Proving Polynomials Positive , 1992, FSTTCS.

[18]  Nachum Dershowitz,et al.  Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[19]  Laurence Puel,et al.  Extension of the Associative Path Ordering to a Chain of Associative Commutative Symbols , 1993, RTA.

[20]  Hubert Comon.  Proceedings of the 8th International Conference on Rewriting Techniques and Applications , 1997 .

[21]  Claude Marché,et al.  Rewrite Systems for Natural, Integral, and Rational Arithmetic , 1997, RTA.

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

[23]  Claude Marché,et al.  Réécriture modulo une théorie présentée par un système convergent et décidabilité des problèmes du mot dans certaines classes de théories equationnelles , 1993 .

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