Approximating Constraint Satisfaction Problems Symmetrically.
Jamie Tucker-FoltzPublished in: CoRR (2020)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- constraint propagation
- np complete
- constraint solving
- combinatorial problems
- non binary
- computational problems
- np hard
- search space
- arc consistency
- decomposition methods
- constraint optimization
- finite domain
- constraint networks
- soft constraints
- reasoning problems
- symmetry breaking
- constraint problems
- disjunctive temporal
- graph coloring problems
- arithmetic constraints
- solving constraint satisfaction problems
- arc consistency algorithm
- backtracking search
- product configuration
- forward checking
- backtracking algorithm
- constraint graph
- sat encodings
- search algorithm
- tractable subclasses
- global constraints
- dynamic constraint satisfaction problems