Matrix Interpretations for Proving Termination of Term Rewriting
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 non-total well-founded ordering. Function symbols are interpreted by linear mappings represented by matrices. This method allows 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. Our implementation performs well on the Termination Problem Data Base: better than 5 out of 6 tools that participated in the 2005 termination competition in the category of term rewriting.
KeywordsProof Obligation Satisfying Assignment Termination Proof Dependency Pair Weakly Monotone
Unable to display preview. Download preview PDF.
- 2.Termination Competition. http://www.lri.fr/~marche/termination-competition/
- 4.Endrullis, J.: Jambox: Automated termination proofs for string rewriting (2005), http://joerg.endrullis.de/
- 15.Zantema, H.: Termination. In: Term Rewriting Systems, by Terese, pp. 181–259. Cambridge University Press, Cambridge (2003)Google Scholar