The 10th International Workshop on
Symmetry in Constraint Satisfaction Problems (SymCon'10)

To be held at
the 16th International Conference on the
Principles and Practice of Constraint Programming (CP'10)

St Andrews, Scotland, UK
Monday 6 September 2010

The Workshop

This is the 10th workshop of the very successful SymCon series, founded by this year's programme chairs in 2001. It will be a half-day workshop open to anyone interested in the topic. The event will have a strong workshop flavour, with ample time allocated to discussion.

Programme and Proceedings

List of accepted papers (cover sheet and preface of the proceedings):

14:00 - 14:10 Opening
14:10 - 14:40 A Partial Taxonomy of Substitutability and Interchangeability (PDF)
Shant Karakashian, Robert Woodward, Berthe Choueiry, Steven Prestwich, and Eugene Freuder
14:40 - 15:10 Internal Symmetry (PDF)
Marijn Heule and Toby Walsh
15:10 - 15:40 Symmetries and Lazy Clause Generation (PDF)
Geoffrey Chu, Maria Garcia de la Banda, Chris Mears, and Peter Stuckey
15:40 - 16:00 Refreshments
16:00 - 17:00 Invited talk: Boosting Symmetry Breaking through Propagation
Pascal Van Hentenryck
17:00 - 17:30 Arities of Symmetry Breaking Constraints (PDF)
Tim Januschowski
17:30 - 18:00 Symmetries of Symmetry Breaking Constraints (ECAI'10 paper)
George Katsirelos and Toby Walsh
18:00 - 18:00 Closing

Programme Committee

Pierre Flener (co-chair) Uppsala University, Sweden
Ian P. Gent University of St Andrews, Scotland, UK
Justin Pearson (co-chair) Uppsala University, Sweden
Karen Petrie University of Dundee, Scotland, UK
Jean-François Puget IBM, France
Lakhdar Sais Université d'Artois, France
Mark Wallace Monash University, Australia
Toby Walsh University of New South Wales, Australia


A symmetry is a transformation that preserves solutions that are considered equivalent. For instance, rotating a chess board 180 degrees gives a board that is indistinguishable from the original board. Symmetry increases the apparent complexity of combinatorial problems. In the presence of symmetry, a constraint solver may waste a large amount of time considering symmetric but equivalent assignments or partial assignments. Hence, dealing with symmetry is often crucial to the success of solving such combinatorial problems efficiently.

Workshop topics include (but are not limited to):

Submission (closed)

Submissions must be formatted in the Lecture Notes in Computer Science (LNCS) style and must not exceed 15 pages. Submissions of shorter papers, including position papers, are welcome. Papers must be submitted in PDF format using EasyChair.

All submissions will be reviewed and those that are well written and make a worthwhile contribution to the topic of the workshop will be accepted for publication in the workshop proceedings. The proceedings will be available electronically at CP'10. At least one author of each accepted paper must attend the workshop.

Important Dates

Submission deadlineWednesday 30 June 2010 (closed)
Notification of acceptanceMonday 9 August 2010 (done)
Camera-ready copy deadlineThursday 19 August 2010 (closed)
WorkshopMonday 6 September 2010

Last modified: Tue Aug 31 07:55:47 CEST 2010