When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems.
Pierre GillibertJulius JonusasMichael KompatscherAntoine MottetMichael PinskerPublished in: SIAM J. Comput. (2022)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- symmetry breaking
- global constraints
- constraint programming
- graph coloring problems
- symmetry breaking constraints
- random instances
- constraint propagation
- np complete
- combinatorial problems
- constraint solving
- np hard
- search space
- pseudo boolean optimization
- non binary
- computational problems
- arc consistency
- solving constraint satisfaction problems
- product configuration
- constraint networks
- partial constraint satisfaction
- constraint problems
- reasoning problems
- finite domain
- soft constraints
- constraint solver
- constraint graph
- constraint optimization
- graph coloring
- sat problem
- decomposition methods
- tractable subclasses
- temporal constraints
- search algorithm