Proving termination using recursive path orders and SAT solving

Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

23 Scopus citations


We introduce a propositional encoding of the recursive path order with status (RPO). RPO is a combination of a multiset path order and a lexicographic path order which considers permutations of the arguments in the lexicographic comparison. Our encoding allows us to apply SAT solvers in order to determine whether a given term rewrite system is RPO-terminating. Furthermore, to apply RPO within the dependency pair framework, we combined our novel encoding for RPO with an existing encoding for argument filters. We implemented our contributions in the termination prover AProVE. Our experiments show that due to our encoding, combining termination provers with SAT solvers improves the performance of RPO-implementations by orders of magnitude.

Original languageEnglish
Title of host publicationFrontiers of Combining Systems - 6th International Symposium, FroCoS 2007, Proceedings
PublisherSpringer Verlag
Number of pages16
ISBN (Print)9783540746201
StatePublished - 1 Jan 2007
Event6th International Symposium on Frontiers of Combining Systems, FroCoS 2007 - Liverpool, United Kingdom
Duration: 10 Sep 200712 Sep 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4720 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference6th International Symposium on Frontiers of Combining Systems, FroCoS 2007
Country/TerritoryUnited Kingdom

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Proving termination using recursive path orders and SAT solving'. Together they form a unique fingerprint.

Cite this