An Application of Farkas' Lemma to Finite-Valued Constraint Satisfaction Problems over Infinite Domains.
Friedrich Martin SchneiderCaterina ViolaPublished in: CoRR (2022)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- constraint propagation
- np complete
- ordered binary decision diagrams
- constraint optimization
- graph coloring problems
- configuration problems
- search space
- non binary
- combinatorial problems
- arc consistency
- constraint solving
- np hard
- search problems
- product configuration
- sat problem
- partial constraint satisfaction
- constraint networks
- constraint problems
- solving constraint satisfaction problems
- computational problems
- finite domain
- reasoning problems
- soft constraints
- constraint graph
- constraint solver
- constraint solvers
- backtracking search
- temporal constraints
- real numbers
- maintaining arc consistency
- disjunctive temporal
- pseudo boolean optimization