Sat solving for argument filterings

DMCA

Sat solving for argument filterings (2006)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Michael Codish , Vitaly Lagoon , René Thiemann , Jürgen Giesl

Venue:	In Logic for Programming, Artificial Intelligence and Reasoning (LPAR
Citations:	17 - 9 self

BibTeX

@INPROCEEDINGS{Codish06satsolving,
    author = {Michael Codish and Vitaly Lagoon and René Thiemann and Jürgen Giesl},
    title = {Sat solving for argument filterings},
    booktitle = {In Logic for Programming, Artificial Intelligence and Reasoning (LPAR},
    year = {2006},
    pages = {30--44},
    publisher = {Springer}
}

OpenURL

Abstract

Abstract. This paper introduces a propositional encoding for lexicographic 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 propositional 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. 1

Keyphrases

argument filterings sat solver lexicographic path order satisfiability problem term rewrite system termination prover aprove propositional encoding dependency pair propositional formula dependency pair method termination analysis main inter-related issue sat solving extensive experiment

DMCA