Advertisement

Associative path orderings

  • Leo Bachmair
  • David A. Plaisted
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 202)

Abstract

In this paper we introduce a new class of orderings — associative path orderings — for proving termination of associative commutative term rewriting systems. These orderings are based on the concept of simplification orderings and extend the well-known recursive path orderings to E-congruence classes, where E is an equational theory consisting of associativity and commutativity axioms. The associative path ordering is similar to another termination ordering for proving AC termination, described in Dershowitz, et al. (83), which is also based on the idea of transforming terms. Our ordering is conceptually simpler, however, since any term is transformed into a single term, whereas in Dershowitz, et al. (83) the transform of a term is a multiset of terms. More important yet, we show how to lift our ordering to non-ground terms, which is essential for applications of the Knuth-Bendix completion method but was not possible with the previous ordering.

Associative path orderings require less expertise than polynomial orderings. They are applicable to term rewriting systems for which a precedence ordering on the set of operator symbols can be defined that satisfies a certain condition, the associative pair condition. The precedence ordering can often be derived from the structure of the reduction rules. We include termination proofs for various term rewriting systems (for rings, boolean algebra, etc.) and, in addition, point out ways of dealing with equational theories for which the associative pair condition does not hold.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Bachmair, Termination orderings for associative commutative rewriting systems, Report UIUCDCS-R-84-1179, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, December 1984.Google Scholar
  2. N. Dershowitz, A note on simplification orderings. Information Processing Letters 9 (1979), 212–215.Google Scholar
  3. N. Dershowitz, Orderings for term-rewriting systems, Theoretical Computer Science 17 (1982), 279–301.Google Scholar
  4. N. Dershowitz, J. Hsiang, N.A. Josephson and D.A. Plaisted, Associative-commutative rewriting. Proc. 8th IJCAI, Karlsruhe, 1983, 990–994.Google Scholar
  5. J. Hsiang, Topics in automated theorem proving and program generation, Ph. D. thesis, Univ. of Illinois at Urbana-Champaign, 1983.Google Scholar
  6. G. Huet, Confluent reductions: abstract properties and applications to term rewriting systems. J. ACM 27 (1980), 797–821.Google Scholar
  7. G. Huet and D.C. Oppen, Equations and rewrite rules: a survey. Formal languages: Perspectives and Open Problems (R. Book, ed.), New York: Academic Press, 1980, 349–405.Google Scholar
  8. J.-M. Hullot, A catalogue of canonical term rewriting systems, Technical Report CSL-113, SRI International, Menlo Park, Calif., April 1980.Google Scholar
  9. J.-P. Jouannaud and H. Kirchner, Completion of a set of rules modulo a set of equations, 11th Ann. ACM Symp. on Principles of Programming Languages, Salt Lake City, Utah, 1984, 83–92.Google Scholar
  10. J.-P. Jouannaud and M. Munoz, Termination of a set of rules modulo a set of equations, Proc. 7th Int. Conf. on Automated Deduction (R. Shostak, ed.). Lecture Notes in Comp. Scie. 170, Berlin: Springer Verlag, 1984, 175–193.Google Scholar
  11. D. Knuth and P. Bendix, Simple word problems in universal algebras. Computational Problems in Abstract Algebra (J. Leech, ed.), Pergamon Press, 1970, 263–297.Google Scholar
  12. D. Lankford and A. Ballantyne, Decision procedures for simple equational theories with associative commutative axioms: complete sets of associative commutative reductions. Technical Report, Univ. of Texas at Austin, Dept. of Math. and Comp. Scie., 1977.Google Scholar
  13. M. Munoz, Probleme de terminaison finie des systemes de reecriture equationnels. Ph. D. thesis, Universite Nancy 1, 1983.Google Scholar
  14. G.E. Peterson and M.E. Stickel, Complete sets of reductions for some equational theories, J. ACM 28 (1981), 233–264.Google Scholar
  15. D.A. Plaisted, An associative path ordering, Proc. NSF Workshop on the Rewrite Rule Laboratory, Report 84GEN008, General Electric, Schenectady, New York, April 1984, 123–136.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Leo Bachmair
    • 1
  • David A. Plaisted
    • 2
  1. 1.Department of Computer ScienceUniversity of Illinois at Urbana-ChampaignUSA
  2. 2.Department of Computer ScienceUniversity of North Carolina at Chapel HillUSA

Personalised recommendations