Solving Non Binary Constraint Satisfaction Problems with Dual Backtracking on Hypertree Decomposition.
Zineb HabbasKamal AmrounDaniel SingerPublished in: ICAART (1) (2011)
Keyphrases
- constraint satisfaction problems
- non binary
- constraint satisfaction
- backtracking algorithm
- hypertree decomposition
- decomposition methods
- constraint propagation
- backtracking algorithms
- partial constraint satisfaction
- forward checking
- search space
- arc consistency
- dynamic constraint satisfaction problems
- backtracking search
- constraint networks
- np complete
- constraint programming
- tree decomposition
- finding optimal solutions
- phase transition
- graph coloring
- np hard
- soft constraints
- global constraints
- computational problems
- sat problem
- temporal constraints
- np complete problems
- variable ordering
- sat solvers
- combinatorial optimization
- heuristic search