Robust satisfiability of constraint satisfaction problems.
Libor BartoMarcin KozikPublished in: STOC (2012)
Keyphrases
- constraint satisfaction problems
- np complete
- constraint satisfaction
- sat problem
- constraint propagation
- constraint programming
- search space
- phase transition
- constraint solving
- symmetry breaking
- computational problems
- non binary
- constraint problems
- pseudo boolean optimization
- soft constraints
- arc consistency
- combinatorial problems
- np hard
- reasoning problems
- global constraints
- random instances
- sat encodings
- constraint networks
- satisfiability problem
- backtracking search
- path consistency
- lower bound
- tractable classes
- solving constraint satisfaction problems
- partial constraint satisfaction
- computational complexity