On the Complexity of Trial and Error for Constraint Satisfaction Problems.
Gábor IvanyosRaghav KulkarniYouming QiaoMiklos SanthaAarthi SundaramPublished in: CoRR (2014)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- constraint programming
- search space
- np complete
- non binary
- combinatorial problems
- arc consistency
- constraint problems
- constraint solving
- constraint optimization
- finite domain
- soft constraints
- np hard
- constraint networks
- forward checking
- random instances
- computational problems
- decomposition methods
- temporal constraints
- backtracking search
- sat problem
- global constraints
- reasoning problems
- constraint solver
- bounded treewidth
- computational complexity
- special case
- scheduling problem
- decision problems
- disjunctive constraints
- partial constraint satisfaction