Fast and parallel decomposition of constraint satisfaction problems.
Georg GottlobCem OkulmusReinhard PichlerPublished in: Constraints An Int. J. (2022)
Keyphrases
- constraint satisfaction problems
- decomposition methods
- constraint satisfaction
- tree decomposition
- constraint programming
- np complete
- constraint propagation
- search space
- arc consistency
- non binary
- soft constraints
- combinatorial problems
- constraint networks
- sat problem
- decomposition method
- constraint solving
- computational problems
- product configuration
- partial constraint satisfaction
- forward checking
- backtracking search
- reasoning problems
- np hard
- arithmetic constraints
- hypertree decomposition
- constraint problems
- temporal constraints
- constraint optimization
- disjunctive constraints
- heuristic search
- maintaining arc consistency