On the Minimal Constraint Satisfaction Problem: Complexity and Generation.
Guillaume EscamocherBarry O'SullivanPublished in: COCOA (2015)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- constraint solving
- search space
- np complete
- non binary
- constraint programming
- tree decompositions
- arc consistency
- partial constraint satisfaction
- np hard
- global constraints
- soft constraints
- hard constraints
- decomposition methods
- product configuration
- finite domain
- constraint networks
- sat problem
- computational complexity
- worst case
- pseudo boolean optimization
- finding optimal solutions
- distributed environment