Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems.
Oliver KullmannPublished in: Ann. Math. Artif. Intell. (2004)
Keyphrases
- constraint satisfaction problems
- upper and lower bounds
- constraint satisfaction
- upper bound
- lower bound
- constraint propagation
- constraint programming
- search space
- arc consistency
- np complete
- lower and upper bounds
- soft constraints
- worst case
- pseudo boolean optimization
- non binary
- constraint networks
- np hard
- finding optimal solutions
- sat problem
- computational complexity
- space complexity
- path consistency
- forward checking
- solving constraint satisfaction problems
- dynamic constraint satisfaction problems
- machine learning