Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 25-33 |
| Journal | Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica |
| Volume | 12 |
| Publication status | Published - 2008 |