Transforming SAT into Termination of Rewriting

Authors:
Harald Zankl;Christian Sternagel;Aart Middeldorp
Affiliations:
Institute of Computer Science, University of Innsbruck, Innsbruck, Austria;Institute of Computer Science, University of Innsbruck, Innsbruck, Austria;Institute of Computer Science, University of Innsbruck, Innsbruck, Austria
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 15
Cited 0

Automating the Knuth Bendix ordering

Acta Informatica
Termination of term rewriting: interpretation and type elimination

Journal of Symbolic Computation - Special issue on conditional term rewriting systems
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
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Orienting rewrite rules with the Knuth--Bendix order

Information and Computation - RTA 2001
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
Matrix Interpretations for Proving Termination of Term Rewriting

Journal of Automated Reasoning
Termination of simply typed term rewriting by translation and labelling

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Satisfying KBO constraints

RTA'07 Proceedings of the 18th international conference on Term rewriting 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
Automation of recursive path ordering for infinite labelled rewrite systems

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Solving partial order constraints for LPO termination

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
TPA: termination proved automatically

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Termination Of Term Rewriting By Semantic Labelling

Fundamenta Informaticae

Quantified Score

Hi-index	0.03

Visualization

Abstract

In this paper we propose different translations from SAT to termination of term rewriting, i.e., we translate a propositional formula @f into a generic rewrite system R^@f with the property that @f is satisfiable if and only if R^@f is (non)terminating. Our experiments reveal that the generated rewrite systems are challenging for automated termination provers. Furthermore, a large class of them seems to be just unprovable by current methods implemented in termination analyzers.