Skip to main content
SpringerLink
Log in

Linear interpretations by counting patterns

  • Conference paper
Book cover 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:

  • 193 Accesses

Abstract

We introduce a new family of well-founded monotonic orderings on terms, constructed bu counting certain patterns in terms called zig-zags. These extend the familiar Knuth Bendix orderings, providing in general continuum many distinct new orderings with a given choice of Knuth-Bendix weight.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
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.

References

  1. A. Ben Cherifa and P. Lescanne, Termination of rewriting systems by polynomial interpretations and its implementation, Science of Computer Programming 9 (1987) 137–160

    Article  MATH  MathSciNet  Google Scholar 

  2. M. Dauchet, Simulation of Turing machines by a left linear rewrite rule, in Proc 3rd International Conference on Term Rewriting Systems, Springer Lecture Notes in Computer Science 355 (1989) 109–120

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. N. Dershowitz, Termination of Rewriting, Journal of Symbolic Computation, 3 (1987) 69–116

    Article  MATH  MathSciNet  Google Scholar 

  5. A. J. J. Dick, J. R. Kalmus and U. Martin, Automating the Knuth Bendix ordering, Acta Informatica 28 (1990) 95–119

    Article  MATH  MathSciNet  Google Scholar 

  6. G. Higman, Ordering by divisibility in abstract algebras, Proceedings of the London Mathematical Society 2 (1952) 326–336

    Article  MATH  MathSciNet  Google Scholar 

  7. J-P. Jouannaud, P. Lescanne and F. Reinig, Recursive decomposition ordering, in Formal description of programming concepts 2, Elsevier 1982, ed D Bjorner, pp 331–348

    Google Scholar 

  8. D. Knuth and P. Bendix, Simple Word Problems in Universal Algebras, in Computational Problems in Abstract Algebra, Pergamon Press 1970, ed J. Leech.

    Google Scholar 

  9. D. S. Lankford, On proving term rewriting systems are Noetherian, Tech report MTP-3, Louisiana Technical University, Ruston 1979

    Google Scholar 

  10. P. Lescanne, Termination of rewrite systems by elementary interpretations, in H Kirchner and G Levi, editors, Proc 3rd International Conference on Algebraic and Logic Programming, Springer Lecture Notes in Computer Science 463 (1992) 21–36

    Google Scholar 

  11. U. Martin, A geometrical approach to multiset orderings, Theoretical computer Science 67 (1989) 37–54

    Article  MATH  MathSciNet  Google Scholar 

  12. U. Martin, On the diversity of orderings on strings, RHBNC Technical Report 1991

    Google Scholar 

  13. P. Narendran and M. Rusinowitch, Any ground associative-commutative theory has a finite canonical system, Proc 4th International Conference on Term Rewriting Systems, Springer Lecture Notes in Computer Science 488, 423–434

    Google Scholar 

  14. J. Steinbach, Extensions and comparison of simplification ordering, in Proc 3rd International Conference on Term Rewriting Systems, Springer Lecture Notes in Computer Science 355 (1989) 434–448

    Article  MathSciNet  Google Scholar 

  15. H. Zantema, Termination of term rewriting by interpretation, Utrecht University technical report RUU-CS-92-14, April 1992

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical and Computational Sciences, University of St Andrews, Fife KY16 6SX, St Andrews, Scotland

    Ursula Martin

Authors
  1. Ursula Martin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INRIA Lorraine and CRIN, 615 Rue du Jardin Botanique, F-54602, Villers les Nancy Cedex, France

    Claude Kirchner

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martin, U. (1993). Linear interpretations by counting patterns. 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_31

Download citation

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

  • 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

Search

Navigation