Breaking conditional symmetry in automated constraint modelling with CONJURE

Research output: Chapter in Book/Report/Conference proceedingChapter

5 Citations (Scopus)
2 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationECAI 2014
EditorsTorsten Schaub, Gerhard Friedrich, Barry O'Sullivan
PublisherIOS Press
Pages3-8
Number of pages6
ISBN (Electronic)9781614994190
ISBN (Print)9781614994183
DOIs
Publication statusPublished - 18 Aug 2014

Publication series

NameFrontiers in Artificial Intelligence and Applications
PublisherIOS Press
Volume263
ISSN (Print)0922-6389

Fingerprint

Dive into the research topics of 'Breaking conditional symmetry in automated constraint modelling with CONJURE'. Together they form a unique fingerprint.

Cite this