On the complexity of trial and error for constraint satisfaction problems.
Gábor IvanyosRaghav KulkarniYouming QiaoMiklos SanthaAarthi SundaramPublished in: Electron. Colloquium Comput. Complex. (2014)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- constraint programming
- np complete
- combinatorial problems
- computational problems
- search space
- constraint solving
- non binary
- soft constraints
- worst case
- backtracking search
- global constraints
- forward checking
- np hard
- decomposition methods
- partial constraint satisfaction
- arc consistency
- constraint problems
- finite domain
- search algorithm
- pseudo boolean optimization
- product configuration
- decision problems
- computational complexity
- path consistency
- sat problem
- constraint networks
- temporal logic
- finding optimal solutions
- disjunctive temporal