Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
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)
| Hi-index | 0.00 |