Constraints for Breaking More Row and Column Symmetries
Constraint programs containing a matrix of two (or more) dimensions of decision variables often have row and column symmetries: in any assignment to the variables the rows can be swapped and the columns can be swapped without affecting whether or not the assignment is a solution. This introduces an enormous amount of redundancy when searching a space of partial assignments. It has been shown previously that one can remove consistently some of these symmetries by extending such a program with constraints that require the rows and columns to be lexicographically ordered. This paper identifies and studies the properties of a new additional constraint—the first row is less than or equal to all permutations of all other rows—that can be added consistently to break even more symmetries. Two alternative implementations of this stronger symmetry-breaking method are investigated, one of which employs a new algorithm that in time linear in the size of the matrix enforces the constraint that the first row is less than or equal to all permutations of all other rows. It is demonstrated experimentally that our method for breaking more symmetries substantially reduces search effort.
KeywordsConstraint Program Constraint Satisfaction Problem Decomposition Theorem Partial Assignment Index Symmetry
Unable to display preview. Download preview PDF.
- 1.Schellenberg, P.J., Anderson, B.A., Stinson, D.R.: The existance of Howell designs of even side. J. Combin. Theory, 23–55 (1984)Google Scholar
- 2.Carlsson, M., Beldiceanu, N.: Arc-consistency for a chain of lexicographic ordering constraints. Technical Report T2002-18, Swedish Institute of Computer Science (2002)Google Scholar
- 3.Conway, J.H., Slone, N.J.A.: Sphere-Packings, Lattices and Groups, 3rd edn. Springer, Heidelberg (1992)Google Scholar
- 4.Crawford, J., Ginsberg, M.L., Luck, E., Roy, A.: Symmetry-breaking predicates for search problems. In: Proceedings of KR 1996: Principles of Knowledge Representation and Reasoning, pp. 148–159 (1996)Google Scholar
- 5.Flener, P., Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., Walsh, T.: Breaking row and column symmetries in matrix models. In: Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming, pp. 462–476 (2002)Google Scholar
- 6.Flener, P., Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Matrix modelling: Exploiting common patterns in constraint programming. In: Proceedings of the International Workshop on Reformulating Constraint Satisfaction Problems, pp. 27–41 (2002)Google Scholar
- 7.Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Global constraints for lexicographic orderings. In: Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming, pp. 93–108 (2002)Google Scholar
- 8.Frisch, A.M., Miguel, I., Kiziltan, Z., Hnich, B., Walsh, T.: Multiset ordering constraints. In: Proceedings of the 18th International Joint Conference on AI (2003)Google Scholar
- 10.Hammons, A.R., Kumar, P.V., Slone, N.J.A., Solé, P.: The Z4-linearity of kerdock, goethals and related codes. IEEE Trans. Information Theory (1993)Google Scholar
- 14.Shlyakhter, I.: Generating effective symmetry-breaking predicates for search problems. Discrete Applied Mathematics (2002)Google Scholar