Constraint Satisfaction with Bounded Treewidth Revisited.
Marko SamerStefan SzeiderPublished in: CP (2006)
Keyphrases
- constraint satisfaction
- bounded treewidth
- np complete
- constraint satisfaction problems
- decision problems
- conjunctive queries
- boolean functions
- constraint programming
- heuristic search
- phase transition
- highly parallelizable
- constraint relaxation
- constraint solving
- combinatorial problems
- constraint propagation
- relational learning
- soft constraints
- arc consistency
- constraint networks
- robust fault detection
- data mining
- non binary
- temporal constraints
- sat solvers
- query evaluation
- metaheuristic
- np hard
- computational complexity
- objective function
- databases
- russian doll search