Dynamic lex constraints

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

Volumn 4204 LNCS, Issue , 2006, Pages 453-467

  Puget, Jean François ^a  

^a IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; THEOREM PROVING; TREES (MATHEMATICS); USER INTERFACES;

FILTERING ALGORITHMS; LEX CONSTRAINTS; SYMMETRIES;

CONSTRAINT THEORY;

EID: 33750335108     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889205_33     Document Type: Conference Paper

References (20)

1. Backofen, R., Will, S.: "Excluding Symmetries in Constraint Based Search" Proceedings of CP'99 (1999).
2. Cohen, D., Jeavons, P., Jefferson, C., Petrie, K., Smith, B.: "Symmetry Definitions for Constraint Satisfaction Problems" In proceedings of CP 2005, ed. Peter van Beek, pp. 17-31, Springer, LNCS 3709, 2005.
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. Fahle, T., Shamberger, S., Sellmann, M.: "Symmetry Breaking" In proceedings of CP01 (2001) pp. 93-107.
5. Focacci, F., and Milano, M.: "Global Cut Framework for Removing Symmetries" In proceedings of CP'01 (2001) PP. 75-92.
6. Gent, I.P., and Harvey, W., and Kelsey, T.: "Groups and Constraints: Symmetry Breaking During Search" In proceedings of CP 2002, pp. 415-430.
7. Gent, I.P., Harvey, W., Kelsey, T., Linton, S.: "Generic SBDD Using Computational Group Theory" In proceedings of CP 2003, pp. 333-437.
8. Gent, I.P., and Smith, B.M.: "Symmetry Breaking During Search in Constraint Programming" In proceedings of ECAP'2000, pp. 599-603.
9. ILOG: ILOG Solver 6.3. User Manual ILOG, S.A., Gentilly, France, July 2006.
10. I. J. Lustig and J.-F. Puget. "Program Does Not Equal Program: Constraint Programming and Its Relationship to Mathematical Programming". INTERFACES, 31(6):29-53, 2001.
11. Petrie, K., Smith, B.M. 2003. "Symmetry breaking in graceful graphs." In proceedings of CP'03, LNCS 2833, pp. 930-934, Springer Verlag, 2003.
12. Puget, J.-F.: "On the Satisfiability of Symmetrical Constraint Satisfaction Problems." In proceedings of ISMIS'93 (1993), pp.350-361.
13. Puget, J.-F.: "Breaking symmetries in all different problems". In proceedings of IJCAI 05, pp. 272-277, 2005.
14. Puget, J.-F.: "Symmetry Breaking Revisited". Constraints 10(1): 23-46 (2005)
15. Puget J.-F.: "Breaking All Value Symmetries in Surjection Problems" In proceedings of CP 05, pp. 490-504, 2005.
16. Puget J.-F.: "An Efficient Way of Breaking Value Symmetries" To appear in proceedings of AAAI 06.
17. Roney-Dougal C.M., Gent, I.P., Kelsey T., Linton S.: "Tractable symmetry breaking using restricted search trees" In proceedings of ECAI'04.
18. Seress, A. 2003. Permutation Group Algorithms Cambrige University Press, 2003.
19. Smith, B.: "Sets of Symmetry Breaking Constraints" In proceedings of SymCon05, the 5th International Workshop on Symmetry in Constraints, 2005.
20. Smith, B.: "Constraint Programming Models for Graceful Graphs", To appear in Proceedings of CP 06