Finitely Tractable Promise Constraint Satisfaction Problems.
Kristina AsimiLibor BartoPublished in: CoRR (2020)
Keyphrases
- constraint satisfaction problems
- np complete
- computational problems
- tractable classes
- constraint satisfaction
- np hard
- constraint propagation
- constraint solving
- constraint programming
- computational complexity
- non binary
- search space
- combinatorial problems
- global constraints
- product configuration
- constraint optimization
- finite domain
- constraint networks
- arc consistency
- temporal constraints
- soft constraints
- bounded treewidth
- disjunctive temporal
- partial constraint satisfaction
- finding optimal solutions
- constraint problems
- decomposition methods
- reasoning problems
- scheduling problem
- forward checking
- state space
- solving constraint satisfaction problems
- phase transition
- sat problem
- randomly generated