Constant-Query Testability of Assignments to Constraint Satisfaction Problems.
Hubie ChenMatt ValerioteYuichi YoshidaPublished in: SIAM J. Comput. (2019)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- search space
- np complete
- constraint propagation
- combinatorial problems
- query processing
- partial assignment
- non binary
- constraint solving
- constraint problems
- np hard
- global constraints
- solving constraint satisfaction problems
- constraint graph
- forward checking
- constraint networks
- computational problems
- arc consistency
- query evaluation
- decomposition methods
- sat problem
- reasoning problems
- finding optimal solutions
- data structure
- set bounds propagation
- partial constraint satisfaction
- pseudo boolean optimization
- backtracking search
- constraint optimization
- path consistency
- soft constraints
- boolean functions