Skip to main content
SpringerLink
Log in

Toward sustainable development in constraint programming

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

We present a few challenges that we consider important to tackle for the future of constraint programming. The focus is put on simplifying the design and implementation of propagators in solvers.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abdennadher, S., & Rigotti, C. (2005). Automatic generation of CHR constraint solvers. Theory and Practice of Logic Programming, 5(4), 403–418.

    Article  MATH  Google Scholar 

  2. Beldiceanu, N., Carlsson, M., Petit, T. (2004). Deriving filtering algorithms from constraint checkers. In M.G. Wallace (Ed.), CP 2004. LNCS (Vol. 3258, pp. 107–122). Springer.

  3. Beldiceanu, N., Carlsson, M., Petit, T., Régin, J.C. (2012). An O(nlogn) bound consistency algorithm for the conjunction of an alldifferent and an inequality between a sum of variables and a constant, and its generalization. In L.D. Raedt, C. Bessière, D. Dubois, P. Doherty, P. Frasconi, F. Heintz, P.J.F. Lucas (Eds.), ECAI 2012 (pp. 145–150). IOS Press.

  4. Beldiceanu, N., Carlsson, M., Poder, E., Sadek, R., Truchet, C. (2007). A generic geometrical constraint kernel in space and time for handling polymorphic k-dimensional objects. In C. Bessière (Ed.), CP 2007. LNCS (Vol. 4741, pp. 180–194). Springer.

  5. Beldiceanu, N., Carlsson, M., Rampon, J.X. (2012). Global constraint catalog 2nd edn. (revision a). Tech. Rep. T2012:03, Swedish Institute of Computer Science. Available at http://soda.swedish-ict.se/5195.

  6. Beldiceanu, N., Petit, T., Rochart, G. (2006). Bounds of parameters for global constraints. RAIRO Operations Research, 40(4), 327–353.

    Article  MATH  MathSciNet  Google Scholar 

  7. Beldiceanu, N., & Simonis, H. (2011). A constraint seeker: Finding and ranking global constraints from examples. In J.H.M. Lee (Ed.), CP 2011. LNCS (Vol. 6876, pp. 12–26). Springer.

  8. Berger, M. (2010). Geometry revealed, a Jacob’s ladder to modern higher geometry. Springer.

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

  10. Colmerauer, A. (1996). Les bases de Prolog IV. Internal publication of the Laboratoire d’Informatique de Marseille, France. Available at http://alain.colmerauer.free.fr/.

  11. Dao, T.B.H., Lallouet, A., Legtchenko, A., Martin, L. (2002). Indexical-based solver learning. In P. Van Hentenryck (Ed.), CP 2002. LNCS (Vol. 2470, pp. 541–555). Springer.

  12. Deransart, P., Hermenegildo, M.V., Maluszynski, J. (Eds.) (2000). Analysis and visualization tools for constraint programming, constraint debugging (DiSCiPl project). LNCS (Vol. 1870). Springer.

  13. Diaz, D., & Codognet, P. (1993). A minimal extension of the WAM for clp(FD). In ICLP 1993 (pp. 774–790). The MIT Press.

  14. Dooms, G., Van Hentenryck, P., Michel, L. (2009). Model-driven visualizations of constraint-based local search. Constraints, 14(3), 294–324.

    Article  MATH  Google Scholar 

  15. de la Higuera, C. (2010). Grammatical inference: Learning automata and grammars. Cambridge University Press.

  16. Jussien, N. (2003). The versatility of using explanations within constraint programming. Habilitation thesis, Université de Nantes, France. Available at http://tel.archives-ouvertes.fr/tel-00293905.

  17. Laurière, J.L. (1978). A language and a program for stating and solving combinatorial problems. Artificial Intelligence, 10(1), 29–127.

    Article  MATH  MathSciNet  Google Scholar 

  18. Letort, A., Beldiceanu, N., Carlsson, M. (2012). A scalable sweep algorithm for the cumulative constraint. In M. Milano (Ed.), CP 2012. LNCS (Vol. 7514, pp. 439–454). Springer.

  19. Lustig, I.J., & Puget, J.F. (2001). Program does not equal program: constraint programming and its relationship to mathematical programming. Interfaces, 31(6), 29–53.

    Article  Google Scholar 

  20. Mehta, D., O’Sullivan, B., Simonis, H. (2012). Comparing solution methods for the machine reassignment problem. In M. Milano (Ed.), CP 2012. LNCS (Vol. 7514, pp. 782–797).

  21. Monette, J.N., Beldiceanu, N., Flener, P., Pearson, J. (2013). A parametric propagator for discretely convex pairs of sum constraints. In C. Schulte (Ed.), CP 2013. LNCS (Vol. 8124, pp. 529–544). Springer.

  22. Monette, J.N., Flener, P., Pearson, J. (2012). Towards solver-independent propagators. In M. Milano (Ed.), CP 2012. LNCS (Vol. 7514, pp. 544–560). Springer.

  23. Oncina, J., & Garcia, P. (1992). Identifying regular languages in polynomial time. In Advances in structural and syntactic pattern recognition (Vol. 5, pp. 99–108).

  24. O’Sullivan, B. (2011). CP panel position – The future of CP. Available at http://www.dmi.unipg.it/cp2011/downloads/slides/panel/osullivan.pdf.

  25. Pesant, G. (2004). A regular language membership constraint for finite sequences of variables. In M.G. Wallace (Ed.), CP 2004. LNCS (Vol. 3258, pp. 482–495). Springer.

  26. Petit, T., Beldiceanu, N., Lorca, X. (2011). A generalized arc-consistency algorithm for a class of counting constraints. In IJCAI 2011 (pp. 643–648). AAAI Press / IJCAI. Revised edition available at http://arxiv.org/abs/1110.4719.

  27. Prosser, P. (2012). Exact algorithms for maximum clique: a computational study. Tech. Rep. 2012-333, Department of Computer Science, Glasgow University, Scotland. Available at http://arxiv.org/abs/1207.4616.

  28. Raiser, F. (2008). Semi-automatic generation of CHR solvers for global constraints. In P.J. Stuckey (Ed.), CP 2008. LNCS (Vol. 5202, pp. 588–592). Springer.

  29. Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In M.J. Maher, J.F. Puget (Eds.), CP 1998. LNCS (Vol. 1520, pp. 417–431). Springer.

  30. Simonis, H., Aggoun, A., Beldiceanu, N., Bourreau, E. (2000). Complex constraint abstraction: Global constraint visualisation. In P. Deransart, M.V. Hermenegildo, J. Maluszynski, (Eds.), Analysis and visualization tools for constraint programming, constraint debugging (DiSCiPl project). LNCS (Vol. 1870, pp. 299–317). Springer.

  31. Simonis, H., Davern, P., Feldman, J., Mehta, D., Quesada, L., Carlsson, M. (2010). A generic visualization platform for CP. In J.H.M. Lee (Ed.), CP 2010. LNCS (Vol. 6308, pp. 460–474). Springer.

  32. Tack, G., Schulte, C., Smolka, G. (2006). Generating propagators for finite set constraints. In F. Benhamou (Ed.), CP 2006. LNCS (Vol. 4204, pp. 575–589). Springer.

  33. Van Hentenryck, P., & Michel, L. (2007). Constraint-based local search. The MIT Press.

  34. Van Hentenryck, P., Saraswat, V., Deville, Y. Design, implementation, and evaluation of the constraint language cc(FD). Tech. Rep. CS-93-02, Brown University, Providence, USA (1993). Based on the unpublished manuscript Constraint Processing in cc(FD), 1991.

Download references

Author information

Authors and Affiliations

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

    Nicolas Beldiceanu

  2. Department of Information Technology, Uppsala University, Box 337, 751 05, Uppsala, Sweden

    Pierre Flener, Jean-Noël Monette & Justin Pearson

  3. 4C, University College Cork, Cork, Ireland

    Helmut Simonis

Authors
  1. Nicolas Beldiceanu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Flener
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jean-Noël Monette
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Justin Pearson
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Helmut Simonis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pierre Flener.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Beldiceanu, N., Flener, P., Monette, JN. et al. Toward sustainable development in constraint programming. Constraints 19, 139–149 (2014). https://doi.org/10.1007/s10601-013-9152-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10601-013-9152-4

Keywords

Search

Navigation