Finitely Tractable Promise Constraint Satisfaction Problems.
Kristina AsimiLibor BartoPublished in: MFCS (2021)
Keyphrases
- constraint satisfaction problems
- np complete
- computational problems
- tractable classes
- np hard
- constraint satisfaction
- constraint propagation
- search space
- constraint programming
- constraint solving
- arc consistency
- computational complexity
- product configuration
- non binary
- combinatorial problems
- soft constraints
- hypertree decomposition
- bounded treewidth
- decomposition methods
- constraint networks
- global constraints
- randomly generated
- conjunctive queries
- solving constraint satisfaction problems
- constraint solver
- constraint optimization
- disjunctive temporal
- backtracking search
- lower bound
- finite domain
- tree decomposition
- symmetry breaking
- special case
- optimal solution