Using constraints to break value symmetries in constraint satisfaction problems.
Many real life problems can naturally be modeled as constraint satisfaction problems (CSPs), which can sometimes contain both variable symmetries and value symmetries. Tree search based CSP solving algorithms often suffer from symmetries, which creates symmetrically equivalent states in the search...
Other Authors: | Law, Yat Chiu. |
---|---|
Format: | Others |
Language: | English Chinese |
Published: |
2005
|
Subjects: | |
Online Access: | http://library.cuhk.edu.hk/record=b6074027 http://repository.lib.cuhk.edu.hk/en/item/cuhk-343656 |
Similar Items
-
Increasing symmetry breaking by preserving target symmetries and eliminating eliminated symmetries in constraint satisfaction.
Published: (2012) -
Symmetry Breaking Ordering Constraints
by: Kiziltan, Zeynep
Published: (2004) -
A fuzzy constraint satisfaction approach to achieving stability in dynamic constraint satisfaction problems.
Published: (2001) -
Quantified weighted constraint satisfaction problems.
Published: (2011) -
Realizations of common channeling constraints in constraint satisfaction: theory and algorithms.
Published: (2006)