Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories.
Carlos AnsóteguiMiquel BofillMiquel PalahíJosep SuyMateu VillaretPublished in: Constraints An Int. J. (2013)
Keyphrases
- constraint problems
- constraint solvers
- constraint satisfaction problems
- solving constraint satisfaction problems
- backtracking algorithm
- constraint satisfaction
- dynamic constraint satisfaction problems
- constraint programming
- distributed constraint satisfaction
- satisfiability modulo theories
- constraint solving
- sat encodings
- configuration problems
- constraint networks
- combinatorial problems
- constraint propagation
- constraint solver
- randomly generated
- non binary
- linear constraints
- soft constraints
- path consistency
- variable ordering heuristics
- modulo theories
- phase transition
- np complete
- symmetry breaking
- special case
- search space