Automating the Knuth Bendix ordering
Acta Informatica
Term rewriting and all that
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Extensions and Comparison of Simplification Orderings
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Orienting rewrite rules with the Knuth--Bendix order
Information and Computation - RTA 2001
IEA/AIE'2004 Proceedings of the 17th international conference on Innovations in applied artificial intelligence
SAT solving for termination analysis with polynomial interpretations
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
SAT solving for argument filterings
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
AProVE 1.2: automatic termination proofs in the dependency pair framework
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Matrix interpretations for proving termination of term rewriting
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
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
Termination of string rewriting with matrix interpretations
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
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
Journal of Automated Reasoning
Transforming SAT into Termination of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Complexity analysis by rewriting
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
| Hi-index | 0.00 |
This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for the precedence are encoded in (pseudo-)propositional logic and the resulting formula is tested for satisfiability. Any satisfying assignment represents a weight function and a precedence such that the induced Knuth-Bendix order orients the rules of the encoded rewrite system from left to right.