Symmetry definitions for constraint satisfaction problems

Journal article

We review the many different definitions of symmetry for constraint satisfaction problems (CSPs) that have appeared in the literature, a.nd show that a symmetry can be defined in two fundamentally different ways: as an operation preserving the solutions of a CSP instance, or else as an operation preserving the constraints. We refer to these as solution symmetries and constraint Symmetrien. We define a constraint symmetry more precisely as an automorphism of a hypergraph associated with a CSP instance, the microstructure complement. We show that the solution symmetries of a CSP instance can also be obtained as the automorphisms of a. related hypergraph, the k-ary nogood hypergraph and give examples to show that some instances have many more solution symmetries than constraint symmetries. Finally, we discuss the practical implications of these different notions of symmetry. © Springer-Vorlag Berlin Heidelberg 2005.

Authors: Cohen, D; Jeavons, P; Jefferson, C; Petrie, K; Smith, B

• Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
• Volume: 3709 LNCS
• Pages: 17-31
• Publication date: 2005-01-01
• EISSN: 1611-3349
• ISSN: 0302-9743
• Language: English