Dynamic structural symmetry breaking for constraint satisfaction problems

Authors:
Pierre Flener;Justin Pearson;Meinolf Sellmann;Pascal Hentenryck;Magnus Ågren
Affiliations:
Department of Information Technology, Uppsala University, Uppsala, Sweden 751 05;Department of Information Technology, Uppsala University, Uppsala, Sweden 751 05;Department of Computer Science, Brown University, Providence, USA 02912;Department of Computer Science, Brown University, Providence, USA 02912;SICS, Kista, Sweden 164 29
Venue:
Constraints
Year:
2009

Citing 22
Cited 2

A generalized implicit enumeration algorithm for graph coloring

Communications of the ACM - Lecture notes in computer science Vol. 174
A fast algorithm for generating set partitions

The Computer Journal
Exploiting symmetries within constraint satisfaction search

Artificial Intelligence - Special issue on heuristic search in artificial intelligence
On the Satisfiability of Symmetrical Constrained Satisfaction Problems

ISMIS '93 Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems
Excluding Symmetries in Constraint-Based Search

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Symmetry Breaking

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Global Cut Framework for Removing Symmetries

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Symmetry Breaking Revisited

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Breaking Row and Column Symmetries in Matrix Models

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Solving the Kirkman's Schoolgirl Problem in a Few Seconds

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Constraint and Integer Programming in OPL

INFORMS Journal on Computing
Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction

Constraints
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Cost-based Filtering for Shorter Path Constraints

Constraints
An efficient way of breaking value symmetries

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Tractable symmetry breaking for CSPs with interchangeable values

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Structural symmetry breaking

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Breaking symmetry of interchangeable variables and values

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Breaking value symmetry

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Static and dynamic structural symmetry breaking

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Dynamic symmetry breaking restarted

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Compositional derivation of symmetries for constraint satisfaction

SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation

Static and dynamic structural symmetry breaking

Annals of Mathematics and Artificial Intelligence
Increasing symmetry breaking by preserving target symmetries

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years, symmetry breaking for constraint satisfaction problems (CSPs) has attracted considerable attention. Various general schemes have been proposed to eliminate symmetries. In general, these schemes may take exponential space or time to eliminate all the symmetries. We identify several classes of CSPs that encompass many practical problems and for which symmetry breaking for various forms of value or variable interchangeability is tractable using dedicated search procedures. We also show the limits of efficient symmetry breaking for such dominance-detection schemes by proving intractability results for some classes of CSPs.