Projects per year
Abstract
We introduce the study of Conditional symmetry breaking in constraint programming. This arises in a subproblem of a constraint satisfaction problem, where the subproblem satisfies some condition under which additional symetries hold. Conditional symmetry can cause redundancy in a systematic search for solutions. Breaking this symmetry is an important part of solving a constraint satisfaction problem effectively. We demonstrate experimentally that three methods, wellknown for breaking unconditional symmetries, can be applied to conditional symmetries. These are: adding conditional symmetrybreaking constraints, reformulating the problem to remove the symmetry, and augmenting the search process to break the conditional symmetry dynamically through the use of a variant of Symmetry Breaking by Dominance Detection (SBDD).
Original language  English 

Title of host publication  Principles and practice of constraint programmingCP 2005: 11th international conference, CP 2005, Sitges, Spain, October 15, 2005 : Proceedings 
Editors  Peter Van Beek 
Publisher  Springer 
Pages  256270 
Number of pages  15 
ISBN (Print)  9783540292388 
DOIs  
Publication status  Published  Oct 2005 
Publication series
Name  Lecture notes in computer science 

Volume  3709 
ISSN (Print)  03029743 
ISSN (Electronic)  16113349 
Fingerprint
Dive into the research topics of 'Conditional symmetry breaking'. Together they form a unique fingerprint.Projects
 1 Finished

EP/C523229/1: Multidisciplinary Critical Mass in Computational Algebra and Applications
Linton, S. A., Gent, I. P., Leonhardt, U., Mackenzie, A., Miguel, I. J., Quick, M. & Ruskuc, N.
1/09/05 → 31/08/10
Project: Standard