共 11 条
[1]
Dershowitz, Manna, Proving termination with multiset orderings, Comm. ACM, 22, 8, pp. 465-476, (1979)
[2]
Huet, Lankford, On the uniform halting problem for term rewriting systems, Report 283, (1978)
[3]
Knuth, Bendix, Simple word problems in universal algebras, Computational Problems in Universal Algebras, pp. 263-297, (1969)
[4]
Kruskal, Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture, Trans. AMS, 95, pp. 210-225, (1960)
[5]
Lankford, Canonical algebraic simplification in computational logic, Automatic Theorem Proving Project, (1975)
[6]
Lankford, On proving term rewriting systems are Noetherian, (1979)
[7]
Manna, Ness, On the termination of Markov algorithms, Proc. Third Hawaii Internat. Conf. on System Sciences, pp. 789-792, (1970)
[8]
Nash-Williams, On well-quasi-ordering finite trees, Mathematical Proceedings of the Cambridge Philosophical Society, 59, pp. 833-835, (1963)
[9]
Plaisted, Well-founded orderings for proving the termination of rewrite rules, Report R-78-932, (1978)
[10]
Plaisted, A recursively defined ordering for proving termination of term rewriting systems, Report R-78-943, (1978)