Automatic Generation of Constraints for Partial Symmetry Breaking

Christopher Jefferson, Karen Petrie

Research output: Chapter in Book/Report/Conference proceedingChapter

6 Citations (Scopus)

Abstract

Constraint Satisfaction Problems (CSPs) are often highly symmetric. Symmetries can give rise to redundant search, since subtrees may be explored which are symmetric to subtrees already explored. To avoid this redundant search, constraint programmers have designed methods, which try to exclude all but one in each equivalence class of solutions. One problem with many of the symmetry breaking methods that eliminate all the symmetry is that they can have a large running overhead. To counter this flaw many CP practitioners have looked for methods that only eliminate a subset of the symmetries, so called partial symmetry breaking methods, but do so in an efficient manner. Partial symmetry breaking methods often work only when the problem is of a certain type. In this paper, we introduce a new method of finding a small set of constraints which provide very efficient partial symmetry breaking. This method works with all problem classes and modelling techniques.
Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming - CP 2011
EditorsJimmy Lee
PublisherSpringer
Pages729-743
Number of pages15
Volume6876
ISBN (Print)978-3-642-23785-0
DOIs
Publication statusPublished - 2011

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg

Fingerprint

Dive into the research topics of 'Automatic Generation of Constraints for Partial Symmetry Breaking'. Together they form a unique fingerprint.

Cite this