Some Notes on Basic Syntactic Mutation
Keyword(s):
Unification modulo convergent term rewrite systems is an important research area with many applications. In their seminal paper Lynch and Morawska gave three conditions on rewrite systems that guarantee that unifiability can be checked in polynomial time (P). We show that these conditions are tight, in the sense that relaxing any one of them will "upset the applecart," giving rise to unification problems that are not in P (unless P = NP). We also investigate a related decision problem: we show the undecidability of subterm-collapse for the restricted term rewriting systems that we are considering.
1998 ◽
Vol 208
(1-2)
◽
pp. 87-110
◽
2002 ◽
Vol 13
(06)
◽
pp. 873-887
Keyword(s):
1987 ◽
Vol 49
(1)
◽
pp. 43-79
◽
Keyword(s):
2017 ◽
Vol 59
(5)
◽
pp. 670-679
◽
Keyword(s):
2003 ◽
Vol 86
(3)
◽
pp. 52-69
◽