Constraints of Difference and Equality: A Complete Taxonomic Characterisation

  • Emmanuel Hebrard
  • Dániel Marx
  • Barry O’Sullivan
  • Igor Razgon
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5732)

Abstract

Many combinatorial problems encountered in practice involve constraints that require that a set of variables take distinct or equal values. The AllDifferent constraint, in particular, ensures that all variables take distinct values. Two soft variants of this constraint were proposed in [4], defined either with respect to a so-called variable or graph-based cost function. When requiring similarity, as opposed to diversity, one can consider the dual definition either for the cost or for the basic constraint itself, that is, AllEqual in our case. Six cost functions can be defined by exploring every combination of these definitions. It is therefore natural to study the complexity of achieving arc consistency and bounds consistency on them. From our earlier work on this topic an open problem remained, namely achieving bounds consistency on the maximisation of the SoftAllDiff constraint when considering the graph-based cost. In this paper we resolve this problem. Therefore, we give a complete taxonomy of constraints of equality and difference, based on the alternative objective functions used for the soft variants.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Beldiceanu, N.: Pruning for the minimum constraint family and for the number of distinct values constraint family. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 211–224. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  2. 2.
    Bessière, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: Filtering algorithms for the nvalueconstraint. Constraints 11(4), 271–293 (2006)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Hebrard, E., O’Sullivan, B., Razgon, I.: A soft constraint of equality: Complexity and approximability. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 358–371. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  4. 4.
    Petit, T., Régin, J.-C., Bessière, C.: Specific filtering algorithms for over-constrained problems. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 451–463. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Quimper, C.-G., López-Ortiz, A., van Beek, P., Golynski, A.: Improved algorithms for the global cardinality constraint. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 542–556. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  6. 6.
    Régin, J.-C.: A filtering algorithm for constraints of difference in csps. In: AAAI, pp. 362–367 (1994)Google Scholar
  7. 7.
    Régin, J.-C., Petit, T., Bessière, C., Puget, J.-F.: An original constraint based approach for solving over constrained problems. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 543–548. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  8. 8.
    van Hoeve, W.J.: A hyper-arc consistency algorithm for the soft alldifferent constraint. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 679–689. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. 9.
    van Hoeve, W.J., Pesant, G., Rousseau, L.-M.: On global warming: Flow-based soft global constraints. J. Heuristics 12(4-5), 347–373 (2006)CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Emmanuel Hebrard
    • 1
  • Dániel Marx
    • 2
  • Barry O’Sullivan
    • 1
  • Igor Razgon
    • 1
  1. 1.Cork Constraint Computation Centre Department of Computer ScienceUniversity College CorkIreland
  2. 2.Budapest University of Technology and EconomicsBudapestHungary

Personalised recommendations