Skip to main content
SpringerLink
Log in

Constraint Logic Programming

  • Chapter
  • First Online:
Computational Logic: Logic Programming and Beyond

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2407))

Abstract

Constraint Logic Programming (CLP) extends logic programming in two ways. Firstly it admits special predicates called constraints, which are not defined by clauses, but which are handled instead by specific constraint solvers built into the CLP system. This extension has been formalised as the CLP Scheme. Secondly CLP admits other forms of processing than backwards reasoning by unfolding, in particular constraint propagation. This extension has been formalised in terms of Information Systems. These two extensions are now widely applied in industry, in particular to large scale combinatorial optimisation problems. The success of CLP has inspired a great deal of ongoing research into algorithms (especially hybrid and incremental), languages and applications.

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. S. Abdennadher and H. Schlenker. INTERDIP-an interactive constraint based nurse scheduler. In PACLP’99. The Practical Applications Company, April 1999.

    Google Scholar 

  2. Abderrahmane Aggoun and Nicolas Beldiceanu. Extending CHIP in order to solve complex scheduling and placement problems. Journal of Mathematical and Computer Modelling, 17(7):57–73, 1993.

    Article  Google Scholar 

  3. http://www.aiai.ed.ac.uk/project/statements/sched.html.

  4. L. H. Appelgren. A column generation algorithm for a ship scheduling problem. Transportation Science, 3:53–68, 1969.

    Article  Google Scholar 

  5. Krzysztof Apt. The essence of constraint propagation. TCS: Theoretical Computer Science, 221, 1999.

    Google Scholar 

  6. Greg J. Badros, Alan Borning, Kim Marriott, and Peter Stuckey. Constraint cascading style sheets for the web. In Proceedings of the 12th Annual ACM Symposium on User Interface Software and Technology, pages 73–82, N.Y., November 7–10 1999. ACM Press.

    Google Scholar 

  7. P. Baptiste and C. Le Pape. A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling. In C. Mellish, editor, Proc. IJCAI, volume 1, pages 600–606, 1995.

    Google Scholar 

  8. N. Beldiceanu. New global constraints in chip. Presented at the CHIP Users’ Club 95, 1995.

    Google Scholar 

  9. N. Beldiceanu. Global constraints as graph properties on a structured network of elementary constraints of the same type. In R. Dechter, editor, Proc. Conf. on Principles and Practice of Constraint Programming, CP’2000, volume 1894 of Lecture Notes in Computer Science, pages 52–66. Springer Verlag, 2000.

    Google Scholar 

  10. N. Beldiceanu and E. Contjean. Introducing global constraints in CHIP. Mathematical and Computer Modelling, 12:97–123, 1994. citeseer.nj.nec.com/beldiceanu94introducing.html.

    Article  Google Scholar 

  11. P. Boizumault, P. David, and H. Djellab. A repair algorithm for allocating resources in a mobile telephone network. In PACLP’99. The Practical Applications Company, April 1999.

    Google Scholar 

  12. Alex Brodsky. Constraint databases: promising technology or just intellectual exercise? CSURVES: Computing Surveys Electronic Section, 28, 1996.

    Google Scholar 

  13. Y. Caseau and F. Laburthe. Heuristics for large constrained vehicle routing problems. Journal of Heuristics, 5(3):281–303, 1999.

    Article  MATH  Google Scholar 

  14. Yves Caseau and Francois Laburthe. Improved clp scheduling with task intervals. In P. Van Hentenryck, editor, Proceedings of the 11th International Conference on Logic Programming, Santa Margherita, 1994. MIT Press.

    Google Scholar 

  15. http://www.icparc.ic.ac.uk/chic2/chic2_methodology/index.html.

  16. K. L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293–322. Plenum Press, 1978.

    Google Scholar 

  17. A. Colmerauer. Equations and Inequations on Finite and Infinite Trees. In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS-84), pages 85–99, Tokyo, Japan, November 1984. ICOT.

    Google Scholar 

  18. M.-M. Corsini, K. Musumbu, A. Rauzy, and B. L. Charlier. Efficient bottom-up abstract interpretation of Prolog by means of constraint solving over symbolic finite domains. Lecture Notes in Computer Science, 714, 1993.

    Google Scholar 

  19. http://www.cosytec.fr/.

  20. J. de Kleer. A comparison of ATMS and CSP techniques. In Proc. 11th International Joint Conference on Artificial Intelligence, IJCAI’89, 1989.

    Google Scholar 

  21. M. Dincbas and H. Simonis. APACHE-a constraint-based, automated stand allocation system. In Proc. of Advanced Software Technology in Air Transport (ASTAIR’91, 1991.

    Google Scholar 

  22. M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier. The constraint logic programming language CHIP. In Proceedings Intl. Conf. on Fifth Generation Computer Systems, Tokyo, Japan, Dec 1988, pages 693–702. Ohmsha Publishers, Tokyo, 1988.

    Google Scholar 

  23. T. Filkhorn, H.-A. Schneider, A. Scholz, A. Strasser, and P. Warkentin. SVE system verification environment. Technical Report SVE, ZFE BT SE Siemens AG, 1995.

    Google Scholar 

  24. M. Fisher. An applications oriented guide to lagrangian relaxation, 1985.

    Google Scholar 

  25. F. Focacci, A. Lodi, and M. Milano. Embedding relaxations in global constraints for solving TSP and its time constrained variant. Annals of Mathematics and Artificial Intelligence, Special issue on Large Scale Combinatorial Optimization, 2001. To appear.

    Google Scholar 

  26. E.C. Freuder. Synthesizing constraint expressions. Communications of the ACM, 21:958–966, November 1978.

    Google Scholar 

  27. M. P. J. Fromherz, V. A. Saraswat, and D. G. Bobrow. Model-based computing: Developing flexible machine control software. Artificial Intelligence, 114(1–2):157–202, 1999.

    Article  MATH  Google Scholar 

  28. T. Fruhwirth. Theory and practice of constraint handling rules, 1998.

    Google Scholar 

  29. V. Gaede, A. Brodsky, O. Guenther, D. Srivastava, V. Vianu, and M. G. Wallace. Constraint Databases and Applications. Number 1191 in LNCS. Springer Verlag, 1998.

    Google Scholar 

  30. Carmen Gervet and Mark Wallace. Third international workshop on integration of AI and OR techniques in constraint programming for combinatorial optimization problems. Programme and papers presented at CPAIOR’01: http://www. icparc.ic.ac.uk/cpAIOR01/, 2001.

  31. Matt Ginsberg. Dynamic backtracking. Technical report, 1992. http://citeseer.nj.nec.com/ginsberg96dynamic.html.

  32. Weiqing He and Kim Marriott. Constrained graph layout. Constraints, 3(4), 1998.

    Google Scholar 

  33. P. Van Hentenryck, Y. Deville, and C.-M. Teng. A generic arc-consistency algorithm and its specializations. Artificial Intelligence, 57(2–3): 291–321, October 1992.

    Google Scholar 

  34. http://www.i2.com.

  35. http://www.ifcomputer.de/consulting/home.html.

  36. ILOG. CPLEX. http://www.ilog.com/products/cplex/, 2001.

  37. J. Jaffar and J.-L. Lassez. Constraint logic programming. In ACM, editor, POPL’ 87. Fourteenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of programming languages, January 21–23, 1987, Munich, W. Germany, pages 111–119, New York, NY, USA, 1987. ACM Press.

    Google Scholar 

  38. J. Jaffar, S. Michaylov, P. J. Stuckey, and R. H. C. Yap. The CLP(R) language and system. ACM Trans. Prog. Lang. and Sys., 14(3), July 1992.

    Google Scholar 

  39. Joxan Jaffar and Michael J. Maher. Constraint logic programming: A survey. The Journal of Logic Programming, 19 & 20:503–582, May 1994.

    Google Scholar 

  40. U. Junker, S. E. Karisch, N. Kohl, B. Vaaben, T. Fahle, and M. Sellmann. A framework for constraint programming based column generation. In Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming-LNCS 1713, pages 261–274. Springer-Verlag, 1999.

    Google Scholar 

  41. Bob Kowalski. Logic for Problem Solving. North Holland, 1979.

    Google Scholar 

  42. R. Kowalski, F. Toni, and G. Wetzel. Executing suspended logic programs. FUND-INF: Fundamenta Informatica, 34, 1998.

    Google Scholar 

  43. G. Kuper, L. Libkin, and J. Paradeans. Constraint Databases. Springer Verlag, 2000.

    Google Scholar 

  44. F. Laburthe and Y. Caseau. SALSA: A language for search algorithms. Lecture Notes in Computer Science, 1520, 1998.

    Google Scholar 

  45. C. Le Pape and P. Baptiste. Resource constraints for preemptive job-shop scheduling. Constraints, 3(4):263–287, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  46. Claude Le Pape and Mark Wallace. From constraint programming to hybrid problem-solving algorithms. Tutorial at CP98, Pisa. http://www.icparc.ic.ac.uk/~mgw/cp98_Tutorial.ppt, 1998.

  47. Thierry Le Provost and Mark Wallace. Generalized constraint propagation over the CLP scheme. Journal of Logic Programming, 16(3–4):319–359, August 1993.

    Google Scholar 

  48. V. Liatsos and E. B. Richards. Scaleability in planning. In Proceedings of the 5th European Conference on Planning, Durham, UK, September 1999.

    Google Scholar 

  49. A.K. Mackworth. Consistency in network of relations. Artificial Intelligence, 8(1):99–118, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  50. A.K. Mackworth and E.C. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence, 25:65–74, 1985.

    Article  Google Scholar 

  51. L. Michel and P. Van Hentenryck. Localizer: A modeling language for local search. Lecture Notes in Computer Science, 1330, 1997.

    Google Scholar 

  52. M. Milano, G. Ottosson, P. Refalo, and E. Thorsteinsson. Global constraints: When constraint programming meets operations research. Under Submission, 2001.

    Google Scholar 

  53. R. Mohr and T.C. Henderson. Arc and path consistency revisited. Artificial Intelligence, 28:225–233, 1986.

    Article  Google Scholar 

  54. U. Montanari. Networks of constraints: fundamental properties and applications to picture processing. Information Science, 7(2):95–132, 1974.

    Article  MathSciNet  Google Scholar 

  55. Dash Optimization. XPRESS-MP. http://www.dash.co.uk/, 2001.

  56. http://www.practical-applications.co.uk/paclp2000/index.html.

  57. http://www.pdc.dk/.

  58. Gilles Pesant and Michel Gendreau. A view of local search in constraint programming. In Principles and Practice of Constraint Programming, pages 353–366, 1996. http://citeseer.nj.nec.com/pesant96view.html.

  59. http://prologianet. univ-mrs. fr/us/domaines. htm.

  60. http://www.parc-technologies.com.

  61. J.-C. Regin. A filtering algorithm for constraints of difference in CSPs. In Proc. 12th Conf. American Assoc. Artificial Intelligence, volume 1, pages 362–367. Amer. Assoc. Artificial Intelligence, 1994.

    Google Scholar 

  62. E. Thomas Richards and Barry Richards. Nonsystematic search and no-good learning. Journal of Automated Reasoning, 24(4):483–533, 2000. http://citeseer.nj.nec.com/431873.html.

    Article  MATH  MathSciNet  Google Scholar 

  63. R. Rodosek, M. G. Wallace, and M. T. Hajian. A new approach to integrating mixed integer programming and constraint logic programming. Annals of Operations Research, 86:63–87, 1999. Special issue on Advances in Combinatorial Optimization.

    Article  MATH  MathSciNet  Google Scholar 

  64. H. El Sakkout, T. Richards, and M. G. Wallace. Minimal perturbance in dynamic scheduling. In Henri Prade, editor, Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), pages 504–508, Chichester, August 23–28 1998. John Wiley & Sons.

    Google Scholar 

  65. Hani El Sakkout and Mark Wallace. Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints, 5(4):359–388, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  66. V. Saraswat, Rinard M., and P. Panangaden. Semantic foundations of concurrent constraint programming. In Proc. 18th ACM POPL, Jan 1991.

    Google Scholar 

  67. Vijay A. Saraswat, Martin Rinard, and Prakash Panangaden. Semantic foundations of concurrent constraint programming. In Conf. Record 18th Annual ACM Symp. on Principles of Programming Languages, Orlando, FL, USA, 1991, pages 333–52. 1990.

    Google Scholar 

  68. Joachim Schimpf and Mark Wallace. Finding the right algorithm-a combinatorial meta-problem. Electronic Notes in Discrete Mathematics, 4:80–92, 1999.

    Google Scholar 

  69. M. Sellmann and T. Fahle. Cp-based lagrangian relaxation for a multimedia application. Programme and papers presented at CPAIOR’01: http://www.icparc.ic.ac.uk/cpAIOR01/, 2001.

  70. E. Shapiro. The family of concurrent logic programming languages. ACM Computing Surveys, 21(3), 1989.

    Google Scholar 

  71. Paul Shaw. Using constraint programming and local search methods to solve vehicle routing problems. In Principles and Practice of Constraint Programming, pages 417–431, 1998. http://citeseer.nj.nec.com/shaw98using.html.

  72. http://www.sics.se/isl/decs/.

  73. H. Simonis. Application development with the CHIP system. In Gabriel Kuper and Mark Wallace, editors, Proc. 1st Int. Database Workshop on Constraint Database Systems (CDB’95), pages 1–21, Friedrichshafen, Germany, 1995. LNCS No. 1034.

    Google Scholar 

  74. H. Simonis. More standard constraint models. Tutorial presented at PAPACT98, 1998.

    Google Scholar 

  75. Peter J. Stuckey. Constraint search trees. In Lee Naish, editor, Proceedings of the 14th International Conference on Logic Programming, pages 301–315, Cambridge, July 8–11 1997. MIT Press.

    Google Scholar 

  76. A. V. Moura T. H. Yunes and C. C. de Souza. A hybrid approach for solving large scale crew scheduling problems. In Proceedings of the Second International Workshop on Practical Asp ects of Declarative Languages (PADL’00), pages 293–307, Boston, MA, USA, 2000.

    Google Scholar 

  77. http://www.temposoft.fr.

  78. P. Van Hentenryck, H. Simonis, and M. Dincbas. Constraint satisfaction using constraint logic programming. Artificial Intelligence, 58, 1992.

    Google Scholar 

  79. Pascal Van Hentenryck. The OPL Optimization Programming Language. The MIT Press, 1999.

    Google Scholar 

  80. M. G. Wallace, S. Novello, and J. Schimpf. Eclipse-a platform for constraint programming. ICL Systems Journal, 12(1):159–200, 1997. http://www.icparc.ic.ac.uk/eclipse/.

    Google Scholar 

  81. Mark Wallace. Practical applications of constraint programming. Constraints Journal, 1(1), 1996.

    Google Scholar 

  82. D. Waltz. Generating semantic descriptions from drawings of scenes with shadows. Technical Report AI271, MIT, Massachusetts, November 1972.

    Google Scholar 

  83. Makoto Yokoo. Weak-commitment search for solving constraint satisfaction problems. In AAAI, Vol. 1, pages 313–318, 1994.

    Google Scholar 

  84. Tallys H. Yunes, Arnaldo V. Moura, and Cid C. de Souza. A hybrid approach for solving large scale crew scheduling problems. In Proc. 2nd International Workshop on Practical Aspects of Declarative Languages (PADL’ 00). Springer Verlag, January 17–18 2000. LNCS 1753.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IC-Parc, William Penney Laboratory, Imperial College, London, SW7 2AZ

    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. Department of Computer Science, University of Cyprus, 75 Kallipoleos St., 1678, Nicosia, Cyprus

    Antonis C. Kakas

  2. Department of Computing, Imperial College of Science, Technology and Medicine, 180 Queen’s Gate, London, SW7 2BZ, UK

    Fariba Sadri

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Wallace, M. (2002). Constraint Logic Programming. In: Kakas, A.C., Sadri, F. (eds) Computational Logic: Logic Programming and Beyond. Lecture Notes in Computer Science(), vol 2407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45628-7_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-45628-7_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43959-2

  • Online ISBN: 978-3-540-45628-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation