Characterizing Tractable CSPs.
Wanlin PangScott D. GoodwinPublished in: Canadian Conference on AI (1998)
Keyphrases
- hypertree decomposition
- constraint satisfaction problems
- decomposition methods
- np complete
- constraint satisfaction
- computational problems
- tractable classes
- search space
- np hard
- arc consistency
- neural network
- symmetry breaking
- solving constraint satisfaction problems
- constraint propagation
- computational complexity
- path consistency
- non binary
- backtracking algorithm
- information retrieval
- tree decomposition
- bounded treewidth
- interval algebra
- data sets
- partial constraint satisfaction
- database theory
- combinatorial problems
- constraint networks
- conjunctive queries
- optimal solution