Sensitive Instances of the Constraint Satisfaction Problem.
Libor BartoMarcin KozikJohnson TanMatt ValeriotePublished in: ICALP (2020)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- finding optimal solutions
- random instances
- backtrack search
- pseudo boolean optimization
- tractable classes
- constraint propagation
- np complete
- search space
- arc consistency
- combinatorial problems
- randomly generated
- constraint programming
- non binary
- lower bound
- np hard
- binary csps
- constraint solving
- soft constraints
- sat problem
- partial constraint satisfaction
- decomposition methods
- hard constraints
- forward checking
- constraint networks
- tractable subclasses
- branch and bound algorithm
- disjunctive temporal
- finite domain
- distributed constraint satisfaction problems
- configuration problems
- phase transition
- constraint problems
- propositional satisfiability
- structural properties