Constraints for Argument Filterings

Authors:
Harald Zankl;Nao Hirokawa;Aart Middeldorp
Affiliations:
Institute of Computer Science, University of Innsbruck, Austria;Institute of Computer Science, University of Innsbruck, Austria;Institute of Computer Science, University of Innsbruck, Austria
Venue:
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Year:
2007

Citing 8
Cited 4

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
Modular termination proofs for rewriting using dependency pairs

Journal of Symbolic Computation
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)
AProVE 1.2: automatic termination proofs in the dependency pair framework

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
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

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
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

The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and KBO, argument filterings play a key role. In this paper we propose an encoding of argument filterings in propositional logic. By incorporating propositional encodings of simplification orders, the search for suitable argument filterings is turned into a satisfiability problem. Preliminary experimental results show that our logic-based approach is significantly faster than existing implementations.