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
Term rewriting and all that
WALDMEISTER - High-Performance Equational Deduction
Journal of Automated Reasoning
On the Use of Constraints in Automated Deduction
Selected Papers from Constraint Programming: Basics and Trends
RPO Constraint Solving Is in NP
Proceedings of the 12th International Workshop on Computer Science Logic
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
The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
The decidability of the first-order theory of knuth-bendix order
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
| Hi-index | 0.00 |
We show the NP-completeness of the existential theory of term algebras with the Knuth-Bendix order by giving a nondeterministic polynomial-time algorithm for solving Knuth-Bendix ordering constraints.