By the same authors

Breaking conditional symmetry in automated constraint modelling with CONJURE

Research output: Chapter in Book/Report/Conference proceedingChapter

Full text download(s)

Published copy (DOI)

Author(s)

Department/unit(s)

Publication details

Title of host publicationECAI 2014
DateAccepted/In press - 9 May 2014
DatePublished (current) - 18 Aug 2014
Pages3-8
Number of pages6
PublisherIOS Press
Volume263
Original languageEnglish
ISBN (Print)9781614994183

Abstract

Many constraint problems contain symmetry, which can lead to redundant search. If a partial assignment is shown to be invalid, we are wasting time if we ever consider a symmetric equivalent of it. A particularly important class of symmetries are those introduced by the constraint modelling process: model symmetries. We present a systematic method by which the automated constraint modelling tool CONJURE can break conditional symmetry as it enters a model during refinement. Our method extends, and is compatible with, our previous work on automated symmetry breaking in CONJURE. The result is the automatic and complete removal of model symmetries for the entire problem class represented by the input specification. This applies to arbitrarily nested conditional symmetries and represents a significant step forward for automated constraint modelling.

Bibliographical note

© 2014 The Authors and IOS Press. This work was supported by UK EPSRC EP/K015745/1. Jefferson is supported by a Royal Society University Research Fellowship.

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations