SAT solving for argument filterings

Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl

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

13 Scopus citations


This paper introduces a prepositional encoding for lexicographic path orders in connection with dependency pajrs. This facilitates the application of SAT solvers for termination analysis of term rewrite systems based on the dependency pair method. We address two main inter-related issues and encode them as satisfiability problems of prepositional formulas that can be efficiently handled by SAT solving: (1) the combined search for a lexicographic path order together with an argument filtering to orient a set of inequalities; and (2) how the choice of the argument filtering influences the set of inequalities that have to be oriented. We have implemented our contributions in the termination prover AProVE. Extensive experiments show that by our encoding and the application of SAT solvers one obtains speedups in orders of magnitude as well as increased termination proving power.

Original languageEnglish
Title of host publicationLogic for Programming, Artificial Intelligence, and Reasoning - 13th International Conference, LPAR 2006, Proceedings
PublisherSpringer Verlag
Number of pages15
ISBN (Print)3540482814, 9783540482819
StatePublished - 1 Jan 2006
Event13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2006 - Phnom Penh, Cambodia
Duration: 13 Nov 200617 Nov 2006

Publication series

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


Conference13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2006
CityPhnom Penh

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'SAT solving for argument filterings'. Together they form a unique fingerprint.

Cite this