Matrix interpretations for proving termination of term rewriting

J. Endrullis, J. Waldmann, H. Zantema

Research output: Contribution to journalArticleAcademicpeer-review

115 Citations (Scopus)
2 Downloads (Pure)


We present a new method for automatically proving termination of term rewriting. It is based on the well-known idea of interpretation of terms where every rewrite step causes a decrease, but instead of the usual natural numbers we use vectors of natural numbers, ordered by a particular nontotal well-founded ordering. Function symbols are interpreted by linear mappings represented by matrices. This method allows us to prove termination and relative termination. A modification of the latter, in which strict steps are only allowed at the top, turns out to be helpful in combination with the dependency pair transformation. By bounding the dimension and the matrix coefficients, the search problem becomes finite. Our implementation transforms it to a Boolean satisfiability problem (SAT), to be solved by a state-of-the-art SAT solver.
Original languageEnglish
Pages (from-to)195-220
JournalJournal of Automated Reasoning
Issue number2-3
Publication statusPublished - 2008


Dive into the research topics of 'Matrix interpretations for proving termination of term rewriting'. Together they form a unique fingerprint.

Cite this