Abstract
We describe a method that extends the lexicographic recursive path ordering of Dershowitz and Kamin and Levy for proving termination of associative-commutative (AC) rewrite systems. Instead of comparing the arguments of an AC-operator using the multiset extension, wepartition them into disjoint subsets and use each subset only once for comparison. To preserve transitivity, we introduce two techniques —pseudocopying andelevating of arguments of an AC operator. This method imposesno restrictions at all on the underlying precedence relation on function symbols. It can therefore prove termination of a much more extensive class of AC rewrite systems than can previous methods, such as associative path ordering, that restrict AC operators to be minimal or subminimal in precedence. A number of examples illustrating the power of the approach are discussed. The method has been implemented inRRL, Rewrite Rule Laboratory, a theorem-proving environment based on rewrite techniques and completion.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bachmair, L.: Associative-commutative reduction orderings,Info. Proc. Lett. 1992.
Bachmair, L. and Dershowitz, N.: Commutation, transformation and termination, in J. Siekmann (ed.),Proc. 8th Internat. Conf. Automated Deduction (CADE-8), Oxford, Lecture Notes in Computer Science 230, Springer-Verlag, 1988, pp. 5–20.
Bachmair, L. and Plaisted, D. A.: Termination orderings for associative-commutative rewriting systems,J. Symbolic Comput. 1 (1985), 329–349.
Ben Cherifa, A. and Lescanne, P.: Termination of rewriting systems by polynomial interpretations and its implementation,Sci. Comput. Program. 9(2) (1987), 137–160.
Delor, C. and Puel, L.: Extension of the associative path ordering to a chain of associative commutative symbols, in C. Kirchner (ed.),Proc. 5th Internat. Conf. Rewrite Techniques and Applications (RTA-93), Lecture Notes in Computer Science, Springer-Verlag, 1993, pp. 389–404.
Dershowitz, N.: Termination of rewriting,J. Symbolic Comput. 3 (1987), 69–116.
Gnaeding, I. and Lescanne, P.: Proving termination of associative-communtative rewriting systems by rewriting, in J. Siekmann (ed.),Proc. 8th Internat. Conf. Automated Deduction (CADE-8), Oxford, Lecture Notes in Computer Science 230, Springer-Verlag, 1986, pp. 52–60.
Hullot, J.-M.: A catalogue of canonical term rewriting systems, Technical Report CSL-113, SRI International, Menlo Park, Calif. 1980.
Jouannaud, J.-P., Lescanne, P. and Reinig, F.: Recursive decomposition ordering, in D. Bjorner (ed.),IFIP Working Conf. on Formal Description of Programming Concepts, Germany, 1982, pp. 331–348.
Kamin, S. and Levy, J.-J.: Attempts for generalizing the recursive path ordering, Unpublished manuscript, INRIA, France, 1980.
Kapur, D., Narendran, P. and Sivakumar, G.: A path ordering for proving termination of term rewriting systems,Proc. 10th CAAP, Berlin, Lecture Notes in Computer Science 185, Springer-Verlag, 1985, pp. 173–187.
Kapur, D. and Zhang, H.: RRL: A rewrite rule laboratory, in E. Lusk and R. Overbeck (eds),Proc. 9th Internat. Conf. Automated Deduction (CADE-9), Lecture Notes in Computer Science 310, Springer-Verlag, 1988, pp. 768–769.
Knuth, D. E. and Bendix, P. B.: Simple world problems in universal algebras, in J. Leech (ed.),Computational Problems in Abstract Algebras, Pergamon Press, 1970, pp. 263–297.
Lankford, D. S.: On proving term rewriting systems are noetherian, Memo MTP-3, Louisiana State University, 1979.
Lankford, D. S. and Ballantyne, A. M.: Decision procedures for simple equational theories with commutative-associative axioms: Complete sets of commutative-associative reductions, Report ATP-39, Automatic Theorem Proving Project, Dept. of Math. and Computer Science, University of Texas, Austin, Texas, 1977.
Lescanne, P.: On the recursive decomposition ordering with lexicographical status and other related orderings,J. Automated Reasoning 6(1) (1990), 39–49.
Peterson, G. L. and Stickel, M. E.: Complete sets of reductions for some equational theories,J. ACM 28(2) (1981) 233–264.
Rubio, A. and Nieuwenhuis, R.: A precedence-based total AC-compatible ordering, in C. Kirchner (ed.),Proc. 5th Internat. Conf. Rewrite Techniques and Applications (RTA-93), Lecture Notes in Computer Science, Springer-Verlag, 1993, pp. 374–388.
Steinbach, J.: Extensions and comparison of simplification orderings, inProc. 3rd Internat. Conf. Rewriting Techniques and Applications (RTA-89), Chapel Hill, N.C., 1989, pp. 434–448.
Steinbach, J.: Path and decomposition orderings for proving AC-termination. Seki-Report, SR-89-18, University of Kaiserslautern, 1989. See also improving associative path orderings, in M. Stickel (ed.),Proc. 10th Internat. Conf. Automated Deduction (CADE-10), Kaiserslautern, Lecture Notes in Computer Science 449, Springer-Verlag, pp. 411–425.
Steinbach, J.: Termination proofs of rewriting systems — heuristics for generating polynomial orderings, SEKI Report SR-91-14 (SFB), University of Kaiserslautern, 1991.
Zhang, H. and Kapur, D.: Unnecessary inferences in associative-commutative completion procedures,Match. Systems Theory 3 (1990), 175–206.
Author information
Authors and Affiliations
Additional information
A preliminary version appears in Proc. of10th Conference on Foundations of Software Technology and Theoretical Computer Science, Bangalore, India (1990).
Partially supported by the National Science Foundation Grant no. CCR-8906678.
Partially supported by the National Science Foundation Grant no. CCR-9009755
Partially supported by the National Science Foundation under Grants CCR-9202838 and CCR-9357851.
Rights and permissions
About this article
Cite this article
Kapur, D., Sivakumar, G. & Zhang, H. A path ordering for proving termination of AC rewrite systems. J Autom Reasoning 14, 293–316 (1995). https://doi.org/10.1007/BF00881859
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00881859