A Novel Approach For Detecting Symmetries in CSP Models

  • Christopher Mears
  • Maria Garcia de la Banda
  • Mark Wallace
  • Bart Demoen
Conference paper

DOI: 10.1007/978-3-540-68155-7_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5015)
Cite this paper as:
Mears C., Garcia de la Banda M., Wallace M., Demoen B. (2008) A Novel Approach For Detecting Symmetries in CSP Models. In: Perron L., Trick M.A. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2008. Lecture Notes in Computer Science, vol 5015. Springer, Berlin, Heidelberg

Abstract

While several powerful methods exist for automatically detecting symmetries in instances of constraint satisfaction problems (CSPs), current methods for detecting symmetries in CSP models are limited to the kind of symmetries that can be inferred from the global constraints present in the model. Herein, a new approach for detecting symmetries in CSP models is presented. The approach is based on first applying powerful methods to a sequence of problem instances, and then reasoning on the resulting instance symmetries to infer symmetries of the model. Our results show that this approach deserves further exploration.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Christopher Mears
    • 1
  • Maria Garcia de la Banda
    • 1
  • Mark Wallace
    • 1
  • Bart Demoen
    • 2
  1. 1.Monash UniversityAustralia
  2. 2.Katholieke Universiteit LeuvenBelgium

Personalised recommendations