A novel approach for detecting symmetries in CSP models

Authors:
C. Mears;M. Garcia De La Banda;M. Wallace;B. Demoen
Affiliations:
Monash University, Australia;Monash University, Australia;Monash University, Australia;Katholieke Universiteit Leuven, Belgium
Venue:
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Year:
2008

Citing 8
Cited 1

Symmetry Breaking Revisited

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Exploiting structure in symmetry detection for CNF

Proceedings of the 41st annual Design Automation Conference
Exploiting interchangeabilities in constraint satisfaction problems

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Structural symmetry breaking

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
CGRASS: a system for transforming constraint satisfaction problems

ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Detecting and breaking symmetries by reasoning on problem specifications

SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Compositional derivation of symmetries for constraint satisfaction

SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Automatically exploiting symmetries in constraint programming

CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints

Proving symmetries by model transformation

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

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.