Robust Satisfiability of Constraint Satisfaction Problems.
Libor BartoMarcin KozikPublished in: Electron. Colloquium Comput. Complex. (2011)
Keyphrases
- constraint satisfaction problems
- np complete
- constraint satisfaction
- sat problem
- constraint propagation
- constraint programming
- search space
- phase transition
- constraint solving
- combinatorial problems
- non binary
- backtracking search
- reasoning problems
- symmetry breaking
- np hard
- computational problems
- constraint solver
- constraint problems
- soft constraints
- constraint networks
- arc consistency
- computational complexity
- global constraints
- forward checking
- backtracking algorithm
- temporal constraints
- solving constraint satisfaction problems
- partial constraint satisfaction
- pseudo boolean optimization
- decomposition methods
- sat instances
- random instances