Skip to main content
SpringerLink
Log in

From Prolog III to Prolog IV: The Logic of Constraint Programming Revisited

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

Constraint programming languages stem from the integration of constraints in conditional rules. By taking a close look at the design choices made for Prolog IV, the author retraces the general evolution of this recent and novel paradigm, from its roots in inference systems and optimization, to its applications in model building and problem solving.

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. N. Beldiceanu and E. Contejean (1994). Introducing global constraints in CHIP. Mathl. Comput. Modelling 20(12): 97–123.

    Google Scholar 

  2. F. Benhamou and Touraïvane (1995). Prolog IV: langage et algorithmes. In Proc. of JFPL 95, Dijon.

  3. H. Beringer and B. De Backer (1995). Combinatorial problem solving in constraint logic programming with cooperating solvers. In C. Beierle and L. Plümer, editors, Logic Programming: Formal Methods and Practical Applications, pages 245–272. Elsevier.

  4. C. Bisiére (1995). SD-solver: towards a "multidirectional" CLP-based simulation tool. Computation Economics.

  5. N. Bleuzen Guernalec and A. Colmerauer (1997). Narrowing a 2n-block of sortings in O(n log n). In Proc.of CP'97. Schloss Hagenberg.

  6. J. G. Cleary (1987). Logical arithmetic. Future Generation Computing Systems 2(2): 125–149.

    Google Scholar 

  7. A. Colmerauer (1985). Prolog in 10 figures. Communications of the ACM 28(12): 1296–1310.

    Google Scholar 

  8. A. Colmerauer (1990). An introduction to Prolog III. Communications of the ACM 33(7): 69–90.

    Google Scholar 

  9. A. Colmerauer (1993). Naive solving of non-linear constraints. In F. Benhamou and A. Colmerauer, editors, Constraint Logic Programming: Selected Research, pages 89–112. The MIP Press.

  10. A. Colmerauer (1996). Les bases de Prolog IV. In Le Manuel de Prolog IV, PrologIA.

  11. J.-Y. Cras (1993). A review of industrial constraint solving tools. AI Intelligence.

  12. M. Dincbas, et al. (1988). The constraint logic programming language CHIP. In Proc. of FGCS'88, Tokyo.

  13. P.-J. Gailly, et al. (1992). The Prince project and its applications. In G. Comyn, N. E. Fuchs, and M. J. Ratcliffe, editors, Logic Programming in Action, Proc. of LPSS'92, LNCS 636, pages 54–63. Springer Verlag.

  14. IEEE (1985). IEEE standard for binary floating-point arithmetic. Technical Report 754, ANSI.

  15. J. Jaffar and J.-L. Lassez (1987). Constraint logic programming. In Proc. of ACM Symposium on the Principles of Programming Languages, pages 111–119, Munich.

  16. J. Jaffar and M. Maher (1994). Constraint logic programming: A survey. Jounal of Logic Programming 19–20: 503–581.

    Google Scholar 

  17. R. A. Kowalski (1979). Algorithm D Logic C Control. Communications of the ACM 22: 424–431.

    Google Scholar 

  18. J.-L. Lauriére (1978). A language and a program for stating and solving combinatorial problems. Artificial Intelligence 10: 29–127.

    Google Scholar 

  19. M.-A. Manier, C. Varnier and P. Baptiste (1994). A multi-hoist scheduling problem approach. In Proc. of the 4th Int. Workshop on Project Management and Scheduling, pages 110–115, Leuven.

  20. K. McAloon and C. Tretkoff (1996). Optimization and Computational Logic. Wiley-Interscience.

  21. G. A. Narboni (1992). About Gaussian elimination and infinite precision. 2nd Int. Workshop on Constraint Logic Programming, Marseille.

  22. S. N'Dong and M. Van Caneghem (1996). Global behaviour of complex constraints. In Proc. of CP'96, Boston.

  23. G. L. Nemhauser and L. A. Wolsey (1988). Integer and Combinatorial Optimization. Wiley-Interscience.

  24. W. Older and A. Vellino (1993). Constraint arithmetic on real intervals. In F. Benhamou and A. Colmerauer, editors, Constraint Logic Programming: Selected Research, pages 175–195. The MIP Press.

  25. R. Skuppin and T. Bückle (1994). Estimating Gyro Errors by Solving an Ordinary Differential Equation Boundary Value Problem. Technical report F3-94-036, Daimler-Benz Research Center, Ulm.

    Google Scholar 

  26. P. Van Hentenryck (1989). Constraint Satisfaction in Logic Programming. The MIP Press.

  27. P. Van Hentenryck, L. Michel, and Y. Deville (1997). Numerica, a Modeling Language for Global Optimization.The MIT Press.

Download references

Author information

Authors and Affiliations

  1. Implexe – Operational Intelligence for Industry, Marseille, France

    Guy A. Narboni

Authors
  1. Guy A. Narboni
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Narboni, G.A. From Prolog III to Prolog IV: The Logic of Constraint Programming Revisited. Constraints 4, 313–335 (1999). https://doi.org/10.1023/A:1009816922431

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009816922431

Search

Navigation