Fast and Parallel Decomposition of Constraint Satisfaction Problems.
Georg GottlobCem OkulmusReinhard PichlerPublished in: IJCAI (2020)
Keyphrases
- constraint satisfaction problems
- decomposition methods
- constraint satisfaction
- constraint programming
- np complete
- tree decomposition
- constraint propagation
- search space
- combinatorial problems
- non binary
- np hard
- soft constraints
- arc consistency
- partial constraint satisfaction
- decomposition method
- constraint networks
- computational problems
- global constraints
- product configuration
- temporal constraints
- graph based representations
- constraint solver
- constraint optimization
- hypertree decomposition
- disjunctive constraints
- arc consistency algorithm
- solving constraint satisfaction problems
- heuristic search
- sat problem
- arithmetic constraints
- backtracking search
- constraint graph
- reasoning problems
- constraint solving