Termination proofs by context-dependent interpretations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2051 LNCS, Issue , 2001, Pages 108-121

  Hofbauer, Dieter ^a  

^a UNIVERSITY OF KASSEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CONTEXT DEPENDENT; NATURAL NUMBER; OPTIMAL BOUNDS; REWRITE SYSTEMS; TERMINATION PROOF; TRADITIONAL APPROACHES; UPPER BOUND;

ARTIFICIAL INTELLIGENCE;

EID: 84888234955     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45127-7_10     Document Type: Conference Paper

References (35)

1. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
2. A. Ben Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9:137-159, 1987.
3. A. Cichon and P. Lescanne. Polynomial interpretations and the complexity of algorithms. In D. Kapur, editor, Proc. 11th Int. Conf. on Automated Deduction CADE-11, volume 607 of Lecture Notes in Artificial Intelligence, pages 139-147. Springer-Verlag, 1992.
4. A. Cichon and J.-Y. Marion. Light LPO. Technical Report 99-R-138, LORIA, Nancy, France, 1999.
5. N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3(1-2):69-115, 1987.
6. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243-320. Elsevier Science Publishers, 1990.
7. F. Drewes and C. Lautemann. Incremental termination proofs and the length of derivations. In R.V. Book, editor, Proc. 4th Int. Conf. on Rewriting Techniques and Applications RTA-91, volume 488 of Lecture Notes in Computer Science, pages 49-61. Springer-Verlag, 1991.
8. R. Frai'sse. Theory of Relations, volume 118 of Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1986.
9. O. Geupel. Terminationsbeweise bei Termersetzungssystemen. Diplomarbeit, Technische Universitat Dresden, Sektion Mathematik, 1988.
10. J. Giesl. Generating polynomial orderings for termination proofs. In J. Hsiang, editor, Proc. 6th Int. Conf. on Rewriting Techniques and Applications RTA-95, volume 914 of Lecture Notes in Computer Science, pages 426-431. Springer-Verlag, 1995.
11. J. Giesl. POLO - a system for termination proofs using polynomial orderings. Technical Report 95/24, Technische Hochschule Darmstadt, 1995.
12. D. Hofbauer. Termination proofs and derivation lengths in term rewriting systems. Dissertation, Technische Universitat Berlin, Germany, 1991. Available as Technical Report 92-46, TU Berlin, 1992.
13. D. Hofbauer. Termination proofs by multiset path orderings imply primitive recursive derivation lengths. Theoretical Computer Science, 105(1):129-140, 1992.
14. D. Hofbauer. Termination proofs for ground rewrite systems - interpretations and derivational complexity. Mathematische Schriften 24/00, Universitat Gh Kassel, Germany, 2000. To appear in Applicable Algebra in Engineering, Communication and Computing.
15. D. Hofbauer. An upper bound on the derivational complexity of Knuth-Bendix orderings. Mathematische Schriften 28/00, Universitat Gh Kassel, Germany, 2000. To appear in Information and Computation.
16. D. Hofbauer and C. Lautemann. Termination proofs and the length of derivations. In N. Dershowitz, editor, Proc. 3rd Int. Conf. on Rewriting Techniques and Applications RTA-89, volume 355 of Lecture Notes in Computer Science, pages 167-177. Springer-Verlag, 1989.
17. D. S. Lankford. On proving term rewriting systems are Noetherian. Memo MTP-3, Mathematics Department, Louisiana Tech. University, Ruston, LA, May 1979.
18. C. Lautemann. A note on polynomial interpretation. Bulletin of the European Association for Theoretical Computer Science, 36:129-131, Oct. 1988.
19. I. Lepper. Derivation lengths and order types of Knuth-Bendix orders. Technical report, Westfälische Wilhelms-Universitat Munster, Institut fur Mathematische Logik und Grundlagenforschung, Germany, May 2000. Available as , to appear in Theoretical Computer Science.
20. P. Lescanne. Termination of rewrite systems by elementary interpretations. Formal Aspects of Computing, 7(1):77-90, 1995.
21. Z. Manna and S. Ness. On the termination of Markov algorithms. In Proc. 3rd Hawaii Int. Conf. on System Science, pages 789-792, Honolulu, 1970.
22. J.-Y. Marion. Analysing the implicit complexity of programs. Technical Report 99-R-106, LORIA, Nancy, France, 1999.
23. V. C. S. Meeussen and H. Zantema. Derivation lengths in term rewriting from interpretations in the naturals. Technical Report RUU-CS-92-43, Utrecht University, The Netherlands, 1992.
24. F. L. Morris and C. B. Jones. An early program proof by Alan Turing. Annals of the History of Computing, 6(2):139-143, 1984.
25. J. Steinbach. Termination proofs of rewriting systems - Heuristics for generating polynomial orderings. Technical Report SR-91-14, Fachbereich Informatik, Uni-versitäat Kaiserslautern, Germany, 1991.
26. J. Steinbach. Proving polynomials positive. In R. Shyamasundar, editor, Proc. Foundations of Software Technology and Theoretical Computer Science, volume 652 of Lecture Notes in Computer Science, pages 191-202. Springer-Verlag, 1992.
27. J. Steinbach. Generating polynomial orderings. Information Processing Letters, 49(2):85-93, 1994.
28. J. Steinbach and M. Zehnter. Vademecum of polynomial orderings. Technical Report SR-90-03, Fachbereich Informatik, Universitäat Kaiserslautern, Germany, 1990.
29. H. Touzet. Propriétés combinatoires pour la terminaison de systemes de réécriture. PhD thesis, Universite Henri Poincaré - Nancy 1, France, 1997.
30. A. M. Turing. Checking a large routine. In Report of a Conference on High Speed Automatic Calculating Machines, pages 67-69. University Mathematics Lab, Cambridge University, 1949.
31. W. Wechler. Universal Algebra for Computer Scientists, volume 25 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1992.
32. A. Weiermann. Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths. Theoretical Computer Science, 139(l-2):355-362, 1995.
33. H. Zantema. Termination of term rewriting: interpretation and type elimination. Journal of Symbolic Computation, 17(l):23-50, 1994.
34. H. Zantema. Termination of term rewriting. Technical Report RUU-CS-2000-04, Utrecht University, The Netherlands, 2000.
35. H. Zantema. The termination hierarchy for term rewriting. To appear in Applicable Algebra in Engineering, Communication and Computing.