An efficient way of breaking value symmetries

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 117-122

  Puget, Jean François ^a  

^a IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMBINATORIAL MATHEMATICS; COMPUTER PROGRAMMING; GRAPH THEORY; PROBLEM SOLVING;

CONSTRAINT PROGRAMMING; ELEMENT CONSTRAINTS; SYMMETRY BREAKING; VALUE SYMMETRIES;

CONSTRAINT THEORY;

EID: 33750690177     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Aloul, F.A.; Sakallah, K.A., and Markov, I.L. 2003. "Efficient Symmetry Breaking for Boolean Satisfiability." In Proceedings of IJCAI 2003, pages 271-276.
2. Benhamou, B., 2004. "Symmetry in Not-equals Binary Constraint Networks". In Proceedings of SymCon '04, pp. 2-8, Toronto, September 2004
3. Carlsson, M., and Beldiceanu, N. 2002. "Revisiting the Lexicographic Ordering Constraint" SICS Technical report T2002:17
4. Crawford, J.; Ginsberg, M.; and Luks E.M., Roy, A. 1996. "Symmetry Breaking Predicates for Search Problems". In Proceedings of KR'96, pp. 148-159.
5. Fahle, T.; Shamberger, S.; and Sellmann, M. 2001. "Symmetry Breaking." In Proceedings of CP01 (2001) 93-107.
6. Flener, P.;Frisch, A. M.; Hnich, B.; Kiziltan, Z.; Miguel, I.; Pearson, J.; and Walsh, T. 2002. "Breaking Row and Column Symmetries in Matrix Models". In Proceedings of CP'02, pp. 462-476, 2002
7. Focacci, F., and Milano, M. 2001. "Global Cut Framework for Removing Symmetries." In Proceedings of CP'01 (2001) 75-92.
8. Frisch, A. M.; Hnich, B.; Kiziltan, Z.; Miguel, I.; and Walsh, T. 2002. Global Constraints for Lexicographic Orderings. In Proceedings of CP'02, pp 93-108.
9. Gent, I.P.; and Harvey, W.; and Kelsey, T. 2002. "Groups and Constraints: Symmetry Breaking During Search". In Proceedings of CP 2002, pp. 415-430.
10. Gent, I.P.; Harvey, W.; Kelsey, T.; and Linton, S. 2003. "Generic SBDD Using Computational Group Theory". In Proceedings of CP 2003, pp. 333-437
11. ILOG SA. 2006. ILOG Solver 6.2. User Manual. ILOG, S.A., Gentilly, France, January 2006.
12. Kelsey, T; Linton, SA.; and Roney-Dougal, CM 2004. "New Developments in Symmetry Breaking in Search Using Computational Group Theory". In Proceedings AISC 2004. Springer LNAI. 2004.
13. Law, Y. C., and Lee, J. H. M. 2003. "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.
14. Law, Y. C., and Lee, J. H. M. 2005. "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.
15. Petrie, K., Smith, B.M. 2003. "Symmetry breaking in graceful graphs." In Proceedings of CP'03, LNCS 2833, 930-934, Springer Verlag, 2003.
16. Petrie, K., Smith, B.M. 2005. "Comparison of Symmetry Breaking Methods in Constraint Programming" In Proceedings of SymCon05, the 5th International Workshop on Symmetry in Constraints, 2005
17. Füget, J.-F. 2005a. "Breaking symmetries in all different problems". In Proceedings of IJCAI 05, pages 272-277, 2005.
18. Puget, J.-F. 2005b. "Automatic detection of variable and value symmetries" In Proceedings of CP 05, pages 475-489, 2005.
19. Puget J.-F. 2005c. "Breaking All Value Symmetries in Surjection Problems" In Proceedings of CP 05, pages 490-504, 2005.
20. Ramani, A.; Aloul, F.A.; Markov, I.L.; Sakallah, K.A. 2004. "Breaking Instance-Independent Symmetries in Exact Graph Coloring." In Proceedings of DATE 2004, pages 324-331.
21. Roney-Dougal, C.M.; Gent, I.P.; Kelsey, T.; Linton, S. 2004. "Tractable symmetry breaking using restricted search trees" In Proceedings of ECAI'04.
22. Sellmann, M., and Van Hentenryck, P. 2005. Structural Symmetry Breaking In Proceedings of IJCAI 05.
23. Seress, A. 2003. Permutation Group Algorithms Cambrige University Press, 2003.