Abstract
The AllDifferent constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of variables. By looking at the set of all pairwise not-equal relations at the same time, AllDifferent offers greater filtering power. The natural question arises whether we can generally leverage the knowledge that sets of pairs of variables all share the same relation. This paper studies exactly this question. We study in particular special constraint graphs like cliques, complete bipartite graphs, and directed acyclic graphs, whereby we always assume that the same constraint is enforced on all edges in the graph. In particular, we study whether there exists a tractable GAC propagator for these global Same-Relation constraints and show that AllDifferent is a huge exception: most Same-Relation Constraints pose NP-hard filtering problems. We present algorithms, based on AC-4 and AC-6, for one family of Same-Relation Constraints, which do not achieve GAC propagation but outperform propagating each constraint individually in both theory and practice.
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
Bessière, C., Cordier, M.O.: Arc-consistency and arc-consistency again. In: AAAI, pp. 108–113 (1993)
Bessière, C., Freuder, E., Régin, J.C.: Using Constraint Metaknowledge to Reduce Arc Consistency Computation. Artificial Intelligence 107(1), 125–148 (1999)
Bessière, C., Hebrard, E., Hnich, B., Walsh, T.: The Complexity of Reasoning with Global Constraints. Constraints 12(2), 239–259 (2007)
Bulatov, A.: Tractable Conservative Constraint Satisfaction Problems. LICS, 321–330 (2003)
Dalmau, V., Kolaitis, P.G., Vardi, M.Y.: Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 310–326. Springer, Heidelberg (2002)
Dechter, R., Pearl, J.: Tree Clustering for Constraint Networks. Artificial Intelligence 38(3), 353–366 (1989)
Downey, R., Fellows, M.: Parametrized Complexity. Springer, Heidelberg (1999)
Feder, T., Vardi, M.: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction. SIAM Journal on Computing 28(1), 57–104 (1998)
Freuder, E.: A Sufficient Condition for Backtrack-bounded Search. Journal of the ACM 32(4), 755–761 (1985)
Freuder, E.: Complexity of K-Tree Structured Constraint Satisfaction Problems. In: AAAI, pp. 4–9 (1990)
Gent, I.P., Irving, R.W., Manlove, D.F., Prosser, P., Smith, B.M.: A Constraint Programming Approach to the Stable Marriage Problem. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 225–239. Springer, Heidelberg (2001)
Gottlob, G., Scarcello, F.: A comparison of structural CSP decomposition methods. Artificial Intelligence 124(2), 243–282 (1999)
Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM 54(1) (2007)
Hell, P., Huang, J., Rafiey, A.: List Homomorphism to Reflexive Digraphs: Dichotomy Classification (submitted, 2009)
Klostermeyer, W., MacGillivray, G.: Homomorphisms and oriented colorings of equivalence classes of oriented graphs. Discrete Mathematics 274(1-3), 161–172 (2004)
Mohr, R., Henderson, T.: Arc and path consistency revisited. Artificial Intelligence 28(2), 225–233 (1986)
Régin, J.C.: A filtering algorithm for constraints of difference in CSPs. AAAI 1, 362–367 (1994)
Salamon, A.Z., Jeavons, P.G.: Perfect Constraints Are Tractable. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 524–528. Springer, Heidelberg (2008)
Sopena, E.: Oriented graph coloring. Discrete Mathematics 229(1-3), 359–369 (2001)
Swarts, J.S.: The Complexity of Digraph Homomorphisms: Local Tournaments, Injective Homomorphisms and Polymorphisms. PhD thesis, University of Victoria (2008)
Unsworth, C., Prosser, P.: An n-ary constraint for the stable marriage problem. In: IJCAI, pp. 32–38 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jefferson, C., Kadioglu, S., Petrie, K.E., Sellmann, M., Živný, S. (2009). Same-Relation Constraints. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-04244-7_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04243-0
Online ISBN: 978-3-642-04244-7
eBook Packages: Computer ScienceComputer Science (R0)