Chapter

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Volume 5015 of the series Lecture Notes in Computer Science pp 158-172

A Novel Approach For Detecting Symmetries in CSP Models

  • Christopher MearsAffiliated withMonash University
  • , Maria Garcia de la BandaAffiliated withMonash University
  • , Mark WallaceAffiliated withMonash University
  • , Bart DemoenAffiliated withKatholieke Universiteit Leuven

* Final gross prices may vary according to local VAT.

Get Access

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.