The Complexity of the Counting Constraint Satisfaction Problem.
Andrei A. BulatovPublished in: ICALP (1) (2008)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- constraint solving
- np complete
- constraint programming
- search space
- global constraints
- tractable subclasses
- partial constraint satisfaction
- decomposition methods
- non binary
- worst case
- product configuration
- hard constraints
- finite domain
- pseudo boolean optimization
- arc consistency
- soft constraints
- np hard
- computational complexity
- sat problem
- temporal constraints
- decision problems
- forward checking