Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1998: Mathematical Foundations of Computer Science 1998 pp 239–247Cite as

Reducing AC-termination to termination

  • Contributed Papers
  • Conference paper
  • First Online:

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

Abstract

We present a new technique for proving AC-termination. We show that if certain conditions are met, AC-termination can be reduced to termination, i. e., termination of a TRS S modulo an AC-theory can be inferred from termination of another TRS R with no AC-theory involved. This is a new perspective and opens new possibilities to deal with AC-termination.

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. T. Aoto and Y. Toyama. Termination transformation by tree lifting ordering. In Proc. of the 9th Int. Conf. on Rewriting Techniques and Applications — RTA 98, volume 1379 of LNCS. Springer, 1998.

    Google Scholar 

  2. T. Arts. Automatically proving termination and innermost normalisation of term rewriting systems. PhD thesis, Universiteit Utrecht, May 1997.

    Google Scholar 

  3. F. Bellegarde and P. Lescanne. Termination by completion. Applicable Algebra in Engineering, Communication and Computing, 1(2):79–96, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  4. C. Delor and L. Puel. Extension of the associative path ordering to a chain of associative commutative symbols. In Proc. of the 5th Int. Conf. on Rewrite Techniques and Applications (RTA), number 690 in LNCS, pages 389–404. Springer, 1993.

    Google Scholar 

  5. N. Dershowitz. Orderings for term rewriting systems. Theoretical Computer Science, 17(3):279–301, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  6. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B. Elsevier, 1990.

    Google Scholar 

  7. M. C. F. Ferreira. Dummy Elimination in Equational Rewriting. In Proc. of the 7th Int. Conf. on Rewriting Techniques and Applications, volume 1103 of LNCS, pages 78–92. Springer, 1996.

    Google Scholar 

  8. M. C. F. Ferreira and D. Kesner and L. Puel. Reducing AC-Termination to Termination. Technical Report 1175, Université Paris-Sud. 1998.

    Google Scholar 

  9. M. C. F. Ferreira and H. Zantema. Dummy elimination: making termination easier. In Fundamentals of Computation Theory, 10th Int. Conference FCT'95, volume 965 of LNCS, pages 243–252. Springer, 1995.

    Google Scholar 

  10. S. Kamin and J. J. Lévy. Two generalizations of the recursive path ordering. University of Illinois, 1980.

    Google Scholar 

  11. D. Kapur and G. Sivakumar. A Total, Ground Path Ordering for Proving Termination of AC-Rewrire Systems. In Proc. of the 8th Int. Conf. on Rewriting Techniques and Applications — RTA '97, volume 1232 of LNCS. Springer, 1997.

    Google Scholar 

  12. D. Kapur, G. Sivakumar, and H. Zhang. A new method for proving termination of ac-rewrite systems. In Proc. of the 10th Conf. on Foundations of Software Technology and Theoretical Computer Science, volume 472 of LNCS, pages 133–148. Springer, 1990.

    Google Scholar 

  13. J. W. Klop. Term rewriting systems. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume II, pages 1–116. Oxford University Press, 1992.

    Google Scholar 

  14. C. Marché. Normalized rewriting and normalized completion. In Proc. of the 9th IEEE Symposium on Logic in Computer Science, pages 394–403, 1994.

    Google Scholar 

  15. P. Narendran and M. Rusinowitch. Any ground associative-commutative theory has a finite canonical system. In Proc. of the 4th Int. Conf. on Rewriting Techniques and Applications, volume 488 of LNCS, pages 423–434. Springer, 1991.

    Google Scholar 

  16. H. Osaki and A. Middeldorp. Type introduction for equational rewriting. In Proc. of the 4th Int. Symposium Logical Foundations of Computer Science — LFCS 97, volume 1234 of LNCS, pages 283–293. Springer, 1997.

    Google Scholar 

  17. D. A. Plaisted. Equational reasoning and term rewriting systems. In D. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 1 — Logical Foundations, pages 273–364. Oxford Science Publications, Clarendon Press — Oxford, 1993.

    Google Scholar 

  18. A. Rubio. A total AC-compatible ordering with RPO scheme, 1997. Draft.

    Google Scholar 

  19. A. Rubio and R. Nieuwenhuis. A precedence-based total AC-compatible ordering. Theoretical Computer Science, 142:209–227, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  20. H. Xi. Towards automated termination proofs through ”freezing”. In Proc. of the 9 th Int. Conf. in Rewriting Techniques and Applications — RTA 98, volume 1379 of LNCS. Springer, 1998.

    Google Scholar 

  21. H. Zantema. Termination of term rewriting: interpretation and type elimination. Journal of Symbolic Computation, 17:23–50, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  22. H. Zantema. Termination of term rewriting by semantic labelling. Fundamenta Informaticae, 24:89–105, 1995.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dep. de Informática, Fac. de Ciências e Tecnologia, Univ. Nova de Lisboa, Quinta da Torre, 2825, Monte da Caparica, Portugal

    Maria C. F. Ferreira

  2. CNRS and Laboratoire de Recherche en Informatique, Université de Paris-Sud, Bât 490, 91405, Orsay Cedex, France

    Delia Kesner & Laurence Puel

Authors
  1. Maria C. F. Ferreira
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Delia Kesner
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Laurence Puel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luboš Brim Jozef Gruska Jiří Zlatuška

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ferreira, M.C.F., Kesner, D., Puel, L. (1998). Reducing AC-termination to termination. In: Brim, L., Gruska, J., Zlatuška, J. (eds) Mathematical Foundations of Computer Science 1998. MFCS 1998. Lecture Notes in Computer Science, vol 1450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055773

Download citation

  • DOI: https://doi.org/10.1007/BFb0055773

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64827-7

  • Online ISBN: 978-3-540-68532-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation