Konstantin Korovin, Andrei Voronkov. Knuth-Bendix Constraint Solving Is NP-Complete. In Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen, editors, Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings. Volume 2076 of Lecture Notes in Computer Science, pages 979-992, Springer, 2001. [doi]
Abstract is missing.