Skip to main content
SpringerLink
Log in

Languages versus Packages for Constraint Problem Solving

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

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

Abstract

One strand of CP research seeks to design a small set of primitives and operators that can be used to build an appropriate algorithm for solving any given combinatorial problem. The aim is to “package” CP, simplifying its use, in contrast to current systems which offer application developers a full constraint programming language. In this talk we examine the risks of this line of research, and argue that our field is still too immature to be ready for “packaging”.

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 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. Cycorp: A finite domain constraint solver optimized to work with opencyc (2002), For Cyc see www.opencyc.org and for the package see org.opencyc.constraintsolver

  2. Møller, J., Andersen, H., Hulgaard, H.: Product configuration over the internet, citeseer.nj.nec.com/531891.html

  3. Jaffar, J., Lassez, J.L.: Constraint logic programming. In: Proceedings of the 14th ACM POPL Symposium, Munich, West Germany (1987)

    Google Scholar 

  4. ILOG: CPLEX (2002), http://www.ilog.com/products/cplex/

  5. Dash: Xpress-MP (2003), http://www.dashoptimization.com/products.html

  6. GAMS: GAMS: The general algebraic modeling system, Online documentation at http://www.gams.com

  7. Paragon Decision Technology B.V.: AIMMS: Advanced integrated multidimensional modeling software ,Online documentation at http://www.aimms.com

  8. Software, M.: MPL: Mathematical programming language, Online documentations at http://www.maximal-usa.com/mpl/

  9. Savelsbergh, M.: MINTO - Mixed INTeger Optimizer, Online documentations at http://www.isye.gatech.edu/faculty/Martin_Savelsbergh/software/

  10. Mittelmann, H.: Benchmarks for optimization software (2003), http://plato.la.asu.edu/bench.html

  11. Bockmayr, A.: MIP model for the coins problem. Personal Communication (1997)

    Google Scholar 

  12. Cheadle, A., Harvey, W., Sadler, A., Schimpf, J., Shen, K., Wallace, M.: ECLiPSe: an introduction (2003), http://www.icparc.ic.ac.uk/eclipse/reports/icparc-03-1.pdf

  13. Glover, F.: OptQuest: The optimization process , http://www.decisioneering.com/spotlight/spotlight14d.html

  14. Abramson, D.: Nimrod/O: A software environment for building high performance optimising decision support systems from computational models, http://www.csse.monash.edu.au/~davida/nimrodo/

  15. Smith, B.M., Brailsford, S., Hubbard, P., Williams, H.P.: The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared. In: CP 1995: Proceedings 1st International Conference on Principles and Practice of Constraint Programming, Marseilles (1995)

    Google Scholar 

  16. Moscato, P.: TSPBIB home page (2000), http://www.densis.fee.unicamp.br/~moscato/TSPBIB_home.html

  17. Kalvelagen, E.: On solving the progressive party problem as a MIP. Technical report, GAMS Development Corp., Washington DC (2002), http://www.gams.com/~erwin/ppp.pdf

  18. Nadel, B.: 9. Symbolic Computation. In: Tree Search and Arc Consistency in Constraint Satisfaction Algorithms. Springer (1988)

    Google Scholar 

  19. Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14, 263–313 (1980)

    Article  Google Scholar 

  20. Bouthoorn, P.: AISearch, http://sal.kachinatech.com/Z/3/AISEARCH.html

  21. Hulubei, T.: The csp library, http://www.hulubei.net/tudor/csp/index.html

  22. Russell, S., Norvig, P.: CSP problems and solvers, http://aima.cs.berkeley.edu/python/csp.html#CSP

  23. de Givry, S.: VCSP, http://www.inra.fr/bia/ftp/T/VCSP/docs/vcsp.txt

  24. Kask, K., Dechter, R.: A general scheme for automatic generation of search heuristics from specification dependencies. Artificial Intelligence 129, 91–131 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  25. Larrosa, J., Meseguer, P.: Generic CSP techniques for the job-shop problem. In: Mira, J., Moonis, A., de Pobil, A.P. (eds.) IEA/AIE 1998. LNCS, vol. 1416, pp. 46–55. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  26. Minton, S.: Automatically configuring constraint satisfaction problems: A case study. Constraints 1, 7–44 (1996)

    Article  MathSciNet  Google Scholar 

  27. Savelsbergh, M.: Branch-and-price: Integer programming with column generation (2002), http://www.isye.gatech.edu/faculty/Martin_Savelsbergh/publications/eoo.pdf

  28. Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: Proc. IJCAI 1995, vol. 1, pp. 607–615 (1995)

    Google Scholar 

  29. Caseau, Y., Laburthe, F., Silverstein, G.: A meta-heuristic factory for vehicle routing problems. In: Proc. Principles and Practice of Constraint Programming, pp. 144–158 (1999)

    Google Scholar 

  30. Freuder, E., Wallace, R.: Partial constraint satisfaction. Artificial Intelligence 58 (1992)

    Google Scholar 

  31. Selman, B., Levesque, H.J., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceedings of the Tenth National Conference on Artificial Intelligence, pp. 440–446. AAAI Press, Menlo Park (1992)

    Google Scholar 

  32. Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58 (1992)

    Google Scholar 

  33. Michel, L., Van Hentenryck, P.: Localizer. Constraints 5, 41–82 (2000)

    Article  Google Scholar 

  34. El Sakkout, H., Wallace, M.: Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints 5, 359–388 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  35. Laburthe, F., Caseau, Y.: SALSA: A language for search algorithms. Constraints 7, 255–288 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  36. de Givry, S., Jeannin, L.: ToOLS: A library for partial and hybrid search methods. Presented at CPAIOR 2003 Montreal (2003), http://www.crt.umontreal.ca/cpaior/article-degivry.pdf

  37. Wallace, M.G.: Search in AI - escaping from the CSP straightjacket. In: Proc. 14th European Conference on Artificial Intelligence, pp. 770–776. IOS Press, Amsterdam (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IC-Parc, Imperial College London, UK

    Mark Wallace

Authors
  1. Mark Wallace
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Matematica Pura ed Applicata, Università di Padova, Via Trieste 63, 35121, Padova, Italy

    Francesca Rossi

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wallace, M. (2003). Languages versus Packages for Constraint Problem Solving. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45193-8_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20202-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation