Konstantin Korovin Andrei Voronkov Knuth-Bendix constraint solving is NP-complete. 361-388 2005 6 ACM Trans. Comput. Log. 2 http://doi.acm.org/10.1145/1055686.1055692 db/journals/tocl/tocl6.html#KorovinV05