[Homepage]
[Call for Papers]
[Important Dates]
[Organisation]
[Proceedings]
[Programme]
[CP 2006]
[Previous Workshops]
A problem contains symmetry when any of its structure can be permuted to give an equivalent problem. Symmetry in a constraint satisfation problem can be defined as solution preserving or constraint preserving. Solution symmetry is a permutation of the variables and values that preserve the set of solutions to the problem. A constraint symmetry is an automorphism of the microstructure of the problem.
Symmetries occur frequently in constraint satisfaction problems leading to redundant search using traditional backtracking methods. In recent years techniques to break symmetry have been proposed to limit or eliminate this redundancy. Although widely accepted by the CP community, many open problems remain in this field.
SymCon is a forum for researchers to present new ideas relating to symmetry breaking techniques, addressing these open problems. Additionally, the workshops allow for case studies of problems which exhibit interesting symmetries. Due to the pervasive nature of symmetry in constraint programming, and the interesting ideas from computational group theory which have application in this area, submissions are welcome from researchers in both fields. In addition, the organisers welcome papers on symmetry exploitation in other search areas which may be of interest to constraint programmers.