String-rewriting systems
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Match-Bounded String Rewriting Systems
Applicable Algebra in Engineering, Communication and Computing
Termination of {aa ⅾ bc, bb ⅾ ac, cc ⅾ ab}
Information Processing Letters
Effective preprocessing in SAT through variable and clause elimination
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Matrix interpretations for proving termination of term rewriting
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Matrix Interpretations for Proving Termination of Term Rewriting
Journal of Automated Reasoning
Proving Termination Using Recursive Path Orders and SAT Solving
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Arctic Termination ...Below Zero
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Proving Termination with (Boolean) Satisfaction
Logic-Based Program Synthesis and Transformation
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Improved Matrix Interpretation
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
SAT solving for termination analysis with polynomial interpretations
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Max/plus tree automata for termination of term rewriting
Acta Cybernetica
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Termination by quasi-periodic interpretations
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Revisiting matrix interpretations for polynomial derivational complexity of term rewriting
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Satisfiability of non-linear (Ir)rational arithmetic
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Weighted automata for proving termination of string rewriting
Journal of Automata, Languages and Combinatorics
Matrix interpretations for proving termination of term rewriting
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
On the domain and dimension hierarchy of matrix interpretations
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Unifying the Knuth-Bendix, recursive path and polynomial orders
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |
A rewriting system can be shown terminating by an order-preserving mapping into a well-founded domain. We present an instance of this scheme for string rewriting where the domain is a set of square matrices of natural numbers, equipped with a well-founded ordering that is not total. The coefficients of the matrices can be found via a transformation to a boolean satisfiability problem. The matrix method also supports relative termination, thus it fits with the dependency pair method as well. Our implementation is able to automatically solve hard termination problems.