Copenhagen Programming Language Seminar
The world is full of symmetry. For instance, when configuring a computer,
the expansion slots may be interchangeable. Symmetry can lead to redundant
search, as many symmetrically equivalent dead-ends may be explored
wastefully. To avoid this, symmetry-breaking constraints can be added,
to exclude all but one of each equivalence class of solutions. Alternatively
search methods can be adapted to prevent them searching symmetric
states to those already visited. In this talk, I will describe recent
results in dealing with a special type symmetry, where the values
being assigned to the decision variables are symmetric.
Toby Walsh is an experienced and well recognized researcher in the field of constrained programming (for example his dblp record features 143 entries as of today). Toby will visit ITU on Nov 1-2, in connection with Tarik's phd defence. At that occassion he will give a talk. Please book your calendars now and come to see the talk!
If you are interested in meeting Toby, then contact Peter Tiedemann (email@example.com), who is maintaining Toby's schedule.
Scientific host: Andrzej Wasowski . Administrative host: Annette
Enggaard . All are welcome.
The Copenhagen Programming Language Seminar (COPLAS) is a collaboration between DIKU, ITU, KVL and RUC.
COPLAS is sponsored by the FIRST Graduate School.
To receive information about COPLAS talks by email, send a message to firstname.lastname@example.org with the word 'subscribe' as subject or in the body.
For more information about COPLAS, see http://www.coplas.org