Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Explaining Constraint Programming

  • Chapter
Processes, Terms and Cycles: Steps on the Road to Infinity

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3838))

Abstract

We discuss here constraint programming (CP) by using a proof-theoretic perspective. To this end we identify three levels of abstraction. Each level sheds light on the essence of CP.

In particular, the highest level allows us to bring CP closer to the computation as deduction paradigm. At the middle level we can explain various constraint propagation algorithms. Finally, at the lowest level we can address the issue of automatic generation and optimization of the constraint propagation algorithms.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. The ECLiPSe Constraint Logic Programming System, http://www-icparc.doc.ic.ac.uk/eclipse/

  2. ELAN, Version 3.3, http://www.iist.unu.edu/~alumni/software/other/inria/elan/elan-presentation.html

  3. SICStus Prolog, http://www.sics.se/isl/sicstuswww/site/index.html

  4. Abdennadher, S., Rigotti, C.: Automatic generation of rule-based constraint solvers over finite domains. ACM Transactions on Computational Logic 5(2), 177–205 (2004)

    Article  MathSciNet  Google Scholar 

  5. Abdennadher, S., Rigotti, C.: Automatic generation of CHR constraint solvers. Theory and Practice of Logic Programming (2005) (to appear)

    Google Scholar 

  6. Apt, K.R.: A proof theoretic view of constraint programming. Fundamenta Informaticae 33(3), 263–293 (1998), Available via, http://arXiv.org/archive/cs/

    MathSciNet  Google Scholar 

  7. Apt, K.R.: The essence of constraint propagation. Theoretical Computer Science 221(1-2), 179–210 (1999), Available via, http://arXiv.org/archive/cs/

    Article  MATH  MathSciNet  Google Scholar 

  8. Apt, K.R.: The role of commutativity in constraint propagation algorithms. ACM Transactions on Programming Languages and Systems 22(6), 1002–1036 (2000) Available via, http://arXiv.org/archive/cs/

    Article  MathSciNet  Google Scholar 

  9. Apt, K.R.: Some remarks on Boolean constraint propagation. In: Apt, K.R., Kakas, A.C., Monfroy, E., Rossi, F. (eds.) Compulog Net WS 1999. LNCS (LNAI), vol. 1865, pp. 91–107. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  11. Apt, K.R., Monfroy, E.: Constraint programming viewed as rule-based programming. Theory and Practice of Logic Programming 1(6), 713–750 (2001), Available via, http://arXiv.org/archive/cs/

    Article  MATH  MathSciNet  Google Scholar 

  12. Benhamou, F.: Heterogeneous constraint solving. In: Hanus, M., Rodríguez-Artalejo, M. (eds.) ALP 1996. LNCS, vol. 1139, pp. 62–76. Springer, Heidelberg (1996)

    Google Scholar 

  13. Bistarelli, S., Gennari, R., Rossi, F.: Constraint propagation for soft constraint satisfaction problems: Generalization and termination conditions. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 83–97. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Brand, S., Apt, K.R.: Schedulers and redundancy for a class of constraint propagation rules. Theory and Practice of Logic Programming (2005) (to appear)

    Google Scholar 

  15. Castro, C.: Building constraint satisfaction problem solvers using rewrite rules and strategies. Fundamenta Informaticae 33(3), 263–293 (1998)

    Google Scholar 

  16. Colmerauer, A.: Opening the PROLOG-III universe. BYTE Magazine 12(9) (August 1987)

    Google Scholar 

  17. Fages, F., Fowler, J., Sola, T.: Experiments in reactive constraint logic programming. Journal of Logic Programming 37(1-3), 185–212 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  18. Frühwirth, T.: Theory and practice of Constraint Handling Rules. Journal of Logic Programming 37(1-3), 95–138 (October 1998); Special Issue on Constraint Logic Programming, Stuckey P. J., Marriot, K.: (eds.)

    Article  MATH  MathSciNet  Google Scholar 

  19. Gennari, R.: Arc consistency via subsumed functions. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 358–372. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  20. ILOG. Ilog white papers (2003), Available via, http://www.ilog.com/products/optimization/papers.cfm

  21. Jaffar, J., Lassez, J.-L.: Constraint logic programming. In: POPL 1987: Proceedings 14th ACM Symposium on Principles of Programming Languages, pp. 111–119. ACM, New York (1987)

    Chapter  Google Scholar 

  22. Kirchner, C., Ringeissen, C.: Rule-based constraint programming. Fundamenta Informaticae 34(3), 225–262 (1998)

    MATH  MathSciNet  Google Scholar 

  23. Koalog (2005), http://www.koalog.com

  24. Mackworth, A.: Consistency in networks of relations. Artificial Intelligence 8(1), 99–118 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  25. Mohr, R., Masini, G.: Good old discrete relaxation. In: Kodratoff, Y. (ed.) Proceedings of the 8th European Conference on Artificial Intelligence (ECAI), pp. 651–656. Pitman Publishers (1988)

    Google Scholar 

  26. Monfroy, E., Réty, J.-H.: Chaotic iteration for distributed constraint propagation. In: Carroll, J., Haddad, H., Oppenheim, D., Bryant, B., Lamont, G. (eds.) Proceedings of the 14th ACM Symposium on Applied Computing, ACM SAC 1999, San Antonio, Texas, USA, March 1999. Scientific Computing Track, pp. 19–24. ACM Press, New York (1999)

    Chapter  Google Scholar 

  27. Ringeissen, C., Monfroy, E.: Generating propagation rules for finite domains: a mixed approach. In: Apt, K.R., Kakas, A.C., Monfroy, E., Rossi, F. (eds.) Compulog Net WS 1999. LNCS (LNAI), vol. 1865, pp. 150–172. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  28. Telerman, V., Ushakov, D.: Data types in subdefinite models. In: Pfalzgraf, J., Calmet, J., Campbell, J. (eds.) AISMC 1996. LNCS, vol. 1138, pp. 305–319. Springer, Heidelberg (1996)

    Google Scholar 

  29. Van Hentenryck, P., Saraswat, V., Deville, Y.: Design, implementation, and evaluation of the constraint language cc(fd). Journal of Logic Programming 37(1-3), 139–164 (1998); Special Issue on Constraint Logic Programming (P. J. Stuckey and K. Marriot, Eds.)

    Article  MATH  Google Scholar 

  30. Waltz, D.L.: Generating semantic descriptions from drawings of scenes with shadows. In: Winston, P.H. (ed.) The Psychology of Computer Vision, pp. 19–91. McGraw Hill, New York (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, National University of Singapore,  

    Krzysztof R. Apt

  2. CWI, Amsterdam

    Krzysztof R. Apt

  3. University of Amsterdam, The Netherlands

    Krzysztof R. Apt

Authors
  1. Krzysztof R. Apt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, University of Innsbruck, Austria

    Aart Middeldorp

  2. Department of Philosophy, Utrecht University, Heidelberglaan 8, 3584 CS, Utrecht, The Netherlands

    Vincent van Oostrom

  3. Department of Theoretical Computer Science, Vrije Universiteit, De Boelelaan 1081a, 1081 HV, Amsterdam, The Netherlands

    Femke van Raamsdonk

  4. VU Vrije Universiteit Amsterdam,  

    Roel de Vrijer

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Apt, K.R. (2005). Explaining Constraint Programming. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds) Processes, Terms and Cycles: Steps on the Road to Infinity. Lecture Notes in Computer Science, vol 3838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11601548_6

Download citation

  • DOI: https://doi.org/10.1007/11601548_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30911-6

  • Online ISBN: 978-3-540-32425-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation