A procedure for automatically proving the termination of a set of rewrite rules
Proc. of the first international conference on Rewriting techniques and applications
Theoretical Computer Science
Theory of linear and integer programming
Theory of linear and integer programming
Introduction to algorithms
Automating the Knuth Bendix ordering
Acta Informatica
Satisfiability of systems of ordinal notations with the subterm property is decidable
Proceedings of the 18th international colloquium on Automata, languages and programming
Simple LPO constraint solving methods
Information Processing Letters
Invariants, patterns and weights for ordering terms
Journal of Symbolic Computation
How to Choose Weights in the Knuth Bendix Ordering
RTA '87 Proceedings of the 2nd International Conference on Rewriting Techniques and Applications
RPO Constraint Solving Is in NP
Proceedings of the 12th International Workshop on Computer Science Logic
Term Rewriting Systems and Algebra
Proceedings of the 7th International Conference on Automated Deduction
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Knuth--bendix constraint solving is NP-complete
ACM Transactions on Computational Logic (TOCL)
Tyrolean termination tool: Techniques and features
Information and Computation
Journal of Automated Reasoning
Transforming SAT into Termination of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Rewrite rules for search database systems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Derivational complexity of knuth-bendix orders revisited
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
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 |
We consider two decision problems related to the Knuth-Bendix order (KBO). The first problem is orientability: given a system of rewrite rules R, does there exist an instance of KBO which orients every ground instance of every rewrite rule in R. The second problem is whether a given instance of KBO orients every ground instance of a given rewrite rule. This problem can also be reformulated as the problem of solving a single ordering constraint for the KBO. We prove that both problems can be solved in the time polynomial in the size of the input. The polynomial-time algorithm for orientability builds upon an algorithm for solving systems of homogeneous linear inequalities over integers. We show that the orientability problem is P-complete. The polynomial-time algorithm for solving a single ordering constraint does not need to solve systems of linear inequalities and can be run in time O(n2). Also we show that if a system is orientable using a real-valued instance of KBO, then it is also orientable using an integer-valued instance of KBO. Therefore, all our results hold both for the integer-valued and the real-valued KBO.