Matrix Interpretations for Proving Termination of Term Rewriting

J. Endrullis, J. Waldmann, H. Zantema

Research output: Contribution to JournalArticleAcademicpeer-review

306 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 everyrewrite step causes a decrease, but instead of the usual natural numbers we usevectors of natural numbers, ordered by a particular nontotal well-founded ordering. Function symbols are interpreted by linear mappings represented by matrices. Thismethod allows us to prove termination and relative termination. A modification ofthe latter, in which strict steps are only allowed at the top, turns out to be helpful incombination 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-ofthe- art SAT solver. © Springer Science + Business Media B.V. 2007.
Original languageEnglish
Pages (from-to)195-220
JournalJournal of Automated Reasoning
Issue number2-3
Publication statusPublished - 2008

Bibliographical note



Dive into the research topics of 'Matrix Interpretations for Proving Termination of Term Rewriting'. Together they form a unique fingerprint.

Cite this