Skip to main content

Constraint Programming Next Challenge: Simplicity of Use

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

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3258))

Abstract

Constraint Programming (CP) is a healthy research area in the academic community. The growing number of participants to the CP conference series, as well as the number of workshops around CP is a good evidence of it. Many major conferences have a CP track, both in artificial intelligence, and in operations research. The existence of several commercial companies that offer CP tools and services is a further evidence of the value of CP as an industrial technology. ILOG is one of such companies. One of our uniqueness, as far as CP is concerned, is that the research and development team that produces our CP products is also responsible for the development of our mathematical programming (MP) tool, namely ILOG CPLEX. This provides a unique opportunity to contrast the way these products are developed, marketed and used.

In this paper we argue that current CP technology is much too complex to use for the average engineer. Worse, we believe that much of the research occurring in the CP academic community makes this even worse every year. The rest of the paper provides evidence for this claim, and suggests ways to address the issue of simplicity of use by looking at how a similar issue has been addressed in the mathematical programming community.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
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. http://www.ampl.com/

  2. Krzysztof Apt Principles of Constraint Programming, Cambridge University Press, Cambridge (2003)

    Google Scholar 

  3. Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer, Dordrecht (2001)

    MATH  Google Scholar 

  4. Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)

    Google Scholar 

  5. http://www.gams.com/

  6. http://www.ilog.com/

  7. Fruehwirth, T., Abdennadher, S.: Essentials of Constraint Programming. Springer, Heidelberg (2003)

    Google Scholar 

  8. Lustig, I., Puget, J.-F.: Program Does Not Equal Program: Constraint Programming and its Relationship to Mathematical Programming. Interfaces 31(6), 29–53

    Google Scholar 

  9. Marriott, K., Stuckey, P.J.: Programming with Constraints: an Introduction. MIT Press, Cambridge (1998)

    MATH  Google Scholar 

  10. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)

    Google Scholar 

  11. Van Hentenryck, P.: with contributions by Irvin Lustig, Laurent Michel, and Jean-François Puget The OPL Optimization Programming Language, MIT Press (1999)

    Google Scholar 

  12. Wallace, M.: Languages versus Packages for Constraint Problem Solving. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 37–52. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Williams, H.P.: Model Building in Mathematical Programming, 4th edn. Wiley, Chichester (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Puget, JF. (2004). Constraint Programming Next Challenge: Simplicity of Use. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30201-8_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23241-4

  • Online ISBN: 978-3-540-30201-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics