Robustly Solvable Constraint Satisfaction Problems.
Libor BartoMarcin KozikPublished in: SIAM J. Comput. (2016)
Keyphrases
- constraint satisfaction problems
- np complete
- np hard
- constraint satisfaction
- constraint propagation
- constraint programming
- special case
- computational complexity
- search space
- arc consistency
- combinatorial problems
- forward checking
- constraint solving
- decomposition methods
- non binary
- global constraints
- computational problems
- satisfiability problem
- soft constraints
- scheduling problem
- lower bound
- partial constraint satisfaction
- tractable subclasses
- graph coloring problems
- backtracking search
- disjunctive temporal
- product configuration
- constraint optimization
- tractable classes
- finite domain
- solving constraint satisfaction problems
- reasoning problems
- sat problem
- randomly generated