Tractable symmetry breaking using restricted search Trees

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 211-215

  Roney Dougal, Colva M ^a   Gent, Ian P ^a   Kelsey, Tom ^a   Linton, Steve ^a  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORESTRY; POLYNOMIAL APPROXIMATION;

ARBITRARY VALUES; CONSTRAINT SATISFACTION; EXPERIMENTAL EVIDENCE; POLYNOMIAL-TIME ALGORITHMS; SEARCH TREES; SYMMETRY BREAKINGS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 85017358595     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (15)

1. R. Backofen and S. Will, Excluding symmetries in constraint-based search, in Proc. CP-99, pp. 73-87. Springer, (1999).
2. C.A. Brown, L. Finkelstein, and P.W. Purdom Jr., Backtrack searching in the presence of symmetry, in Proc. AAECC-6, ed., T. Mora, pp. 99-110. Springer-Verlag, (1988).
3. J. Crawford, M. Ginsberg, E. Luks, and A. Roy, Symmetry-breaking predicates for search problems, in Proc. KR'96, pp. 149-159, (November 1996).
4. Torsten Fahle, Stefan Schamberger, and Meinolf Sellmann, Symmetry breaking, in Proc. CP 2001, ed., T.Walsh, pp. 93-107, (2001).
5. Pierre Flener, Alan M. Frisch, Brahim Hnich, Zeynap Kiziltan, Ian Miguel, Justin Pearson, and Toby Walsh, Breaking row and column symmetries in matrix models, in Proc. CP 2002, ed., Pascal Van Hentenryck, pp. 462-476. Springer-Verlag, (2002).
6. Filippo Focacci and Michaela Milano, Global cut framework for removing symmetries, in Proc. CP 2001, ed., T. Walsh, pp. 77-92, (2001).
7. The GAP Group, GAP . Groups, Algorithms, and Programming, Version 4.3, 2003. (http://www.gap-system.org).
8. Ian P. Gent, Warwick Harvey, and Tom Kelsey, Groups and constraints: Symmetry breaking during search, in Proc. CP 2002, ed., Pascal Van Hentenryck, pp. 415-430. Springer-Verlag, (2002).
9. I.P. Gent, W. Harvey, T. Kelsey, and S.A. Linton, Generic SBDD using computational group theory, in Proc. CP 2003, ed., Francesca Rossi, pp. 333-347. Springer-Verlag, (2003).
10. I.P. Gent and B.M. Smith, Symmetry breaking in constraint programming, in Proc. ECAI 2000, ed., W. Horn, pp. 599-603. IOS Press, (2000).
11. Dame Kathleen Ollerenshaw, On most perfect or complete 8x8 pandiagonal magic squares, Proc. Royal Soc. London, 407, 259-281, (1986).
12. Jean-François Puget, Symmetry breaking revisited, in Proc. CP 2002, ed., Pascal Van Hentenryck, pp. 446.461. Springer-Verlag, (2002).
13. Akos Seress, Permutation group algorithms, number 152 in Cambridge tracts in mathematics, Cambridge University Press, 2002.
14. P. Van Hentenryk, P. Flener, J. Pearson, and M. Agren, Tractable symmetry breaking for CSPs with interchangeable values, in Proc. IJCAI' 03, (2003).
15. M. G. Wallace, S. Novello, and J. Schimpf, ECLiPSe : A platform for constraint logic programming, ICL Systems Journal, 12(1), 159-200, (May 1997).