Breaking all value symmetries in surjection problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3709 LNCS, Issue , 2005, Pages 490-504

  Puget, Jean François ^a  

^a IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; CONSTRAINT THEORY; PROBLEM SOLVING;

BINARY CONSTRAINTS; COMPUTATIONAL GROUP THEORY; SURJECTION PROBLEMS;

COMPUTATION THEORY;

EID: 33646183080     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_37     Document Type: Conference Paper

References (22)

1. F. Aloul, I. Markov, and K. Sakallah "Efficient Symmetry-Breaking for Boolean Satisfiability". In proceedings of IJCAI 03, Acapulco, Mexico, pp. 271-282, 2003.
2. Benhamou B., "Symmetry in Not-equals Binary Constraint Networks". In Proceedings of SymCon'04, pp. 2-8, Toronto, September 2004
3. Crawford, J., Ginsberg, M., Luks E.M., Roy, A. "Symmetry Breaking Predicates for Search Problems". In proceedings of KR'96, pp. 148-159.
4. P. Flener, A. M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson, T. Walsh.: "Breaking Row and Column Symmetries in Matrix Models". In Proceedings of CP'02, pp. 462-476, 2002
5. Ian P. Gent "A Symmetry Breaking Constraint for Indistinguishable Values". In proceedings of SymCon01, a CP'01 workshop.
6. I. Gent, T. Walsh, and B. Selman CSPLIB, A problem library for constraints http://www.csplib.org
7. Gent, I.P., and Harvey, W., and Kelsey, T.: "Groups and Constraints: Symmetry Breaking During Search". In proceedings of CP 2002, pp. 415-430.
8. Gent, I.P., Harvey, W., Kelsey, T., Linton, S.: "Generic SBDD Using Computational Group Theory". In proceedings of CP 2003, pp. 333-437
9. ILOG: ILOG Solver 6.0. User Manual. ILOG, S.A., Gentilly, France, September 2003
10. Kelsey, T, Linton, SA, Roney-Dougal, CM. "New Developments in Symmetry Breaking in Search Using Computational Group Theory". In Proceedings AISC 2004. Springer LNAI. 2004.
11. Y. C. Law and J. H. M. Lee. "Expressing Symmetry Breaking Constraints Using Multiple Viewpoints and Channeling Constraints". In Proceedings of SymCon 03 (held in conjunction with CP-2003), pages 127-141, 2003.
12. Y. C. Law and J. H. M. Lee. "Breaking Value Symmetries in Matrix Models using Channeling Constraints". In Proceedings of the 20th Annual ACM Symposium on Applied Computing (SAC-2005), pages 375-380, 2005.
13. Dame Ollerenshaw, K. "On most perfect or complete 8×8 pandiagonal magic squares". In Proceedings Royal Society London, 407, 259-281, 1986.
14. Puget, J.-F.: "Breaking symmetries in all different problems". To appear in proceedings of IJCAI 05.
15. Puget, J.-F.: "Elimination de symetries dans les problmes injectifs." To appear in proceedings of JFPC 05 (in French).
16. Puget, J.-F.: "Automatic detection of variable and value symmetries" To appear in the proceedings of CP 05, Sitges, 2005.
17. J-C. Regin, "Modeling and Solving Sports League Scheduling with Constraint Programming", Informs, April 1998, Montreal.
18. J-C. Regin, "Constraint Programming and Sports Scheduling Problems", Informs, May 1999, Cincinnati.
19. Roney-Dougal C.M., Gent, I.P., Kelsey T., Linton S.: "Tractable symmetry breaking using restricted search trees" In proceedings of ECAI'04-
20. Meinolf Sellmann and Pascal Van Hentenryck Structural Symmetry Breaking To appear in proceedings of IJCAI 05.
21. Seress, A.: Permutation Group Algorithms Cambrige University Press, 2003.
22. Van Hentenryck, P., Constraint Satisfaction in Logic Programming, MIT press, 1989.