Knuth-Bendix constraint solving is NP-complete
Logic in Computer Science
2007-05-23 v1
Abstract
We show the NP-completeness of the existential theory of term algebras with the Knuth-Bendix order by giving a nondeterministic polynomial-time algorithm for solving Knuth-Bendix ordering constraints.
Keywords
Cite
@article{arxiv.cs/0207068,
title = {Knuth-Bendix constraint solving is NP-complete},
author = {Konstantin Korovin and Andrei Voronkov},
journal= {arXiv preprint arXiv:cs/0207068},
year = {2007}
}
Comments
27 pages