Constraints in computational logics
Knuth-Bendix Constraint Solving Is NP-Complete
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
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
Solved Forms for Path Ordering Constraints
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
The Theory of Total Unary RPO Is Decidable
CL '00 Proceedings of the First International Conference on Computational Logic
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
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
Orienting rewrite rules with the Knuth--Bendix order
Information and Computation - RTA 2001
Knuth--bendix constraint solving is NP-complete
ACM Transactions on Computational Logic (TOCL)
The design and implementation of VAMPIRE
AI Communications - CASC
Decision procedures for automating termination proofs
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
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 |