Tractable symmetry breaking for CSPs with interchangeable values

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 277-282

  Van Hentenryck, P ^a   Flener, P ^b   Pearson, J ^b   Agren, M ^b  

^a Brown Univerity   (United States)

^b UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT TIME; SEARCH PROCEDURES; SYMMETRY-BREAKING;

ARTIFICIAL INTELLIGENCE;

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

References (13)

1. Rolf Backofcn and Sebastian Will. Excluding symmetries in constraint-based search. In CP'99.
2. N. Barnier and P. Brisset. Solving the Kirkman\s schoolgirl problem in a few seconds. In CP'2002.
3. P. Cameron. Permutation Groups, Cambridge Univ. Press, 1999.
4. J. Crawford et al. Symmetry breaking predicates for search problems. In KR'96.
5. Schamberger Fahle, Torsten, Stefan, and Meinolf Sellmann. Symmetry breaking. In CP'2001.
6. Filippo Focacci and Michacla Milano. Global cut framework for removing symmetries. In CP'2001.
7. E. Freuder. Eliminating interchangeable values in constraint satisfaction problems. In Proc. AAAI'91.
8. Ian P. Gent and B. Smith. Symmetry breaking during search in constraint programming. In ECAI2000.
9. M. Kubale and D. Jackowski. A Generalized Implicit Enumeration Algorithm for Graph Coloring. C4CA/,28(4):412-418, 1985.
10. P. Meseguer and C. Torras. Exploiting symmetries within constraint satisfaction search. Artificial Intelligence, 129(1-2): 133-163, 2001. (Pubitemid 32498418)
11. J.-F. Puget. On the satisfiability of symmetrical constrained satisfaction problems. In ISMIS'93.
12. J.-F. Puget. Symmetry Breaking Revisited. In CP'2002.
13. P. Van Hentenryck. Constraint and Integer Programming in OPL. Informs Journal on Computing, 14(4):345-372, 2002.