Proving termination of rewriting automatically

Research output: Contribution to journalArticleProfessional

2 Downloads (Pure)


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 languageEnglish
Pages (from-to)25-33
JournalNieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica
Publication statusPublished - 2008


Dive into the research topics of 'Proving termination of rewriting automatically'. Together they form a unique fingerprint.

Cite this