Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints.
Zineb HabbasKamal AmrounDaniel SingerPublished in: RAIRO Oper. Res. (2016)
Keyphrases
- non binary
- hypertree decomposition
- constraint satisfaction problems
- decomposition methods
- dynamic constraint satisfaction problems
- constraint satisfaction
- arc consistency
- hypertree width
- constraint programming
- backtracking algorithm
- constraint propagation
- binary csps
- tree decomposition
- np complete
- search space
- database theory
- np hard
- database
- forward checking
- global constraints
- soft constraints
- constraint networks
- binary constraints
- data structure
- social networks
- databases
- conjunctive queries
- query evaluation