Preprocessing versus Search Processing for Constraint Satisfaction Problems.
Richard J. WallacePublished in: RCRA@AI*IA (2016)
Keyphrases
- constraint satisfaction problems
- search space
- preprocessing
- constraint satisfaction
- forward checking
- backtracking search
- constraint propagation
- constraint programming
- constraint solver
- search algorithm
- backtrack search
- np complete
- combinatorial problems
- solving constraint satisfaction problems
- np hard
- symmetry breaking
- maintaining arc consistency
- arc consistency
- search problems
- constraint solving
- non binary
- search strategies
- heuristic search
- ordering heuristics
- search strategy
- variable ordering heuristics
- decomposition methods
- finding optimal solutions
- partial constraint satisfaction
- pseudo boolean optimization
- variable ordering
- reasoning problems
- constraint problems
- reduce the search space
- global constraints
- constraint graph
- computational problems
- tree search
- soft constraints
- metaheuristic
- lower bound