Proving termination of rewriting automatically
Hans Zantema · TU/e Research Portal · 2008
In this paper we give an introduction to term rewriting and termination. Moreover, we sketch some developments in proving termination of rewriting automatically, in particular in using satisfiability for finding suitable interpretations.