On the Computational Complexity of Monotone Constraint Satisfaction Problems.
Miki HermannFlorian RichouxPublished in: WALCOM (2009)
Keyphrases
- constraint satisfaction problems
- computational complexity
- np complete
- np hard
- constraint satisfaction
- constraint propagation
- constraint programming
- non binary
- combinatorial problems
- product configuration
- arc consistency
- constraint solving
- constraint networks
- search space
- decomposition methods
- decision problems
- upper bound
- solving constraint satisfaction problems
- special case
- randomly generated
- forward checking
- constraint optimization
- soft constraints
- reasoning problems
- finite domain
- global constraints
- computational problems
- sat problem
- temporal constraints
- boolean functions
- scheduling problem
- satisfiability problem
- configuration problems
- phase transition
- finding optimal solutions
- partial constraint satisfaction