Skip to main content
Conference Proceedings

Knuth-bendix constraint solving is NP-complete

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2076 LNCS 979-992
DOI: 10.1007/3-540-48224-5_79
13Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Korovin, K., & Voronkov, A. (2001). Knuth-bendix constraint solving is NP-complete. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2076 LNCS, pp. 979–992). Springer Verlag. https://doi.org/10.1007/3-540-48224-5_79

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free