Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem.
Andrei A. BulatovVíctor DalmauPublished in: FOCS (2003)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- constraint propagation
- search space
- np complete
- np hard
- constraint networks
- constraint solving
- non binary
- arc consistency
- soft constraints
- partial constraint satisfaction
- sat problem
- tractable subclasses
- product configuration
- search algorithm
- decomposition methods
- heuristic search
- forward checking
- pseudo boolean optimization