@inproceedings{2f10a3e4fcc14a4285c84129072939ae,
title = "SAT solving for argument filterings",
abstract = "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.",
author = "Michael Codish and Peter Schneider-Kamp and Vitaly Lagoon and Ren{\'e} Thiemann and J{\"u}rgen Giesl",
year = "2006",
month = jan,
day = "1",
doi = "10.1007/11916277_3",
language = "English",
isbn = "3540482814",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "30--44",
booktitle = "Logic for Programming, Artificial Intelligence, and Reasoning - 13th International Conference, LPAR 2006, Proceedings",
address = "Germany",
note = "13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2006 ; Conference date: 13-11-2006 Through 17-11-2006",
}