Summary: SAT Solving for Argument Filterings #
Michael Codish 1 , Peter Schneider--Kamp 2 , Vitaly Lagoon 3 ,
Ren’e Thiemann 2 , and J˜urgen Giesl 2
1 Dept. of Computer Science, Ben­Gurion University, Israel, mcodish@cs.bgu.ac.il
2 LuFG Informatik 2, RWTH Aachen, Germany,
{psk,thiemann,giesl}@informatik.rwth­aachen.de
3 Dept. of Computer Science and Software Engineering, University of Melbourne,
Australia, lagoon@cs.mu.oz.au
Abstract. This paper introduces a propositional encoding for lexico­
graphic path orders in connection with dependency pairs. 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 propo­
sitional formulas that can be e#ciently handled by SAT solving: (1) the
combined search for a lexicographic path order together with an argu­
ment 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 ori­
ented. We have implemented our contributions in the termination prover
AProVE. Extensive experiments show that by our encoding and the ap­
plication of SAT solvers one obtains speedups in orders of magnitude as

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

Collections: Computer Technologies and Information Sciences