Simple termination of rewrite systems

Theoretical Computer Science

Volumn 175, Issue 1, 1997, Pages 127-158

  Middeldorp, Aart ^a   Zantema, Hans ^b  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE BASED SYSTEMS; RECURSIVE FUNCTIONS; THEOREM PROVING;

REWRITING SYSTEMS; SIMPLIFICATION ORDERS;

FORMAL LOGIC;

EID: 0031097454     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00172-7     Document Type: Article

References (45)

1. A.-C. Caron, Linear bounded automata and rewrite systems: influence of initial configuration on decision properties, in: Proc. 15th Colloq. on Trees in Algebra and Programming, Lecture Notes in Computer Science, Vol. 493 (Springer, Berlin, 1991) 74-89.
2. M. Dauchet, Simulation of turing machines by a regular rewrite rule, Theoret. Comput. Sci. 103 (1992) 109-120.
3. N. Dershowitz, A note on simplification orderings, Inform. Process. Lett. 9 (1979) 212-215.
4. N. Dershowitz, Orderings for term-rewriting systems, Theoret. Comput. Sci. 17 (1982) 279-301.
5. N. Dershowitz, Termination of rewriting, J. Symbolic Comput. 3 (1987) 69-116.
6. N. Dershowitz, Hierarchical termination, in: Proc. 4th Internat Workshop on Conditional Term Rewriting Systems, Lecture Notes in Computer Science, Vol. 968 (Springer, Berlin), 89-105.
7. N. Dershowitz and J.-P. Jouannaud, Rewrite systems, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B (North-Holland, Amsterdam, 1990) 243-320.
8. N. Dershowitz and Z. Manna, Proving termination with multiset orderings, Comm. ACM 22 (1979) 465-476.
9. J. Dick, J. Kalmus and U. Martin, Automating the Knuth Bendix ordering, Acta Inform. 28 (1990) 95-119.
10. M.C.F. Ferreira and H. Zantema, Total termination of term rewriting, Appl. Algebra Eng. Comm. Comput. 1 (1996) 133-162.
11. M.C.F. Ferreira and H. Zantema, Syntactic analysis of total termination, in: Proc. 4th Internat. Conf. on Algebraic and Logic Programming. Lecture Notes in Computer Science, Vol. 850 (Springer, Berlin, 1994) 204-222.
12. M.C.F. Ferreira and H. Zantema, Well-foundedness of term orderings, in: Proc. 4th Internat. Workshop on Conditional Term Rewriting Systems, Lecture Notes in Computer Science, Vol. 968 (Springer, Berlin, 1995), 106-123.
13. [12a] M.C.F. Ferreira, Termination of term rewriting: well-foundedness, totality and transformations, Ph.D. Thesis, Utrecht University, 1995.
14. 0? A survey of some results in proof theory, Ann. Pure Appl. Logic 53 (1991) 199-260.
15. B. Gramlich, Generalized sufficient conditions for modular termination of rewriting, Appl. Algebra Eng. Comm. Comput. 5 (1994) 131-158.
16. G. Higman, Ordering by divisibility in abstract algebras, Proc. London Philos. Soc. 3 (1952) 326-336.
17. D. Hofbauer, Termination proofs by multiset path orderings imply primitive recursive derivation lengths, Theoret. Comput. Sci. 105 (1992) 129-140.
18. G. Huet and D. Lankford, On the uniform halting problem for term rewriting systems, Report 283, INRIA, 1978.
19. G. Huet and D.C. Oppen, Equations and rewrite rules: a survey, in: R.V. Book, ed., Formal Language Theory: Perspectives and Open Problems (Academic Press, New York 1980) 349-405.
20. S. Kamin and J.J. Lévy, Two generalizations of the recursive path ordering, Unpublished manuscript. University of Illinois, 1980.
21. J.W. Klop, Term rewriting systems, in: S. Abramsky, D. Gabbay and T. Maibaum, eds., Handbook of Logic in Computer Science, Vol. II (Oxford Univ. Press, Oxford, 1992) 1-112.
22. D.E. Knuth and P. Bendix, Simple word problems in universal algebras, in: J. Leech, ed., Computational Problems in Abstract Algebra (Pergamon Press, Oxford, 1970) 263-297.
23. M.R.K. Krishna Rao, Simple termination of hierarchical combinations of term rewriting systems, in: Proc. 2nd Internat. Symp. on Theoretical Aspects of Computer Software, Lecture Notes in Computer Science, Vol. 789 (Springer, Berlin, 1994) 203-223.
24. M.R.K. Krishna Rao, Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems, in: Proc. 20th Colloq. on Trees in Algebra and Programming, Lecture Notes in Computer Science, Vol. 915 (Springer, Berlin, 1995) 379-393.
25. M.R.K. Krishna Rao, Modular proofs for completeness of hierarchical term rewriting systems, Theoret. Comput. Sci. 151 (1995) 487-512.
26. J.B. Kruskal, Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture, Trans. Amer. Math. Soc. 95 (1960) 210-225.
27. M. Kurihara and A. Ohuchi, Modularity of simple termination of term rewriting systems, J. Inform. Process. Soc. Japan 31 (1990) 633-642.
28. M. Kurihara and A. Ohuchi, Modularity of simple termination of term rewriting systems with shared constructors, Theoret. Comput. Sci. 103 (1992) 273-282.
29. M. Kurihara and A. Ohuchi, Decomposable termination of composable term rewriting systems, IEICE Trans. Inform. Systems E78-D (1995) 314-320.
30. A. Middeldorp and B. Gramlich, Simple termination is difficult, Appl. Algebra Eng. Commun. Comput. 6 (1995) 115-128.
31. A. Middeldorp and Y. Toyama, Completeness of combinations of constructor systems, J. Symbolic Comput. 15 (1993) 331-348.
32. A. Middeldorp and H. Zantema, Simple termination revisited, in: Prof. 12th Internat. Conf. on Automated Deduction, Lecture Notes in Artificial Intelligence, Vol. 814 (Springer, Berlin, 1994) 451-465.
33. A. Middeldorp and H. Zantema, Simple termination of rewrite systems, Bull. Section Logic 24 (1995) 31-36.
34. C.St.J.A. Nash-Williams, On well-quasi-ordering finite trees, Proc. Cambridge Philos. Soc. 59 (1963) 833-835.
35. E. Ohlebusch, A note on simple termination of infinite term rewriting systems, Report nr. 7, Universität Bielefeld, 1992.
36. E. Ohlebusch, On the modularity of termination of term rewriting systems, Theoret. Comput. Sci. 136 (1994) 333-360.
37. E. Ohlebusch, Modular properties of composable term rewriting systems, Ph.D. Thesis, Universität Bielefeld, 1994.
38. E. Ohlebusch, Modular properties of composable term rewriting systems, J. Symbolic Comput. 20 (1995) 1-41.
39. D.A. Plaisted, Equational reasoning and term rewriting systems, in: D. Gabbay and J. Siekmann, eds., Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 1 (Oxford Univ. Press, Oxford, 1993).
40. A. Rubio, Extension orderings, in: Proc. 22nd Internat. Collog. on Automata, Languages, and Programming, Lecture Notes in Computer Science Vol. 944 (Springer, Berlin) 511-522.
41. J. Steinbach, Simplification orderings: history of results. Fund. Inform. 24 (1995) 47-87.
42. Y. Toyama, Counterexamples to termination for the direct sum of term rewriting systems, Inform. Process. Lett. 25 (1987) 141-143.
43. H. Zantema, Termination of term rewriting: interpretation and type elimination, J. Symbolic Comput. 17 (1994) 23-50.
44. H. Zantema, Total termination of trerm rewriting is undecidable, report UU-CS-1994-55, Utrecht University, 1994. J. Symb. Comput. 20 (1995) 43-60.
45. H. Zantema, Termination of term rewriting by semantic labelling, Fund. Inform. 24 (1995) 89-105.