论文信息 - Deciding Unique Termination of Permutative Rewriting Systems: Choose Your Term Algebra Carefully

Deciding Unique Termination of Permutative Rewriting Systems: Choose Your Term Algebra Carefully

Some problems are considered related to unique termination of rewriting systems for classes of terms equal under some equational theory. It is shown that the approach of Peterson and Stickel [2] to such problems fails to cope with a rather simple equational theory which is very natural in the context of axiomatic specifications of abstract data types.

Hans-Josef Jeanrond | Hans-Josef Jeanrond

[1] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[2] Mark E. Stickel. A Complete Unification Algorithm for Associative-Commutative Functions , 1975, IJCAI.

[3] Donald E. Knuth,et al. Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .

[4] Gerard Huet,et al. Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).