A path ordering for proving termination of term rewriting systems

  • D. Kapur
  • P. Narendran
  • G. Sivakumar
Colloquium On Trees In Algebra And Programming Rewriting
Part of the Lecture Notes in Computer Science book series (LNCS, volume 185)


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.


Function Symbol Term Comparison Uniform Termination Full Path Term Rewrite System 
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

  1. [1]
    Buchberger, B., “A Theoretical Basis for the Reduction of Polynomials to Canonical Forms,” ACM-SIGSAM Bulletin, 39, August 1976, pp. 19–29.Google Scholar
  2. [2]
    Dershowitz, N., “Orderings for Term Rewriting Systems,” Theoretical Computer Science 17 (1982) 279–301.CrossRefGoogle Scholar
  3. [3]
    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.CrossRefGoogle Scholar
  4. [4]
    Huet, G., “Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems,” JACM, Vol. 27, No. 4, Oct., 1980, pp. 797–821.CrossRefGoogle Scholar
  5. [5]
    Huet, G., and Lankford, D.S. “On the Uniform Halting Problem for Term Rewriting Systems,” Rapport Laboria 283, INRIA, Paris, March 1978.Google Scholar
  6. [6]
    Jouannaud, J.-P., Lescanne, P., Reinig, F., “Recursive Decomposition Ordering,” Conf. on Formal Description of Programming Concepts, Garmisch, 1982.Google Scholar
  7. [7]
    Kamin, S., and Levy, J-J., “Attempts for Generalizing the Recursive Path Ordering,” Unpublished Manuscript, Feb. 1980.Google Scholar
  8. [8]
    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.Google Scholar
  9. [9]
    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.Google Scholar
  10. [10]
    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.Google Scholar
  11. [11]
    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.Google Scholar
  12. [12]
    Lankford, D.S., “On Proving Term Rewriting Systems are Noetherian,” Memo MTP-3, Mathematics Department, Louisiana Technical University, Ruston, LA (1979).Google Scholar
  13. [13]
    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).Google Scholar
  14. [14]
    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.Google Scholar
  15. [15]
    Peterson, G.E., and Stickel, M.E., “Complete Sets of Reductions for Some Equational Theories,” JACM, Vol. 28, No. 2, pp. 233–264.Google Scholar
  16. [16]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • D. Kapur
    • 1
  • P. Narendran
    • 1
  • G. Sivakumar
    • 2
  1. 1.Computer Science Branch Corporate Research and DevelopmentGeneral Electric CompanySchenectady
  2. 2.Dept. of Computer ScienceUniversity of IllinoisUrbana-Champaign

Personalised recommendations