Knuth-Bendix constraint solving is NP-complete
Konstantin KorovinAndrei VoronkovPublished in: CoRR (2002)
Keyphrases
- constraint solving
- np complete
- knuth bendix
- constraint satisfaction problems
- term rewriting
- constraint propagation
- constraint satisfaction
- constraint logic programming
- np hard
- rewrite systems
- computational complexity
- constraint solver
- randomly generated
- satisfiability problem
- constraint programming
- arc consistency
- combinatorial problems
- function symbols
- phase transition
- theorem prover
- temporal constraints
- theorem proving
- constraint networks
- bounded treewidth
- logic programming
- database