Call for Papers & Call for Participation
SymCon'02:
The Second International Workshop
on Symmetry in Constraint Satisfaction Problems
CP'02 Workshop
http://www.cs.cornell.edu/cp2002/ws-program.html
Sunday 8 September 2002
Ithaca, NY, USA
There are many constraint satisfaction problems that have a great deal of
symmetry. For example, when colouring a graph, many of the solutions are
related by rotating the colours. Similarly, when solving a tournament
timetabling problem, it does not matter in which order the participants play
the first games: many of the solutions are related by permuting the
participants. Symmetry in constraint satisfaction problems can be exploited
to increase the efficiency of search. This can be done by avoiding exploring
paths that have already been shown to be a dead-end in a symmetrical part of
the search tree, or by adding constraints so that (ideally) only one
assignment per equivalence class is enumerated. This process is often
referred to as symmetry breaking or symmetry reduction.
This workshop is to focus on the analysis and development of techniques to
detect and exploit symmetry in constraint satisfaction problems. It is the
second workshop in a series that started with SymCon'01 at CP'01 in Paphos,
Cyprus.
This will be a half-day workshop, with open attendance. Researchers wishing
to give talks should submit 4-to-8-page extended abstracts, in article or
LNCS style. If necessary for time reasons, only a subset of the submitted
works will be able to be presented: a selection will then be made by the
Programme Committee. Towards making the informal on-line proceedings a
who-is-who on symmetry, 1-page statements of interest are also solicited
(say for accepted papers on symmetry at the CP'02 main conference, or for
submitted workshop papers that cannot be presented for time reasons).
Work-in-progress may be submitted, and material from other submissions may
be reused.
Programme Committee Chairs
* Pierre Flener
Information Technology, Dept of Computing Science, Uppsala University,
Box 337, S-751 05 Uppsala, Sweden
Fax: +46 18 51 19 25; Tel: +46 18 471 1028; [EMAIL PROTECTED]
* Justin Pearson
Information Technology, Dept of Computer Systems, Uppsala University,
Box 337, S-751 05 Uppsala, Sweden
Fax: +46 18 55 02 25; Tel: +46 18 471 7292; [EMAIL PROTECTED]
Programme Committee Members
* Rolf Backofen, Universit�t Jena, Germany
* Belaid Benhamou, Universit� de Provence (Aix-Marseille I), France
* Torsten Fahle, Universit�t Paderborn, Germany
* Pedro Meseguer, Universitat Auton�ma de Barcelona, Spain
* Michela Milano, Universit� di Bologna, Italy
* Barbara M. Smith, University of Huddersfield, England
* Toby Walsh, Cork Constraint Computation Centre, Ireland
Submission Process
Extended abstracts of 4 to 8 LNCS/article-style pages are to be emailed, as
PS or PDF files, to [EMAIL PROTECTED] by Wednesday 10 July 2002.
Additionally, statements of interest of 1 page may be emailed, as PS or PDF
files, to [EMAIL PROTECTED] by Monday 5 August 2002.
At least one author of each presented submission must attend the workshop.
All workshop attendees must pay the CP'02 workshop registration fee.
Important Dates
Extended-abstract deadline: Wednesday 10 July 2002
Notification deadline: Friday 26 July 2002
Camera-ready-copy deadline: Monday 5 August 2002
Statement-of-interest deadline: Monday 5 August 2002
Workshop: Sunday 8 September 2002
------------------------------------------------------------------------
Pierre Flener and Justin Pearson
