Skip to main content

A precedence-based total AC-compatible ordering

  • Conference paper
Rewriting Techniques and Applications (RTA 1993)

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

Included in the following conference series:

  • 201 Accesses

Abstract

Like Narendran and Rusinowitch [NR91], we define a simplification ordering which is AC-compatible and total on non-AC-equivalent ground terms, without any restrictions on the signature like the number of AC-symbols or free symbols.

An important difference w.r.t. their work is that our ordering is not based on polynomial interpretations, but on a total (arbitrary) precedence on the function symbols, like in LPO or RPO (this solves an open question posed e.g. by Bachmair [Bac91]).

A second difference is that we define an extension to terms with variables, which makes the ordering applicable in practice for complete theorem proving strategies with built-in AC-unification and for orienting non-ground rewrite systems.

Our ordering is defined in a simple way by means of rewrite rules, and can be easily (and efficiently) implemented, since its main component is RPO.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Leo Bachmair. Associative-commutative reduction orderings. Technical Report MPI-I-91-209, Max-Planck-Institut für Informatik, Saarbrücken, November 1991. To appear in IPL.

    Google Scholar 

  2. Ahlem Ben-Cherifa and Pierre Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9:137–160, 1987.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Hubert Comon. Solving symbolic ordering constraints. International Journal of Foundations of Computer Science, 1(4):387–411, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  5. Nachum Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3:69–116, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  6. J-P. Jouannaud and M. Okada. Satisfiability of systems of ordinal notations with the subterm property is decidable. In Automata, Languages and Programming, 18th International Colloquium, LNCS 510, Madrid, Spain, July 16–20 1991. Springer-Verlag.

    Google Scholar 

  7. D. Kapur, G. Sivakumar, and H. Zhang. A new method for proving termination of ac-rewrite systems. In Conf. Found. of Software Technology and Theoretical Computer Science, LNCS 472, pages 134–148, New Delhi, India, December 1990. Springer-Verlag.

    Google Scholar 

  8. Palialh Narendran and Michael Rusinowitch. Any ground associative commutative theory has a finite canonical system. In Fourth int. conf. on Rewriting Techniques and Applications, LNCS 488, pages 423–434, Como, Italy, April 1991. Springer-Verlag.

    Google Scholar 

  9. Robert Nieuwenhuis and Albert Rubio. Theorem proving with ordering constrained clauses. In Deepak Kapur, editor, 11th International Conference on Automated Deduction, LNAI 607, pages 477–491, Saratoga Springs, New York, USA, June 15–18, 1992. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rubio, A., Nieuwenhuis, R. (1993). A precedence-based total AC-compatible ordering. In: Kirchner, C. (eds) Rewriting Techniques and Applications. RTA 1993. Lecture Notes in Computer Science, vol 690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21551-7_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-21551-7_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56868-1

  • Online ISBN: 978-3-662-21551-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics