Skip to main content
SpringerLink
Log in

Some Challenges for Constraint Programming

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

We propose a number of challenges for future constraint programming systems, including improvements in implementation technology (using global analysis based optimization and parallelism), debugging facilities, and the extension of the application domain to distributed, global programming. We also briefly discuss how we are exploring techniques to meet these challenges in the context of the development of the CIAO constraint logic programming system.

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.

Similar content being viewed by others

References

  1. J. Almgren, S. Andersson, L. Flood, C. Frisk, H. Nilsson, & J. Sundberg. (1991). Sicstus Prolog Library Manual. Po Box 1263, S-16313 Spanga, Sweden.

  2. F. Bueno, D. Cabeza, M. Hermenegildo, & G. Puebla. (1996). Data–flow Analysis of Standard Prolog Programs. In European Symposium on Programming, number 1058 in LNCS, pp. 108–124, Sweden. Springer-Verlag.

  3. F. Bueno, M. Hermenegildo, U. Montanari, & F. Rossi. (1994). From Eventual to Atomic and Locally Atomic CC Programs: A Concurrent Semantics. In Fourth International Conference on Algebraic and Logic Programming, number 850 in LNCS, pp. 114–132. Springer-Verlag.

  4. J. Chassin & P. Codognet. (1994). Parallel Logic Programming Systems. Computing Surveys26: 295–336.

    Google Scholar 

  5. D. Cabeza & M. Hermenegildo. (1995) Distributed Concurrent Constraint Execution in the CIAOSystem. In Proc.of the 1995 COMPULOG-NET Workshop on Parallelism and Implementation Technologies, Utrecht, NL. U. Utrecht / T.U. Madrid. Available from http://www.clip.dia.fi.upm.es/.

  6. D. Cabeza, M. Hermenegildo, & S. Varma. (1996). The PiLLoW/CIAO Library for INTERNET/WWW Programming using Computational Logic Systems. In Proceedings of the 1st Workshop on Logic Programming Tools for INTERNET Applications, JICSLP”96, Bonn. Text and code available from http://www.clip.dia.fi.upm.es/miscdocs/pillow/pillow.html.

  7. M. Codish, K. Marriott M. Falaschi, & W.Winsborough. (1993). Efficient analysis of concurrent constraint logic programs. In Twentieth International Coll.Automata, Languages and Programming, Lund, Sweden.

    Google Scholar 

  8. M. García de la Banda, M. Hermenegildo, M. Bruynooghe, V. Dumortier, G. Janssens, & W. Simoens. (1996). Global Analysis of Constraint Logic Programs. ACM Transactions on Programming Languages and Systems18: 564–615.

    Google Scholar 

  9. W. Drabent, S. Nadjm-Tehrani, & J. Maluszynski. (1989), Algorithmic debugging with assertions. In H. Abramson and M.H. Rogers, editors, Meta-programming in Logic Programming. MIT Press.

  10. L. Li et al. (1993). APPLAUSE: Applications using the ElipSys parallel CLP system. In Proceedings of the International Conference on Logic Programming, pages 847–848. MIT Press.

  11. European Computer Research Center. (1993). Eclipse User's Guide.

  12. M. García de la Banda, F. Bueno, & M. Hermenegildo. (1996). Towards independent And-Parallelism in CLP. In International Symposium on Programming Language Implementation and Logic Programming, PLILP'96, volume 1140 of LNCS, pages 77–91. Springer Verlag.

    Google Scholar 

  13. M. García de la Banda, M. Hermenegildo, & K. Marriott. (1993). Independence in Constraint Logic Programs. In 1993 International Logic Programming Symposium, pp. 130–146. MIT Press, Cambridge, MA.

    Google Scholar 

  14. M. García de la Banda, K. Marriott, & P. Stuckey. (1995). Efficient Analysis of Constraint Logic Programs with Dynamic Scheduling. In 1995 International Logic Programming Symposium, pp. 417–431, Portland, Oregon. MIT Press, Cambridge, MA.

    Google Scholar 

  15. M. Hermenegildo, F. Bueno, M. García de la Banda, & G. Puebla. (1995). The CIAOMulti-Dialect Compiler and System: An Experimentation Workbench for Future (C)LP Systems. In Proceedings of the ILPS'95 Workshop on Visions for the Future of Logic Programming, Portland, Oregon, USA.

  16. M. Hermenegildo, D. Cabeza, & M. Carro. (1995). Using Attributed Variables in the Implementation of Concurrent and Parallel Logic Programming Systems. In Proc.of the Twelfth International Conference on Logic Programming, pages 631–645. MIT Press.

  17. P. Van Hentenryck. (1989). Constraint Satisfaction in Logic Programming. MIT Press.

  18. P. Van Hentenryck. (1989). Parallel Constraint Satisfaction in Logic Programming. In Sixth International Conference on Logic Programming, pages 165–180, Lisbon, Portugal. MIT Press.

    Google Scholar 

  19. M. Hermenegildo & K. Greene. (1991). The &-Prolog System: Exploiting Independent And-Parallelism. New Generation Computing9: 233–257.

    Google Scholar 

  20. M. Hermenegildo, G. Puebla, K. Marriott, & P. Stuckey. (1995). Incremental Analysis of Logic Programs. In International Conference on Logic Programming, pp. 797–811. MIT Press.

  21. M. Hermenegildo & the CLIP group. (1994). Some Methodological Issues in the Design of CIAO-A Generic, Parallel, Concurrent Constraint System. In Principles and Practice of Constraint Programming, LNCS 874, pp. 123–133. Springer-Verlag.

  22. S. Haridi, P. VanRoy, & G. Smolka. (1996). An Overview of the Design of Distributed Oz. In Proc.of the 1996 JISCLP Workshop on Multi-Paradigm Logic Programming. T.U.Berlin.

  23. S. Janson & S. Haridi. (1991). Programming Paradigms of the Andorra Kernel Language. In 1991 International Logic Programming Symposium, pp. 167–183. MIT Press.

  24. J. Jaffar & M.J. Maher. (1994). Constraint Logic Programming: A Survey. Journal of Logic Programming13/20: 503–581.

    Google Scholar 

  25. A. Kelly, A. Macdonald, K. Marriott, P. Stuckey, & R. Yap. (1996). Effectiveness of optimizing compilation for CLP(R). In Proceedings of Joint International Conference and Symposium on Logic Programming, pages 37–51. MIT Press.

  26. Andy King & Paul Soper. (1992). Schedule Analysis of Concurrent Logic Programs. In Krzysztof Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pp. 478–492, Washington, USA. The MIT Press.

    Google Scholar 

  27. M. J. Maher. (1987). Logic Semantics for a Class of Committed-choice Programs. In Jean-Louis Lassez, editor, Proceedings of the Fourth International Conference on Logic Programming, Series in Logic Programming, pp. 858–876, Melbourne. MIT Press.

    Google Scholar 

  28. M. Meier. (1996). Grace User Manual. Available at http://www.ecrc.de/eclipse/html/grace/grace.html.

  29. K. Marriott M. Falaschi, M. Gabbrielli & C. Palamidessi. (1993). Compositional analysis for concurrent constraint programming. In IEEE Symposium on Logic in Computer Science (LICS), Montreal.

  30. K. Marriott, M. García de la Banda, & M. Hermenegildo. (1994). Analyzing Logic Programs with Dynamic Scheduling. In 20th.Annual ACM Conf.on Principles of Programming Languages, pp. 240–254. ACM.

  31. U. Montanari, F. Rossi, F. Bueno, M. García de la Banda, & M. Hermenegildo. (1994). Towards a Concurrent Semantics based Analysis of CC and CLP. In Principles and Practice of Constraint Programming, LNCS 874, pp. 151–161. Springer-Verlag.

  32. K. Marriott & P. Stuckey. (1992). The 3R's of Optimizing Constraint Logic Programs: Refinement, Removal, and Reordering. In 19th.Annual ACM Conf.on Principles of Programming Languages. ACM.

  33. The practical application of constraint technology conference series. The Practical Application Company, 54 Knowle Avenue, Blackpool, Lancs FY2 9UD, U.K.

  34. P. Van Roy & A.M. Despain. (1992). High-Performace Logic Programming with the Aquarius Prolog Compiler. IEEE Computer Magazine, pp. 54–682.

  35. V. Santos-Costa, D.H.D.Warren, & R.Yang. (1990). Andorra-I:AParallel Prolog System that Transparently Exploits both And-and Or-parallelism. In Proceedings of the 3rd.ACMSIGPLAN Symposium on Principles and Practice of Parallel Programming. ACM.

  36. Gert Smolka. (1995). The Oz programming model. In Jan van Leeuwen, editor, Computer Science Today, Lecture Notes in Computer Science, vol. 1000, pp. 324–343. Springer-Verlag, Berlin.

    Google Scholar 

  37. V. Saraswat, M. Rinard, & P. Panangaden. (1991), Semantic Foundation of Concurrent Constraint Programming. In Proceedings of the 18th.Annual ACM Conf.on Principles of Programming Languages. ACM.

  38. Paul Tarau & Koen De Bosschere. (1996). Virtual World Brokerage with BinProlog and Netscape. In Proceedings of the 1st Workshop on Logic Programming Tools for INTERNET Applications, JICSLP”96, Bonn. Available from http://clement.info.umoncton.ca/~lpnet/lpnet11.html http://clement.info.umoncton.ca/lpnet/lpnet11.html.

  39. Paul Tarau, Andrew Davison, Koen De Bosschere, & Manuel Hermenegildo, editors. (1996). Proceedings of the 1st Workshop on Logic Programming Tools for INTERNET Applications, JICSLP”96, Bonn.

  40. R. Warren, M. Hermenegildo, & S. Debray. (1988). On the Practicality of Global Flow Analysis of Logic Programs. In Fifth International Conference and Symposium on Logic Programming, pp. 684–699, Seattle, Washington. MIT Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Technical University of Madrid (UPM), Spain

    Manuel Hermenegildo

Authors
  1. Manuel Hermenegildo
    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

Hermenegildo, M. Some Challenges for Constraint Programming. Constraints 2, 63–69 (1997). https://doi.org/10.1023/A:1009701123606

Download citation

  • Issue Date:

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

Search

Navigation