Symmetry breaking revisited

Constraints

Volumn 10, Issue 1, 2005, Pages 23-46

  Puget, Jean François ^a  

^a IBM   (United States)

Author keywords

BIBD; Breaking; SBDD; Search; Social golfer problem; Symmetry

Indexed keywords

CONSTRAINT THEORY; DECISION MAKING; GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION; THEOREM PROVING;

BIBD; BREAKING; SBDD; SEARCH; SOCIAL GOLFER PROBLEMS; SYMMETRY;

PROBLEM SOLVING;

EID: 14644428994     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10601-004-5306-8     Document Type: Conference Paper

References (27)

1. Backofen, R., & Will, S. (1999). Excluding symmetries in constraint based search. In Proceedings of CP'99.
2. Barnier, N., & Brisset, P. (2002). Solving the Kirkman's schoolgirl problem in a few seconds. In Proceedings of CP 02, pages 477-491.
3. Crawford, J., Ginsberg, M., Luks, E.M., Roy, A. Symmetry breaking Predicates for Search Problems. In Proceedings of KR'96, pages 148-159.
4. Gent, I.P., Walsh, T., & Sellmann, B. CSPlib http://www-users.cs. york.ac.uk/~tw/csplib/
5. Fahle, T., Shamberger, S., & Sellmann, M. (2001). Symmetry Breaking. In Proceedings of CP01, pages 93-107.
6. P. Flener, Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., & Walsh, T. (2002). Breaking row and column symmetries in matrix models. In Proceedings of CP'02, pages 462-476.
7. Focacci, F., & Milano, M. (2001). Global Cut Framework for Removing Symmetries. In Proceedings of CP01, pages 75-92.
8. Gent, I. P., Harvey, W., & Kelsey, T. (2002). Groups and constraints: Symmetry breaking during search. In Proceedings of CP, pages 415-430.
9. Gent, I. P., Linton, S. A., & Smith, B. M. (1999). Symmetry Breaking in the Alien Tiles Puzzle, Technical Report APES-22-2000, APES Research Group.
10. Gent, I. P., Harvey, W., & Kelsey, T. (2002). Groups and constraints: Symmetry breaking during search. In Proceedings of CP, pages 415-430.
11. Gent, I. P., Harvey, W., Kelsey, T., & Linton, S. (2003). Generic SBDD using computational group theory. In Proceedings of CP, pages 333-437.
12. Gent, I. P., & Smith, B. M. Symmetry breaking during search in constraint programming. In Proceedings ECAI'2000, pages 599-603.
13. Gervet, C. (1997). Interval propagation to reason about sets: Definition and implementation of a practical language, constraints, Int. J. 1: 191-246.
14. Harvey, W. (2001). Symmetry Breaking and the Social Golfer Problem CP01 Workshop on Symmetries.
15. Harvey, W. (2004). A note on the compatibility of static symmetry breaking constraints and dynamic symmetry breaking methods. In Proceedings of SymCon.
16. McDonald, I., & Smith, B. Partial symmetry breaking. In Proceedings of CP02, pages 431-445.
17. Meseguer, P., & Torras, C. (1999). Exploiting symmetries within constraint satisfaction search. Art.lntell. 129: 133-163.
18. Pearson, J. Symmetry breaking in constraint satisfaction with graph-isomorphism: Comma-free codes. In Proceedings of AIMATH 04.
19. Puget, J.-F. (1992). PECOS a high level constraint programming language. In Proc Spicis 92, Singapore (September).
20. Puget, J.-F. Symmetry breaking revisited. In Proceedings of CP'02, pages 446-461.
21. Puget, J.-F. Symmetry breaking using stabilizers. In Proceedings of CP'O3.
22. Puget, J.-F. Using Constraint Programming to Compute Symmetries. In Proceedings of SymCon 03.
23. Roney-Dougal, C. M., Gent, I. P., Kelsey, T., & Linton, S. "Tractable symmetry breaking using restricted search trees" To appear in proceedings of ECAI'04.
24. Roy, P., & Pachet, F. (1998). Using symmetry of global constraints to speed up the resolution of constraint satisfaction problems. In Proceedings of ECAI'98 Workshop on Non Binary Constraints, pages 27-33.
25. Sellmann, M., & Harvey, W. (2002). Heuristic constraint propagation. In Proceedings of CPAIOR'02 Workshop, pages 191-204.
26. Smith, B. M.: Reducing Symmetry in a Combinatorial Design Problem Research Report 2001.01, January 2001. Presented at the CP-AI-OR Workshop, April 2001.
27. Van Hentenryck, P., Agren, M., Flener, P., & Pearson, J. (2003). Tractable symmetry breaking for CSPs with interchangeable values. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI'03) Acapulco, Mexico (August).