Sensitive instances of the Constraint Satisfaction Problem.
Libor BartoMarcin KozikJohnson TanMatt ValeriotePublished in: CoRR (2020)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- finding optimal solutions
- backtrack search
- pseudo boolean optimization
- random instances
- tractable classes
- constraint programming
- constraint propagation
- search space
- np complete
- constraint solving
- arc consistency
- np hard
- combinatorial problems
- non binary
- randomly generated
- disjunctive temporal
- decomposition methods
- binary csps
- constraint networks
- partial constraint satisfaction
- tractable subclasses
- lower bound
- temporal constraints
- reasoning problems
- problems in artificial intelligence
- symmetry breaking
- hard constraints
- path consistency
- global constraints
- optimal solution