Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Knuth-Bendix Constraint Solving Is NP-Complete
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages 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)
Higher-Order and Symbolic Computation
Hi-index | 0.00 |