Keyphrases
- constraint satisfaction problems
- hypertree decomposition
- np complete
- tractable classes
- computational problems
- constraint satisfaction
- satisfiability problem
- np hard
- decomposition methods
- hidden structure
- constraint propagation
- arc consistency
- sat solvers
- computational complexity
- constraint programming
- tree decompositions
- constraint solving
- sat instances
- soft constraints
- closest string
- bounded treewidth
- random instances
- sat encodings
- database
- dynamic constraint satisfaction problems
- partial constraint satisfaction
- exact computation
- version spaces
- tree decomposition
- computationally tractable
- sat problem
- special case
- genetic algorithm
- neural network