Numerous confluence criteria for plain term rewrite systems are known. F...
Recently it was shown that it is undecidable whether a term rewrite syst...
We present a termination proof for the Battle of Hercules and Hydra
repr...
Term rewriting is a Turing complete model of computation. When taught to...
Completion is one of the most studied techniques in term rewriting and
f...