Knuth-Bendix constraint solving is NP-complete

@inproceedings{Korovin2001KnuthBendixCS,
  title={Knuth-Bendix constraint solving is NP-complete},
  author={Konstantin Korovin and Andrei Voronkov},
  booktitle={ICALP},
  year={2001}
}
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. 
16 Citations
7 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Solving symbolic ordering constraints

  • H. COMON
  • Int. J. Found. Comput. Sci. 1, 4, 387–411.
  • 1990
Highly Influential
9 Excerpts

Model theory of locally free algebras (in Russian)

  • O. BELEGRADEK
  • Model Theory and its Applications. Trudy…
  • 1988
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…