Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems.
Hubie ChenGeorg GottlobMatthias LanzingerReinhard PichlerPublished in: IJCAI (2020)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- combinatorial problems
- constraint programming
- np complete
- search space
- np hard
- soft constraints
- computational problems
- arc consistency
- non binary
- sat problem
- solving constraint satisfaction problems
- global constraints
- fixed parameter tractable
- finding optimal solutions
- constraint problems
- branch and bound
- special case