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: | |
|---|---|
| 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 |