Constraints and constraint solving: an introduction
Constraints in computational logics
Constraints in computational logics
The first-order theory of subtyping constraints
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Methodological View of Constraint Solving
Constraints
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
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)
Proving Termination Using Recursive Path Orders and SAT Solving
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
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 |