SAT solving for argument filterings

Authors:
Michael Codish;Peter Schneider–Kamp;Vitaly Lagoon;René Thiemann;Jürgen Giesl
Affiliations:
Dept. of Computer Science, Ben-Gurion University, Israel;LuFG Informatik 2, RWTH Aachen, Germany;Dept. of Computer Science and Software Engineering, University of Melbourne, Australia;LuFG Informatik 2, RWTH Aachen, Germany;LuFG Informatik 2, RWTH Aachen, Germany
Venue:
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2006

Citing 13
Cited 12

Termination of rewriting

Journal of Symbolic Computation
Term rewriting and all that

Term rewriting and all that
Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
Argument Filtering Transformation

PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Termination Proofs Using gpo Ordering Constraints

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Decision Problems in Ordered Rewriting

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Efficient BDD encodings for partial order constraints with application to expert systems in software verification

IEA/AIE'2004 Proceedings of the 17th international conference on Innovations in applied artificial intelligence
Automating the dependency pair method

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Tsukuba termination tool

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
AProVE 1.2: automatic termination proofs in the dependency pair framework

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Proving and disproving termination of higher-order functions

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Tyrolean termination tool

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Solving partial order constraints for LPO termination

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications

Logic programming with satisfiability

Theory and Practice of Logic Programming
Predictive Labeling with Dependency Pairs Using SAT

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Proving Termination Using Recursive Path Orders and SAT Solving

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Proving Termination with (Boolean) Satisfaction

Logic-Based Program Synthesis and Transformation
KBO Orientability

Journal of Automated Reasoning
SAT solving for termination analysis with polynomial interpretations

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
The termination competition

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Satisfying KBO constraints

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Lazy abstraction for size-change termination

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Goal-directed and relative dependency pairs for proving the termination of narrowing

LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs

Journal of Automated Reasoning
Unifying the Knuth-Bendix, recursive path and polynomial orders

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming

Quantified Score

Hi-index	0.00

Visualization

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.