Abstract
Lexicographic constraints are commonly used to break variable symmetries. In the general case, the number of constraint to be posted is potentially exponential in the number of variables. For injective problems (AllDiff), Puget’s method[12] breaks all variable symmetries with a linear number of constraints.
In this paper we assess the number of constraints for “almost” injective problems. We propose to characterize them by a parameter μ based on Global Cardinality Constraint as a generalization of the AllDiff constraint. We show that for almost injective problems, variable symmetries can be broken with no more than \(\binom{n}{\mu}\) constraints which is XP in the framework of parameterized complexity. When only ν variables can take duplicated values, the number of constraints is FPT in μ and ν.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Benoist, T., Gaudin, E., Rottembourg, B.: Constraint Programming Contribution to Benders Decomposition: A Case Study. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 603–617. Springer, Heidelberg (2002)
Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Quimper, C.G., Walsh, T.: The parameterized complexity of global constraints. In: Proc. AAAI, pp. 235–240 (2008)
Bessière, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: Filtering Algorithms for the NValue Constraint. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 79–93. Springer, Heidelberg (2005)
Bockmayr, A., Pisaruk, N., Aggoun, A.: Network Flow Problems in Constraint Programming. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 196–210. Springer, Heidelberg (2001)
Butler, G.: Fundamental Algorithms for Permutation Groups. LNCS, vol. 559. Springer, Heidelberg (1991)
Crawford, J., Ginsberg, M., Luks, E., Roy, A.: Symmetry-breaking predicates for search problems. In: Proc. KR 1996, pp. 148–159 (1996)
Downey, R.G., Fellows, M.R., Stege, U.: Parameterized complexity: A framework for systematically confronting computational intractability. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, pp. 49–99 (1997)
Flener, P., Pearson, J., Sellmann, M.: Static and dynamic structural symmetry breaking. Ann. Math. Artif. Intell. 57(1), 37–57 (2009)
Gent, I.P., Harvey, W., Kelsey, T.: Groups and Constraints: Symmetry Breaking during Search. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 415–430. Springer, Heidelberg (2002)
Gottlob, G., Szeider, S.: Fixed-parameter algorithms for artificial intelligence, constraint satisfaction and database problems. Comput. J. 51(3), 303–325 (2008)
McKay, B.D.: nauty user’s guide. Tech. rep., Australian National University (2009), http://cs.anu.edu.au/~bdm/nauty/
Puget, J.F.: Breaking symmetries in all different problems. In: Proc. IJCAI 2005, pp. 272–277 (2005)
Régin, J.C.: Generalized arc consistency for global cardinality constraint. In: Proc. AAAI 1996, pp. 209–215 (1996)
Seress, Á.: Permutation group algorithms. Cambridge tracts in mathematics. Cambridge University Press (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vismara, P., Coletta, R. (2012). Breaking Variable Symmetry in Almost Injective Problems. In: Milano, M. (eds) Principles and Practice of Constraint Programming. CP 2012. Lecture Notes in Computer Science, vol 7514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33558-7_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-33558-7_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33557-0
Online ISBN: 978-3-642-33558-7
eBook Packages: Computer ScienceComputer Science (R0)