A non-binary constraint ordering heuristic for constraint satisfaction problems.
Miguel A. SalidoPublished in: Appl. Math. Comput. (2008)
Keyphrases
- non binary
- constraint satisfaction problems
- constraint solving
- disjunctive temporal
- constraint satisfaction
- finite domain
- constraint networks
- soft constraints
- global constraints
- constraint problems
- binary constraints
- constraint solver
- hard constraints
- constraint propagation
- arc consistency
- constraint graph
- constraint programming
- constraint solvers
- search space
- np complete
- backtracking algorithms
- symmetry breaking constraints
- solving constraint satisfaction problems
- np hard
- forward checking
- backtracking algorithm
- path consistency
- sat problem
- backtracking search
- temporal constraints
- domain independent
- finding optimal solutions
- maximum likelihood
- worst case