Skip to main content
SpringerLink
Log in

A Constraint Seeker: Finding and Ranking Global Constraints from Examples

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

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

Abstract

In this paper we describe a Constraint Seeker application which provides a web interface to search for global constraints in the global constraint catalog, given positive and negative, fully instantiated (ground) examples. Based on the given instances the tool returns a ranked list of matching constraints, the rank indicating whether the constraint is likely to be the intended constraint of the user. We give some examples of use cases and generated output, describe the different elements of the search and ranking process, discuss the role of constraint programming in the different tools used, and provide evaluation results over the complete global constraint catalog. The Constraint Seeker is an example for the use of generic meta-data provided in the catalog to solve a specific problem.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 149.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Beldiceanu, N.: Global constraints as graph properties on a structured network of elementary constraints of the same type. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 52–66. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Beldiceanu, N., Carlsson, M., Debruyne, R., Petit, T.: Reformulation of global constraints based on constraint checkers. Constraints 10(3) (2005)

    Google Scholar 

  3. Beldiceanu, N., Carlsson, M., Petit, T.: Deriving filtering algorithms from constraint checkers. In: Wallace (ed.) [25], pp. 107–122

    Google Scholar 

  4. Beldiceanu, N., Carlsson, M., Rampon, J.: Global constraint catalog, 2nd edn. Technical Report T2010:07, SICS (2010)

    Google Scholar 

  5. Bessière, C., Coletta, R., Freuder, E.C., O’Sullivan, B.: Leveraging the learning power of examples in automated constraint acquisition. In: Wallace (ed.) [25], pp. 123–137

    Google Scholar 

  6. Bessière, C., Coletta, R., Koriche, F., O’Sullivan, B.: A SAT-based version space algorithm for acquiring constraint satisfaction problems. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds.) ECML 2005. LNCS (LNAI), vol. 3720, pp. 23–34. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Bessière, C., Coletta, R., Koriche, F., O’Sullivan, B.: Acquiring constraint networks using a SAT-based version space algorithm. In: AAAI. AAAI Press, Menlo Park (2006)

    Google Scholar 

  8. Bessière, C., Coletta, R., O’Sullivan, B., Paulin, M.: Query-driven constraint acquisition. In: Veloso (ed.) [23], pp. 50–55

    Google Scholar 

  9. Bessière, C., Coletta, R., Petit, T.: Acquiring parameters of implied global constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 747–751. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Bessière, C., Coletta, R., Petit, T.: Learning implied global constraints. In: Veloso (ed.) [23], pp. 44–49

    Google Scholar 

  11. Carlsson, M., Beldiceanu, N., Martin, J.: A geometric constraint over k-dimensional objects and shapes subject to business rules. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 220–234. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Carlsson, M., et al.: SICStus Prolog User’s Manual. Swedish Institute of Computer Science, release 4 edn. (2007) ISBN 91-630-3648-7

    Google Scholar 

  13. Charnley, J., Colton, S., Miguel, I.: Automatic generation of implied constraints. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) ECAI. Frontiers in Artificial Intelligence and Applications, vol. 141, pp. 73–77. IOS Press, Amsterdam (2006)

    Google Scholar 

  14. Coletta, R., Bessière, C., O’Sullivan, B., Freuder, E.C., O’Connell, S., Quinqueton, J.: Semi-automatic modeling by constraint acquisition. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 812–816. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Hebrard, E., Marx, D., O’Sullivan, B., Razgon, I.: Constraints of difference and equality: A complete taxonomic characterisation. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 424–438. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  16. O’Connell, S., O’Sullivan, B., Freuder, E.C.: Timid acquisition of constraint satisfaction problems. In: Haddad, H., Liebrock, L.M., Omicini, A., Wainwright, R.L. (eds.) SAC, pp. 404–408. ACM, New York (2005)

    Google Scholar 

  17. O’Sullivan, B.: Automated modelling and solving in constraint programming. In: AAAI. AAAI Press, Menlo Park (2010)

    Google Scholar 

  18. Quinqueton, J., Raymond, G., Bessiere, C.: An agent for constraint acquisition and emergence. In: Negru, V., Jebelean, T., Petcu, D., Zaharie, D. (eds.) SYNASC, pp. 229–234. IEEE Computer Society, Los Alamitos (2007)

    Google Scholar 

  19. Rossi, F., Sperduti, A.: Acquiring both constraint and solution preferences in interactive constraint systems. Constraints 9(4), 311–332 (2004)

    Article  Google Scholar 

  20. Shchekotykhin, K.M., Friedrich, G.: Argumentation based constraint acquisition. In: Wang, W., Kargupta, H., Ranka, S., Yu, P.S., Wu, X. (eds.) ICDM, pp. 476–482. IEEE Computer Society, Los Alamitos (2009)

    Google Scholar 

  21. Simonis, H.: Building industrial applications with constraint programming. In: Comon, H., Marché, C., Treinen, R. (eds.) CCL 1999. LNCS, vol. 2002, pp. 271–309. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  22. Sloane, N.J.A., Plouffe, S.: The Encyclopedia of Integer Sequences. Academic Press, San Diego (1995)

    MATH  Google Scholar 

  23. Veloso, M.M. (ed.): Proceedings of the 20th International Joint Conference on Artificial Intelligence, IJCAI 2007, Hyderabad, India, January 6-12 (2007)

    Google Scholar 

  24. Vu, X., O’Sullivan, B.: Generalized constraint acquisition. In: Miguel, I., Ruml, W. (eds.) SARA 2007. LNCS (LNAI), vol. 4612, pp. 411–412. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  25. Wallace, M. (ed.): CP 2004. LNCS, vol. 3258. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  26. Weis, P., Leroy, X.: Le langage Caml. InterEditions (1993) (in French)

    Google Scholar 

  27. Zanarini, A., Pesant, G.: Solution counting algorithms for constraint-centered search heuristics. Constraints 14(3), 392–413 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. TASC team (INRIA/CNRS), Mines de Nantes, France

    Nicolas Beldiceanu

  2. Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Ireland

    Helmut Simonis

Authors
  1. Nicolas Beldiceanu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Helmut Simonis
    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

Beldiceanu, N., Simonis, H. (2011). A Constraint Seeker: Finding and Ranking Global Constraints from Examples. 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_4

Download citation

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

  • 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

Search

Navigation