Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables.
Manuel BodirskyMarcello MaminoCaterina ViolaPublished in: CoRR (2020)
Keyphrases
- fixed number
- piecewise linear
- constraint satisfaction problems
- finite domain
- constraint problems
- arithmetic constraints
- constraint satisfaction
- finite sets
- soft constraints
- constraint programming
- constraint propagation
- dynamic programming
- binary constraints
- configuration problems
- constraint graph
- partial assignment
- search space
- arc consistency
- constraint solving
- np hard
- np complete
- forward checking
- non binary
- finite number
- variable ordering heuristics
- sat problem
- constraint networks
- solving constraint satisfaction problems
- symmetry breaking constraints
- constraint solver
- symmetry breaking
- backtracking search
- dynamic constraint satisfaction problems