Solving Necklace Constraint Problems

Authors:
Pierre Flener;Justin Pearson
Affiliations:
Department of Information Technology, Uppsala University, Box 337, SE --751 05 Uppsala, Sweden. Email: Firstname.Surname@it.uu.se;Department of Information Technology, Uppsala University, Box 337, SE --751 05 Uppsala, Sweden. Email: Firstname.Surname@it.uu.se
Venue:
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Year:
2008

Citing 8
Cited 1

A fast algorithm for generating set partitions

The Computer Journal
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Regular Article: Necklaces, MSS Sequences, and DNA Sequences

Advances in Applied Mathematics
Fast algorithms to generate necklaces, unlabeled necklaces, and irreducible polynomials over GF(2)

Journal of Algorithms
A Filtering Algorithm for the Stretch Constraint

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A fast algorithm to generate necklaces with fixed content

Theoretical Computer Science
Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction

Constraints
Structural symmetry breaking

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Solving necklace constraint problems

Journal of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to be permuted (unlabelled necklaces), without getting an essentially different solution. We bring together the fields of combinatorial enumeration, where efficient algorithms have been designed for (special cases of) some of these combinatorial objects, and constraint programming, where the requisite symmetry breaking has at best been done statically so far. We design the first search procedure and identify the first symmetry-breaking constraints for the general case of unlabelled necklaces. Further, we compare dynamic and static symmetry breaking on real-life scheduling problems featuring (unlabelled) necklaces.