Skip to main content
Springer Nature Link
Log in

Checking and Filtering Global Set Constraints

  • Conference paper
Principles and Practice of Constraint Programming – CP 2011 (CP 2011)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6876))

Abstract

This paper considers feasibility checking and filtering of global constraints over set variables. It makes four main contributions. (1) It presents a feasibility checker for the global alldisjoint constraint. (2) It proposes primal filters for the combination of a global disjoint constraint and symmetry-breaking constraints. (3) It proposes dual filters for global intersection constraints. (4) It presents primal/dual filters for the combination of a global intersection constraint and symmetry-breaking constraints. All these contributions are independent of the underlying domain representation. Experimental results show that these proposals have complementary benefits, may improve efficiency significantly, and make it possible to solve larger instances of two standard benchmarks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Puget, J.F.: Pecos a high level constraint programming language. In: Proc. of Spicis (1992)

    Google Scholar 

  2. Gervet, C.: Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints 1(3), 191–244 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. Gervet, C., Hentenryck, P.V.: Length-lex ordering for set csps. In: AAAI. AAAI Press, Menlo Park (2006)

    Google Scholar 

  4. Azevedo, F.: Cardinal: A finite sets constraint solver. Constraints 12(1), 93–129 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Yip, J., Van Hentenryck, P.: Exponential propagation for set variables. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 499–513. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Hawkins, P., Lagoon, V., Stuckey, P.J.: Solving set constraint satisfaction problems using robdds. Journal of Artificial Intelligence Research 24, 109–156 (2005)

    Article  MATH  Google Scholar 

  7. Cheng, B.M.W., Choi, K.M.F., Lee, J.H.M., Wu, J.C.K.: Increasing constraint propagation by redundant modeling: an experience report. Constraints 4(2), 167–192 (1999)

    Article  MATH  Google Scholar 

  8. Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Global constraints for lexicographic orderings. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 93–108. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Crawford, J.M., Ginsberg, M.L., Luks, E.M., Roy, A.: Symmetry-breaking predicates for search problems. In: KR, pp. 148–159 (1996)

    Google Scholar 

  10. Hnich, B., Kiziltan, Z., Walsh, T.: Combining symmetry breaking with other constraints: Lexicographic ordering with sums. In: AMAI (2004)

    Google Scholar 

  11. Katsirelos, G., Narodytska, N., Walsh, T.: Combining symmetry breaking and global constraints (2009)

    Google Scholar 

  12. Yip, J., Van Hentenryck, P.: Evaluation of length-lex set variables. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 817–832. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  13. Bessière, C., Hebrard, E., Hnich, B., Walsh, T.: Disjoint, partition and intersection constraints for set and multiset variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 138–152. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Sadler, A., Gervet, C.: Global reasoning on sets. In: Proceedings of Workshop on Modelling and Problem Formulation (FORMUL 2001), held Alongside CP 2001 (2001)

    Google Scholar 

  15. Colbourn, C.J., Dinitz, J.H., Ii, L.C., Jajcay, R., Magliveras, S.S.: The crc handbook of combinatorial designs (1995)

    Google Scholar 

  16. Jukna, S.: Extremal combinatorics (2001)

    Google Scholar 

  17. Sadler, A., Gervet, C.: Enhancing set constraint solvers with lexicographic bounds. J. Heuristics 14(1), 23–67 (2008)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Brown University, Box 1910, Providence, RI, 02912, USA

    Justin Yip & Pascal Van Hentenryck

Authors
  1. Justin Yip
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pascal Van Hentenryck
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong, China

    Jimmy Lee

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yip, J., Van Hentenryck, P. (2011). Checking and Filtering Global Set Constraints. In: Lee, J. (eds) Principles and Practice of Constraint Programming – CP 2011. CP 2011. Lecture Notes in Computer Science, vol 6876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23786-7_61

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23786-7_61

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23785-0

  • Online ISBN: 978-3-642-23786-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics