Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems.
Gilles PesantClaude-Guy QuimperAlessandro ZanariniPublished in: J. Artif. Intell. Res. (2012)
Keyphrases
- constraint satisfaction problems
- variable ordering heuristics
- search space
- backtrack search
- constraint satisfaction
- search algorithm
- forward checking
- ordering heuristics
- constraint propagation
- constraint programming
- finding optimal solutions
- variable ordering
- np complete
- backtracking search
- constraint solver
- non binary
- np hard
- search strategies
- branch and bound
- symmetry breaking
- search problems
- solving constraint satisfaction problems
- arc consistency
- heuristic search
- constraint solving
- hyper heuristics
- soft constraints
- constraint networks
- search strategy
- branch and bound search
- combinatorial problems
- search methods
- search heuristics
- tree search
- global constraints
- decomposition methods
- reducing the search space
- constraint solvers
- random instances
- sat problem