Invariants, Patterns and Weights for Ordering Terms

Journal of Symbolic Computation

Volumn 29, Issue 6, 2000, Pages 921-957

  Martin, Ursula ^a   Shand, Duncan ^a  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037672963     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1999.0333     Document Type: Article

References (25)

1. Ben Cherifa A., Lescanne P. Termination of rewriting systems by polynomial interpretations and its implementation. Sci. Comput. Program. 9:1987;137-159.
2. Cichon E. A., Weiermann A. Term rewriting theory for the primitive recursive functions. Ann. Pure Appl. Logic. 83:1997;199-223.
3. N. Cropper, U. Martin, 2000.
4. Dershowitz N. Orderings for term-rewriting systems. Theor. Comput. Sci. 17:1982;279-301.
5. Dick J., Kalmus J., Martin U. Automating the Knuth-Bendix ordering. Acta Inform. 28:1990;95-119.
6. Faugere J., Gianni P., Lazard D., Mora T. Efficient computation of zero-degree Gröbner bases by change of ordering. J. Symb. Comput. 16:1993;329-344.
7. 0? A survey of some results in proof theory. Ann. Pure Appl. Logic. 53:1991;199-260.
8. Hofbauer D. Termination proofs by multiset path ordering imply primitive recursive derivation lengths. Theor. Comput. Sci. 105:1992;129-140.
9. Knuth D., Bendix P. Simple word Problems in Universal Algebras. Leech J. Computational Problems in Abstract Algebra. 1970;263-298 Pergamon Press, Oxford.
10. D. S. Lankford, 1975, University of Austin, Texas.
11. P. Lescanne, the Seventh IJCAI, 1981, 548, 550.
12. Linton S., Shand D. Some group theoretic examples for completion theorem provers. J. Autom. Reasoning. 17:1996;145-169.
13. Martin U. A geometrical approach to multiset orderings. Theor. Comput. Sci. 67:1989;37-54.
14. Martin U. A note on division orderings on strings. Inf. Process. Lett. 36:1990;237-240.
15. Martin U. Linear interpretations by counting patterns. Kirchner C. RTA '93. 1993;421-433 Springer, New York.
16. Martin U. On the diversity of orderings on strings. Fundam. Inf. 24:1995;25-46.
17. Martin U. Theorem proving with group presentations: examples and questions. McRobbie M., Slaney J. CADE-13. 1996;358-372 Springer, New York.
18. Martin U., Scott E. The order types of termination orderings on monadic terms, strings and multisets. J. Symb. Logic. 62:1997;624-635.
19. Middeldorp A., Gramlich B. Simple termination is difficult. Appl. Algebra Eng., Commun. Comput. 6:1995;115-128.
20. Mora T., Robbiano L. The Gröbner fan of an ideal. J. Symb. Comput. 6:1986;183-208.
21. Prohle P., Perlo-Freeman S. Scott's conjecture is true, position sensitive weights. Comon H. RTA-97. 1997;217-228 Springer, New York.
22. Scott E. Weights for total division orderings on strings. Theor. Comput. Sci. 135:1994;345-359.
23. Steinbach J. Simplification orderings: history of results. Fundam. Inf. 24:1995;47-87.
24. H. Touzet, 1997.
25. Zantema H. Termination of term rewriting: interpretation and type elimination. J. Symb. Comput. 17:1994;23-50.