Relative undecidability in term rewriting. I. The termination hierarchy

Information and Computation

Volumn 178, Issue 1, 2002, Pages 101-131

  Geser, Alfons ^a   Middeldorp, Aart ^b   Ohlebusch, Enno ^c   Zantema, Hans ^d  

^a NASA LANGLEY RESEARCH CENTER   (United States)

^b UNIVERSITY OF TSUKUBA   (Japan)

^c BIELEFELD UNIVERSITY   (Germany)

^d EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Term rewriting; Termination; Undecidability

Indexed keywords

POLYNOMIALS; PROBLEM SOLVING; SYSTEMS ANALYSIS; THEOREM PROVING; TURING MACHINES;

POLYNOMIAL TERMINATION; RELATIVE UNDECIDABILITY; TERM REWRITING; WEAK NORMALIZATION;

DECISION THEORY;

EID: 0037057880     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(02)93120-2     Document Type: Article

References (27)

1. Baader, F., and Nipkow, T. (1998), "Term Rewriting and All That," Cambridge University Press, Cambridge, UK.
2. Bonfante, G., Cichon, A., Marion, J.-Y., and Touzet, H. (1998), Complexity classes and rewrite systems with polynomial interpretation, in "Proceedings of the 11th Annual Conference of the European Association for Computer Science Logic," Lecture Notes in Computer Science, Vol. 1584, pp. 372-384, Springer-Verlag, Berlin.
3. Dauchet, M. (1992), Simulation of Turing machines by a regular rewrite rule, Theoret. Comput. Sci. 103, 409-420.
4. Dershowitz, N., and Jouannaud, J.-P. (1990), Rewrite systems, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Vol. B, pp. 243-320, Elsevier, Amsterdam.
5. Dershowitz, N., Jouannaud, J.-P., and Klop, J. W. (1995), Problems in rewriting III, in "Proceedings of the 6th International Conference on Rewriting Techniques and Applications," Lecture Notes in Computer Science, Vol. 914, pp. 457-471, Springer-Verlag, Berlin.
6. Ferreira, M., and Zantema, H. (1996), Total termination of term rewriting, Appl. Algebra. Engrg. Comm. Comput. 7(2), 133-162.
7. Geser, A. (1997), Omega-termination is undecidable for totally terminating term rewriting systems, J. Symbolic Comput. 23, 399-411.
8. Geser, A., Middeldorp, A., Ohlebusch, E., and Zantema, H. (To appear), Relative undecidability in term rewriting, II: The confluence hierarchys, Inform. and Comput.
9. Geser, A., Middeldorp, A., Ohlebusch, E., and Zantema, H. (1997), Relative undecidability in term rewriting, in "Proceedings of the 10th Annual Conference of the European Association for Computer Science Logic," Lecture Notes in Computer Science, Vol. 1258, pp. 150-166, Springer-Verlag, Berlin.
10. Geser, A., Middeldorp, A., Ohlebusch, E., and Zantema, H. (1997), Relative undecidability in the termination hierarchy of single rewrite rules, in "Proceedings of the 22nd Colloquium on Trees in Algebra and Programming," Lecture Notes in Computer Science, Vol. 1214, pp. 237-248, Springer-Verlag, Berlin.
11. Huet, G., and Lankford, D. S. (1978), "On the Uniform Halting Problem for Term Rewriting Systems," Rapport Laboria 283, INRIA.
12. Huet, G., and Oppen, D. C. (1980), Equations and rewrite rules: A survey, in "Formal Language Theory: Perspectives and Open Problems" (R. Book, Ed.), pp. 349-405, Academic Press, San Diego.
13. Klop, J. W. (1992), Term rewriting systems, in "Handbook of Logic in Computer Science" (S. Abramski, D. Gabbay, and T. Maibaum, Eds.), Vol. 2, pp. 1-116, Oxford University Press, London.
14. Kruskal, J. B. (1960), Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture, Trans. Amer. Math. Soc. 95, 210-225.
15. Lescanne, P. (1994), On termination of one rule rewrite systems, Theoret. Comput. Sci. 132, 395-401.
16. Martin, U. (1998), New directions for syntactic termination orderings, Prog. Comput. Sci. Appl. Logic 15, 209-224.
17. Martin, U., and Scott, E. (1997), The order types of termination orderings on monadic terms, strings and multisets, J. Symbolic Logic 62(2), 624-635.
18. Matiyasevich, Y., and Senizergues, G. (1996), Decision problems for semi-Thue systems with a few rules, in "Proceedings of the 11th IEEE Annual Symposium on Logic in Computer Science," pp. 523-531.
19. Middeldorp, A., and Gramlich, B. (1995), Simple termination is difficult, Appl. Algebra. Engrg. Comm. Comput. 6(2), 115-128.
20. Middeldorp, A., Ohsaki, H., and Zantema, H. (1996), Transforming termination by self-labelling, in "Proceedings of the 13th International Conference on Automated Deduction," Lecture Notes in Artificial Intelligence, Vol. 1104, pp. 373-386, Springer-Verlag, Berlin.
21. Middeldorp, A., and Zantema, H. (1997), Simple termination of rewrite systems, Theoret. Comput. Sci. 175(1), 127-158.
22. Plaisted, D. (1985), The undecidability of self-embedding for term rewriting systems, Inform. Process. Lett. 20, 61-64.
23. Post, E. (1946), A variant of a recursively unsolvable problem, Bull. Amer. Math. Soc. 52, 264-268.
24. Touzet, H. (1998), A complex example of a simplifying rewrite system, in "Proceedings of the 25th International Colloquium on Automata, Languages and Programming," Lecture Notes in Computer Science, Vol. 1443, pp. 507-517, Springer-Verlag, Berlin.
25. Zantema, H. (1994), Termination of term rewriting: Interpretation and type elimination, J. Symbolic Comput. 17, 23-50.
26. Zantema, H. (1995), Total termination of term rewriting is undecidable, J. Symbolic Comput. 20, 43-60.
27. Zantema, H., and Geser, A. (1996), "Non-Looping Rewriting," Technical Report UU-CS-1996-03, Utrecht University.