Compositional Derivation of Symmetries for Constraint Satisfaction

  • Pascal Van Hentenryck
  • Pierre Flener
  • Justin Pearson
  • Magnus Ågren
Conference paper

DOI: 10.1007/11527862_17

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3607)
Cite this paper as:
Van Hentenryck P., Flener P., Pearson J., Ågren M. (2005) Compositional Derivation of Symmetries for Constraint Satisfaction. In: Zucker JD., Saitta L. (eds) Abstraction, Reformulation and Approximation. SARA 2005. Lecture Notes in Computer Science, vol 3607. Springer, Berlin, Heidelberg

Abstract

This paper reconsiders the problems of discovering symmetries in constraint satisfaction problems (CSPs). It proposes a compositional approach which derives symmetries of the applications from primitive constraints. The key insight is the recognition of the special role of global constraints in symmetry detection. Once the symmetries of global constraints are available, it often becomes much easier to derive symmetries compositionally and efficiently. The paper demonstrates the potential of this approach by studying several classes of value and variable symmetries and applying the resulting techniques to two non-trivial applications. The paper also discusses the potential of reformulations and high-level modeling abstractions to strengthen symmetry discovery.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Pascal Van Hentenryck
    • 1
  • Pierre Flener
    • 2
  • Justin Pearson
    • 2
  • Magnus Ågren
    • 2
  1. 1.Department of Computer ScienceBrown UniversityProvidenceUSA
  2. 2.Department of Information TechnologyUppsala UniversityUppsalaSweden

Personalised recommendations