Abstract
A new partial ordering scheme for proving uniform termination of term rewriting systems is presented. The basic idea is that two terms are compared by comparing the paths through them. It is shown that the ordering is a well-founded simplification ordering and also a strict extension of the recursive path ordering scheme of Dershowitz. Terms can be compared under this path ordering in polynomial time.
This work was done when Sivakumar was a graduate student in the Dept. of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY. Kapur and Sivakumar were partially supported for this research by the NSF grant MCS-8211621.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
10. References
Buchberger, B., “A Theoretical Basis for the Reduction of Polynomials to Canonical Forms,” ACM-SIGSAM Bulletin, 39, August 1976, pp. 19–29.
Dershowitz, N., “Orderings for Term Rewriting Systems,” Theoretical Computer Science 17 (1982) 279–301.
Guttag, J.V., Kapur, D., and Musser, D.R., “On Proving Uniform Termination and Restricted Termination of Rewriting Systems,” SIAM Journal on Computing, Vol. 12, No. 1, February, 1983, pp. 189–214.
Huet, G., “Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems,” JACM, Vol. 27, No. 4, Oct., 1980, pp. 797–821.
Huet, G., and Lankford, D.S. “On the Uniform Halting Problem for Term Rewriting Systems,” Rapport Laboria 283, INRIA, Paris, March 1978.
Jouannaud, J.-P., Lescanne, P., Reinig, F., “Recursive Decomposition Ordering,” Conf. on Formal Description of Programming Concepts, Garmisch, 1982.
Kamin, S., and Levy, J-J., “Attempts for Generalizing the Recursive Path Ordering,” Unpublished Manuscript, Feb. 1980.
Kandri-Rody, A. and Kapur, D., “Algorithms for Computing the Grobner Bases of Polynomial Ideals over Various Euclidean Rings,” Proceedings of EUROSAM '84, Cambridge, England, July, 1984, Springer Verlag Lecture Notes in Computer Science LNCS 174, (ed. J. Fitch), pp. 195–206.
Kapur, D., and Narendran, P., “The Knuth-Bendix Completion Procedure and Thue Systems,” Third Conference on Foundation of Computer Science and Software Engg., Bangalore, India, December 1983, pp. 363–385.
Kapur, D., and Sivakumar, G., “Architecture of and Experiments with RRL, a Rewrite Rule Laboratory,” Proceedings of the NSF Workshop on Rewrite Rule Laboratory, Rensselaerville, NY, September 4–6, 1983.
Knuth, D.E. and Bendix, P.B., “Simple Word Problems in Universal Algebras,” in Computational Problems in Abstract Algebras (ed. J. Leech), Pergamon Press, 1970, pp. 263–297.
Lankford, D.S., “On Proving Term Rewriting Systems are Noetherian,” Memo MTP-3, Mathematics Department, Louisiana Technical University, Ruston, LA (1979).
Lankford, D.S., and Ballantyne A.M., “Decision Procedures for Simple Equational Theories with Commutative-Associative Axioms: Complete Sets of Commutative-Associative Reductions,” Memo ATP-39, Dept. of Mathematics and Computer Sciences, Univ. of Texas, Austin, TX (1979).
Lescanne, P., “How to Prove Termination? An Approach to the Implementation of a New Recursive Decomposition Ordering,” Proceedings of an NSF Workshop on the Rewrite Rule Laboratory Sept. 6–9 Sept. 1983, (eds. Guttag, Kapur, Musser), General Electric Research and Development Center Report 84GEN008, April, 1984, pp. 109–121.
Peterson, G.E., and Stickel, M.E., “Complete Sets of Reductions for Some Equational Theories,” JACM, Vol. 28, No. 2, pp. 233–264.
Plaisted, D.A., “A Recursively Defined Ordering for Proving Termination of Term Rewriting Systems,” Report R78-943, Dept. of Computer Science, Univ. of Illinois, Urbana, IL.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kapur, D., Narendran, P., Sivakumar, G. (1985). A path ordering for proving termination of term rewriting systems. In: Ehrig, H., Floyd, C., Nivat, M., Thatcher, J. (eds) Mathematical Foundations of Software Development. CAAP 1985. Lecture Notes in Computer Science, vol 185. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15198-2_11
Download citation
DOI: https://doi.org/10.1007/3-540-15198-2_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15198-2
Online ISBN: 978-3-540-39302-3
eBook Packages: Springer Book Archive