Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers.
Titus DosePublished in: MFCS (2016)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- constraint programming
- np complete
- search space
- arc consistency
- combinatorial problems
- non binary
- constraint solving
- np hard
- constraint problems
- constraint networks
- global constraints
- soft constraints
- computational problems
- decomposition methods
- constraint optimization
- pseudo boolean optimization
- forward checking
- disjunctive temporal
- temporal constraints
- sat solvers
- symmetry breaking
- worst case
- constraint graph