Heuristics for dynamically adapting propagation in constraint satisfaction problems.
Kostas StergiouPublished in: AI Commun. (2009)
Keyphrases
- constraint satisfaction problems
- hyper heuristics
- finding optimal solutions
- backtrack search
- constraint satisfaction
- random instances
- set bounds propagation
- constraint solvers
- constraint programming
- constraint propagation
- variable ordering heuristics
- search space
- np complete
- combinatorial problems
- non binary
- arc consistency
- ordering heuristics
- np hard
- soft constraints
- constraint solving
- search algorithm
- backtracking search
- forward checking
- heuristic search
- computational problems
- reasoning problems
- backtracking algorithm
- search strategies
- exact algorithms
- tractable classes
- lower bound
- constraint solver
- global constraints
- randomly generated
- temporal constraints
- planning graph
- constraint problems
- decomposition methods
- path consistency
- tree search
- solving constraint satisfaction problems
- sat problem