147
click to vote
RTA
2005
Springer
15 years 8 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...