A Forward-Checking algorithm based on a Generalised Hypertree Decomposition for solving non-binary constraint satisfaction problems.
Zineb HabbasKamal AmrounDaniel SingerPublished in: J. Exp. Theor. Artif. Intell. (2015)
Keyphrases
- constraint satisfaction problems
- non binary
- forward checking
- constraint satisfaction
- variable ordering
- arc consistency
- search space
- backtracking algorithms
- backtracking algorithm
- graph coloring
- np hard
- np complete
- constraint programming
- decomposition methods
- backtracking search
- hypertree decomposition
- constraint propagation
- search algorithm
- combinatorial problems
- path consistency
- constraint networks
- tree decomposition
- random instances
- tree search
- space complexity
- combinatorial optimization
- computational complexity
- max sat
- objective function
- hard problems
- phase transition
- dynamic programming
- special case
- ordering heuristics