Backdoors to Tractable Valued CSP.
Robert GanianM. S. RamanujanStefan SzeiderPublished in: CoRR (2016)
Keyphrases
- hypertree decomposition
- constraint satisfaction problems
- np complete
- np hard
- satisfiability problem
- decomposition methods
- tractable classes
- computational problems
- constraint satisfaction
- hidden structure
- arc consistency
- constraint programming
- sat problem
- sat instances
- tree decompositions
- database theory
- bounded treewidth
- version spaces
- constraint propagation
- computational complexity
- random instances
- constraint graph
- special case
- solving constraint satisfaction problems
- genetic algorithm