Many constraint satisfaction problems (CSPs) have symmetries in the variables, domains, or constraints, or any combination thereof. Each of these symmetries preserves satisfiability, so that when there is symmetry in a CSP, any assignment can be transformed into an equivalent one without affecting whether or not it satisfies the constraints.
Symmetry can have an enormous effect on the combinatorial complexity of CSPs. In the presence of symmetry, a constraint solver may waste an exorbitant amount of time considering symmetric but equivalent assignments or partial assignments. Hence, dealing with symmetry is often crucial to the success of solving such CSPs efficiently.
The development of symmetry breaking and symmetry detection techniques in constraint programming (CP) has actually started in the early 1990s. In the early 2000s, there was a renewed and intense interest in such techniques. Progress made especially during these last few years is substantial, whereby the SymCon workshop series has played a key role in providing an open forum for CSP researchers as well as researchers from SAT, Mathematical Programming, and Computational Group Theory alike.
SymCon'12 at CP'12 in Quebec City, Canada
SymCon'11 at CP'11 in Perugia, Italy
SymCon'10 at CP'10 in St Andrews, Scotland, UK
SymCon'09 at CP'09 in Lisbon, Portugal
SymCon'08 at CP'08 in Sydney, Australia
SymCon'07 at CP'07 in Providence, RI, USA
SymCon'06 at CP'06 in Nantes, France (Proceedings)
SymCon'05 at CP'05 in Sitges, Spain
SymCon'04 at CP'04 in Toronto, Canada
SymCon'03 at CP'03 in Kinsale, Ireland (local copy of original website)
SymCon'02 at CP'02 in Ithaca, NY, USA
SymCon'01 at CP'01 in Paphos, Cyprus