Partial Domain Search Tree For Constraint-Satisfaction Problems.
Guni SharonAriel FelnerRoni SternNathan R. SturtevantPublished in: AAAI (Late-Breaking Developments) (2013)
Keyphrases
- constraint satisfaction problems
- search tree
- search space
- forward checking
- constraint satisfaction
- backtracking algorithm
- symmetry breaking
- constraint programming
- constraint propagation
- branch and bound algorithm
- search algorithm
- sat solvers
- np hard
- combinatorial problems
- arc consistency
- np complete
- branch and bound
- branch and bound search
- heuristic search
- non binary
- partial assignment
- tree search
- tractable classes
- constraint networks
- global constraints
- search strategy
- sat problem
- b tree
- maintaining arc consistency
- state space
- domain independent
- metaheuristic
- iterative deepening
- search problems
- phase transition
- finding optimal solutions
- upper bound