Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction
@article{Law2006SymmetryBC, title={Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction}, author={Y. Law and J. Lee}, journal={Constraints}, year={2006}, volume={11}, pages={221-267} }
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, symmetry breaking constraints are commonly used. While variable symmetry breaking constraints can be expressed easily and propagated efficiently using lexicographic ordering, value symmetry breaking constraints are often difficult to formulate. In this paper, we propose two methods of using symmetry breaking… CONTINUE READING
Figures, Tables, and Topics from this paper
43 Citations
Dynamic structural symmetry breaking for constraint satisfaction problems
- Mathematics, Computer Science
- Constraints
- 2008
- 16
- PDF
Towards breaking more composition symmetries in partial symmetry breaking
- Mathematics, Computer Science
- Artif. Intell.
- 2017
- Highly Influenced
- PDF
Partial symmetry breaking by local search in the group
- Mathematics, Computer Science
- Constraints
- 2012
- 4
- PDF
Symmetry in Constraint Programming
- Mathematics, Computer Science
- Handbook of Constraint Programming
- 2006
- 108
- PDF
References
SHOWING 1-10 OF 51 REFERENCES
Breaking value symmetries in matrix models using channeling constraints
- Computer Science
- SAC '05
- 2005
- 14
- PDF
Efficient symmetry breaking for Boolean satisfiability
- Mathematics, Computer Science
- IEEE Transactions on Computers
- 2006
- 120
- PDF
Tractable Symmetry Breaking for CSPs with Interchangeable Values
- Mathematics, Computer Science
- IJCAI
- 2003
- 49
- PDF