Adaptive Branching for Constraint Satisfaction Problems.
Thanasis BalafoutisKostas StergiouPublished in: ECAI (2010)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- constraint propagation
- search space
- constraint solving
- np complete
- combinatorial problems
- np hard
- non binary
- arc consistency
- computational problems
- forward checking
- finite domain
- decomposition methods
- constraint networks
- product configuration
- soft constraints
- constraint problems
- reasoning problems
- backtracking search
- arithmetic constraints
- symmetry breaking
- constraint solver
- sat problem
- global constraints
- variable ordering heuristics
- constraint optimization
- pseudo boolean optimization
- partial constraint satisfaction
- graph coloring problems
- search algorithm
- solving constraint satisfaction problems
- arc consistency algorithm
- constraint graph
- branch and bound
- lower bound