A Novel Approach For Detecting Symmetries in CSP Models
- 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
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.
Unable to display preview. Download preview PDF.