Abstract
A new method, which extends the lexicographic recursive path ordering of Dershowitz and Kamin and Levy, to prove termination of associative-commutative (AC) rewrite systems is proposed. Instead of comparing the arguments of an AC-operator using the multiset extension, we partition them into disjoint subsets and each subset is used only once for comparison. To preserve transitivity, we introduce two techniques—pseudocopying and elevating of arguments of an AC operator. This method imposes no 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 previous methods such as associative path ordering which restrict AC operators to be minimal or sub-minimal in precedence. A number of examples illustrating the power of the approach are discussed. The method has been implemented in SUTRA (formerly called RRL, Rewrite Rule Laboratory), a theorem proving environment based on rewrite techniques and completion.
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 Grant no. CCR-9009414.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ben Cherifa, A., and Lescanne, P. (1987). Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9, 2, 137–160.
Bachmair, L., and Plaisted, D.A. (1985). Termination orderings for associative-commutative rewriting systems. J. of Symbolic Computation, 1, 329–349
Dershowitz, N. (1987). Termination of rewriting. J. of Symbolic Computation, 3, 69–116.
Gnaeding, I., and Lescanne, P. (1986). Proving termination of associative-commutative rewriting systems by rewriting. Proc. of 8th International Conference on Automated Deduction (CADE-8), Oxford, Lecture Notes in Computer Science 230 (ed. Siekmann), Springer Verlag, 52–60.
Hullot, J.-M. (1980). A catalogue of canonical term rewriting systems. Technical Report CSL-113, SRI International, Menlo Park, CA.
Jouannaud, J.-P., Lescanne, P., and Reinig, F. (1982). Recursive decomposition ordering. IFIP Working Conference on Formal Description of Programming Concepts, (ed. D. Bjorner), W. Germany, 331–348.
Kamin, S., and Levy, J-J. (1980). Attempts for generalizing the recursive path ordering. Unpublished Manuscript, INRIA, France.
Kapur, D., Narendran, P., and Sivakumar, G. (1985). A path ordering for proving termination of term rewriting systems. Proc. 10th CAAP, Berlin, LNCS 185, 173–187.
Kapur, D., Sivakumar, G., and Zhang, H. (1990). Termination of AC-Rewrite Systems. Technical Report, Computer Science Dept., University of Delaware, in preparation.
Kapur, D., and Zhang, H. (1987). RRL: A Rewrite Rule Laboratory — User's Manual. GE Corporate Research and Development Report, Schenectady, NY. (Revised May 1989, Tech. Report 89-03, Dept. of Computer Science, Univ. of Iowa.)
Kapur, D., and Zhang, H. (1988). RRL: A Rewrite Rule Laboratory, Proc. of 9th International Conference on Automated Deduction (CADE-9), Argonne, Lecture Notes in Computer Science 310 (eds. Lusk and Overbeek), Springer Verlag, 768–769.
Knuth, D.E. and Bendix, P.B. (1970). Simple word problems in universal algebras. In: Computational Problems in Abstract Algebras. (ed. J. Leech), Pergamon Press, 263–297.
Lankford, D.S. (1979). On proving term rewriting systems are noetherian. Memo MTP-3, Lousiana State University.
Lankford, D.S., and Ballantyne, A.M. (1977). Decision procedures for simple equational theories with commutative-associative axioms: complete sets of commutative-associative reductions. Automatic Theorem Proving Project, Dept. of Math. and Computer Science, University of Texas, Austin, Texas, Report ATP-39.
Lescanne, P., (1990). On the recursive decomposition ordering with lexicographical status and other related orderings, J. Automated Reasoning, 6, 1, 39–49.
Peterson, G.L., and Stickel, M.E. (1981). Complete sets of reductions for some equational theories. J. ACM, 28, 2, 233–264.
Steinbach, J. (1989). Extensions and comparison of simplification orderings. Proc. 3rd International Conf. on Rewriting Techniques and Applications (RTA-89), Chapel Hill, NC, 434–448.
Steinbach, J. (1989). Path and decomposition orderings for proving AC-termination. Seki-Report, SR-89-18, University of Kaiserslautern. See also “Improving associative path orderings,” in: Proc. of 10th International Conference on Automated Deduction (CADE-10), Kaiserslautern, Lecture Notes in Computer Science 449 (ed. Stickel), Springer Verlag, 411–425.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kapur, D., Sivakumar, G., Zhang, H. (1990). A new method for proving termination of AC-rewrite systems. In: Nori, K.V., Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1990. Lecture Notes in Computer Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53487-3_40
Download citation
DOI: https://doi.org/10.1007/3-540-53487-3_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53487-7
Online ISBN: 978-3-540-46313-9
eBook Packages: Springer Book Archive