Constraint satisfaction with bounded treewidth revisited.
Marko SamerStefan SzeiderPublished in: J. Comput. Syst. Sci. (2010)
Keyphrases
- constraint satisfaction
- bounded treewidth
- np complete
- constraint satisfaction problems
- highly parallelizable
- phase transition
- boolean functions
- conjunctive queries
- decision problems
- constraint programming
- heuristic search
- constraint propagation
- relational learning
- constraint relaxation
- soft constraints
- constraint solving
- computational complexity
- arc consistency
- russian doll search
- combinatorial problems
- constraint networks
- semi supervised
- np hard
- search algorithm
- non binary
- optimization problems
- constraint problems
- constraint optimization
- reinforcement learning
- learning algorithm