Breaking All Value Symmetries in Surjection Problems

We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear number of binary constraints. The set of constraints is automatically computed from the symmetries of the problem using...

Full description

Saved in:
Bibliographic Details
Published inLecture notes in computer science Vol. 3709; pp. 490 - 504
Main Author Puget, Jean-François
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Germany Springer Berlin / Heidelberg 2005
Springer Berlin Heidelberg
Springer
Edition1ère éd
SeriesLecture Notes in Computer Science
Subjects
Applied sciences
Artificial intelligence
Binary Constraint
Computer science; control theory; systems
Exact sciences and technology
Matrix Model
Problem solving, game playing
Solution Orbit
Symmetry Breaking
Symmetry Group
Problem solving
Constraint satisfaction
Binary number
Group theory
Symmetry breaking
Online AccessGet full text

Cover

More Information
Summary:We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear number of binary constraints. The set of constraints is automatically computed from the symmetries of the problem using computational group theory. Our method applies to problems where every value is taken by at least one variable. Such problems occur frequently in practice. Various experiments show that our method is extremely effective when compared to previously published methods.
ISBN:3540292381
9783540292388
ISSN:0302-9743
1611-3349
DOI:10.1007/11564751_37