A compressed Generalized Hypertree Decomposition-based solving technique for non-binary Constraint Satisfaction Problems.
Kamal AmrounZineb HabbasWassila Aggoune-MtalaaPublished in: AI Commun. (2016)
Keyphrases
- constraint satisfaction problems
- non binary
- hypertree decomposition
- decomposition methods
- constraint satisfaction
- constraint problems
- partial constraint satisfaction
- dynamic constraint satisfaction problems
- backtracking algorithm
- np complete
- constraint propagation
- arc consistency
- tree decomposition
- search space
- finding optimal solutions
- graph coloring
- constraint programming
- np hard
- data structure
- soft constraints
- combinatorial problems
- polynomially solvable
- constraint networks
- np complete problems
- temporal constraints
- global constraints
- computational problems
- database theory
- forward checking
- sat solvers
- backtracking search