Skip to main content
SpringerLink
Log in
Book cover

International Conference on Rewriting Techniques and Applications

RTA 1997: Rewriting Techniques and Applications pp 142–156Cite as

A total, ground path ordering for proving termination of AC-rewrite systems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1232))

Abstract

A new path ordering for showing termination of associative-commutative (AC) rewrite systems is defined. If the precedence relation on function symbols is total, the ordering is total on ground terms, but unlike the ordering proposed by Rubio and Nieuwenhuis, this ordering can orient the distributivity property in the proper direction. The ordering is defined in a natural way using recursive path ordering with status as the underlying basis. This settles a longstanding problem in termination orderings for AC rewrite systems. The ordering can be used to define an ordering on nonground terms.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bachmair, L., and Plaisted, D.A. (1985): Termination orderings for associative-commutative rewriting systems. J. Symbolic Computation, 1, 329–349

    Google Scholar 

  2. 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.

    Article  Google Scholar 

  3. Comon, H., Nieuwenhuis, R., and Rubio, A. (1995): Orderings, AC-theories, and symbolic constraint solving, In Proc. 10th IEEE Symp. Logic in Computer Science, San Diego, 1995.`

    Google Scholar 

  4. Delor, C., Puel, L. (1993): Extension of the associative path ordering to a chain of associative commutative symbols. Proc. of 5th Intl. Conf. on Rewrite Techniques and Applications (RTA-93), LNCS, Springer-Verlag, 389–404.

    Google Scholar 

  5. Dershowitz, N. (1987): Termination of rewriting. J. Symbolic Computation, 3, 69–116.

    Google Scholar 

  6. Gnaeding, I., and Lescanne, P. (1986): Proving termination of associative-commutative rewriting systems by rewriting. Proc. of 8th Intl. Conf. on Automated Deduction (CADES), Oxford, LNCS 230 (ed. Siekmann), Springer Verlag, 52–60.

    Google Scholar 

  7. Kapur, D., and Sivakumar, G. (1995): Maximal extensions of simplification orderings. Proc. of 15th Conf. on Foundations of Software Technology and Theoretical Computer Science (ed. Thiagarajan), Bangalore, India, Springer Verlag LNCS 1026, 225–239, Dec. 1995.

    Google Scholar 

  8. Kapur, D., and Sivakumar, G. (1997): A total, ground path ordering for proving termination of AC-Rewrite systems. Dept. of Computer Science, University at Albany, Albany, NY. An expanded version of this paper.

    Google Scholar 

  9. Kapur, D., Sivakumar, G. and Zhang, H. (1995): A new ordering for proving termination of AC-rewrite systems. J. Automated Reasoning, 1995.

    Google Scholar 

  10. Kapur, D., and Zhang, H. (1995): An overview of Rewrite Rule Laboratory (RRL). J. Computer and Mathematics with Applications, 29, 2, 91–114.

    Google Scholar 

  11. Lankford, D.S. (1979): On proving term rewriting systems are noetherian. Memo MTP-3, Lousiana State University.

    Google Scholar 

  12. Marche, C. (1994): Normalized rewriting and normalized completion. In Proc. 9th IEEE Symp. Logic in Computer Science, Paris, 1994.

    Google Scholar 

  13. Narendran, P., and Rusinowitch, M. (1991): Any ground associative commutative theory has a finite canonical system. In Book, R. (ed.) Proc. of 4th Intl. Conf. on Rewrite Techniques and Applications (RTA-91), LNCS 488, 423–434.

    Google Scholar 

  14. Rubio, A., Nieuwenhuis, R. (1993): A precedence-based total AC-compatible ordering. In Kirchner, C. (ed.) Proc. of 5th Intl. Conf. on Rewrite Techniques and Applications (RTA-93), LNCS Springer-Verlag, 374–388.

    Google Scholar 

  15. 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 Intl. Conf. on Automated Deduction (CADE-10), Kaiserslautern, LNCS 449 (ed. Stickel), 411–425.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, State University of New York, 12222, Albany, NY

    Deepak Kapur

  2. Computer Science Department, Indian Institute of Technology, Bombay, India

    G. Sivakumar

Authors
  1. Deepak Kapur
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Sivakumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hubert Comon

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kapur, D., Sivakumar, G. (1997). A total, ground path ordering for proving termination of AC-rewrite systems. In: Comon, H. (eds) Rewriting Techniques and Applications. RTA 1997. Lecture Notes in Computer Science, vol 1232. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62950-5_67

Download citation

  • DOI: https://doi.org/10.1007/3-540-62950-5_67

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62950-4

  • Online ISBN: 978-3-540-69051-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation