Skip to main content
SpringerLink
Log in

Termination, geometry and invariants

  • Invited Talk
  • Conference paper
  • First Online:
Automated Deduction — CADE-12 (CADE 1994)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 814))

Included in the following conference series:

  • 150 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. E A Cichon, Bounds on Derivation Lengths from Termination Proofs, International Journal of Foundations of Computer Science, to appear.

    Google Scholar 

  2. J Davenport, Y Siret and E Tournier, Computer Algebra, Academic Press 1988

    Google Scholar 

  3. D De Schreye and Kristof Verschaetse, Tutorial on termination of logic programs, in Springer Lecture Notes in Computer Science 649, Meta-Programming in Logic, 1992

    Google Scholar 

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

    Google Scholar 

  5. J H Gallier, What's so special about Kruskal's theorem and the ordinal γ0? A survey of some results on Proof theory, Annals of Pure and Applied Logic 53 (1991)

    Google Scholar 

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

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

    Google Scholar 

  8. U Martin, Linear interpretations by counting patterns, in Springer Lecture Notes in Computer Science 690, 5th International Conference on Rewriting Techniques and Applications, Montreal, June 1993

    Google Scholar 

  9. U Martin and M F K Lai, Some experiments with a completion theorem prover, Journal of Symbolic Computation (1992) 13, 81–100

    Google Scholar 

  10. Ursula Martin and Elizabeth Scott, The order types of termination orderings on terms, strings and multisets, in proceedings of the Eighth IEEE Conference on Logic in Computer Science, Montreal, 1993

    Google Scholar 

  11. W W McCune, OTTER 2.0, in Proceedings of the 10th International conference on Computer Aided Deduction, Lecture Notes in Computer Science, Springer Verlag, 1990

    Google Scholar 

  12. T Saito, M Katsura, Y Kobayashi and K Kajitori, On Totally Ordered Free Monoids, in Words, Languages and Combinatorics, World Scientific Publishing Co, Singapore 1992

    Google Scholar 

  13. E A Scott, Weights for total division orderings on strings, to appear, Theoretical Computer Science 1994.

    Google Scholar 

  14. J Steinbach, Simplification orderings-history of results, to appear Fundamentae Informaticae, 1994.

    Google Scholar 

  15. A M Turing, Checking a large routine, in: Report of a Conference on High Speed Automatic Calculating Machines, Univ Math Lab Cambridge, 1949, 67–69

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematical and Computational Sciences, University of St. Andrews, 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

Alan Bundy

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martin, U. (1994). Termination, geometry and invariants. In: Bundy, A. (eds) Automated Deduction — CADE-12. CADE 1994. Lecture Notes in Computer Science, vol 814. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58156-1_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-58156-1_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48467-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation