Skip to main content
SpringerLink
Log in

Constraint Logic Programming

  • Chapter
A 25-Year Perspective on Logic Programming

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6125))

Abstract

Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently used in many commercial applications. Since the original proposal, it has developed enormously: many languages and systems are now available either as open source programs or as commercial systems.

Also, CLP has been one of the technologies able to recruit researchers from other communities to the declarative programming cause. Current CLP engines include technologies and results developed in other communities, which themselves discovered logic as an invaluable tool to model and solve real-life problems.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Alberti, M., Cattafi, M., Gavanelli, M., Lamma, E., Chesani, F., Montali, M., Mello, P., Torroni, P.: Integrating abductive logic programming and description logics in a dynamic contracting architecture. In: IEEE Int. Conf. on Web Services (2009)

    Google Scholar 

  2. Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Montali, M.: An abductive framework for a-priori verification of web services. In: PPDP (2006)

    Google Scholar 

  3. Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Verifiable agent interaction in abductive logic programming: the SCIFF framework. ACM Transactions on Computational Logics 9(4) (2008)

    Google Scholar 

  4. Alberti, M., Lamma, E.: Synthesis of object models from partial models: A CSP perspective. In: van Harmelen, F. (ed.) ECAI, pp. 116–120. IOS Press, Amsterdam (2002)

    Google Scholar 

  5. Alpuente, M., Sessa, M. (eds.): GULP-PRODE 1995 (1995)

    Google Scholar 

  6. Apt, K.R.: Principles of Constraint Programming. Cambridge Univ. Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  7. Apt, K.R., Wallace, M.G.: Constraint Logic Programming Using ECLiPSe. Cambridge University Press, Cambridge (2006)

    Google Scholar 

  8. Armando, A., Melis, E., Ranise, S.: Constraint solving in logic programming and in automated deduction: A comparison. In: Giunchiglia, F. (ed.) AIMSA 1998. LNCS (LNAI), vol. 1480, pp. 28–38. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  9. Avanzini, F., Rocchesso, D., Belussi, A., Dal Palù, A., Dovier, A.: Designing an urban-scale auditory alert system. IEEE Computer 37(9), 55–61 (2004)

    Google Scholar 

  10. Backofen, R., Gilbert, D.: Bioinformatics and constraints. In: Rossi, et al [127]

    Google Scholar 

  11. Bagnara, R., Gori, R., Hill, P.M., Zaffanella, E.: Finite-tree analysis for constraint logic-based languages. In: Cousot, P. (ed.) SAS 2001. LNCS, vol. 2126, pp. 165–184. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  12. Baptiste, P., Laborie, P., Le Pape, C., Nuijten, W.: Constraint-based scheduling and planning. In: Rossi, et al [127]

    Google Scholar 

  13. Barruffi, R., Milano, M., Montanari, R.: Planning for security management. IEEE Intelligent Systems 16(1), 74–80 (2001)

    Article  Google Scholar 

  14. Barruffi, R., Milano, M., Torroni, P.: Planning while executing: A constraint-based approach. In: Ohsuga, S., Raś, Z.W. (eds.) ISMIS 2000. LNCS (LNAI), vol. 1932, pp. 228–236. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  15. Baselice, S., Bonatti, P., Gelfond, M.: Towards an integration of answer set and constraint solving. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 52–66. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. Bella, G., Bistarelli, S.: Soft constraint programming to analysing security protocols. TPLP 4(5-6), 545–572 (2004)

    MATH  MathSciNet  Google Scholar 

  17. Benini, L., Lombardi, M., Mantovani, M., Milano, M., Ruggiero, M.: Multi-stage Benders decomposition for optimizing multicore architectures. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol. 5015, pp. 36–50. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  18. Bergenti, F., Dal Palù, A., Rossi, G.: Generalizing finite domain constraint solving. In: Formisano, A. (ed.) CILC 2008 (2008)

    Google Scholar 

  19. Bertolino, B., Bonatti, P.A., Montesi, D., Pelagatti, S.: Correctness and completeness of logic programs under the CLP schema. In: Asirelli, P. (ed.) Proc. Sixth Italian Conference on Logic Programming, Pisa, Italy, pp. 391–405 (1991)

    Google Scholar 

  20. Bessiere, C.: Constraint propagation. In: Rossi, et al [127]

    Google Scholar 

  21. Bessière, C. (ed.): CP 2007. LNCS, vol. 4741. Springer, Heidelberg (2007)

    MATH  Google Scholar 

  22. Bistarelli, S., Frühwirth, T.W., Marte, M.: Soft constraint propagation and solving in chrs. In: SAC, pp. 1–5. ACM, New York (2002)

    Google Scholar 

  23. Bistarelli, S., Gabbrielli, M., Meo, M., Santini, F.: Timed soft concurrent constraint programs. In: Lea, D., Zavattaro, G. (eds.) COORDINATION 2008. LNCS, vol. 5052, pp. 50–66. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  24. Bistarelli, S., Montanari, U., Rossi, F.: Semiring based constraint solving and optimization. Journal of the ACM 44(2), 201–236 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  25. Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint logic programming. In: IJCAI 2001, pp. 352–357 (2001)

    Google Scholar 

  26. Bistarelli, S., Montanari, U., Rossi, F.: Soft concurrent constraint programming. In: Le Métayer, D. (ed.) ESOP 2002. LNCS, vol. 2305, pp. 53–67. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  27. Bonatti, P., Calimeri, F., Leone, N., Ricca, F.: Answer Set Programming. In: Dovier, A., Pontelli, E. (eds.) 25 Years of Logic Programming, ch.8. LNCS, vol. 6125, pp. 159–182. Springer, Heidelberg (2010)

    Google Scholar 

  28. Borning, A., Maher, M., Martindale, A., Wilson, M.: Constraint hierarchies and logic programming. In: Levi, G., Martelli, M. (eds.) ICLP (1989)

    Google Scholar 

  29. Bruscoli, P., Levi, F., Levi, G., Meo, M.: Compilative constructive negation in constraint logic programs. In: Tison, S. (ed.) CAAP 1994. LNCS, vol. 787, pp. 52–67. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  30. Brusoni, V., Console, L., Lamma, E., Mello, P., Milano, M., Terenziani, P.: Resource-based vs. task-based approaches for scheduling problems. In: Michalewicz, M., Raś, Z.W. (eds.) ISMIS 1996. LNCS, vol. 1079. Springer, Heidelberg (1996)

    Google Scholar 

  31. Buscemi, M.G., Montanari, U.: A survey of constraint-based programming paradigms. Computer Science Review 2(3), 137–141 (2008)

    Article  Google Scholar 

  32. Cabeza, D., Hermenegildo, M.: Implementing distributed concurrent constraint execution in the CIAO system. In: Lucio, P., Martelli, M., Navarro, M. (eds.) APPIA-GULP-PRODE (1996)

    Google Scholar 

  33. Cadoli, M., Mancini, T.: Using a theorem prover for reasoning on constraint problems. In: Bandini, S., Manzoni, S. (eds.) AI*IA. Springer, Heidelberg (2005)

    Google Scholar 

  34. Caprara, A., Focacci, F., Lamma, E., Mello, P., Milano, M., Toth, P., Vigo, D.: Integrating constraint logic programming and operations research techniques for the crew rostering problem. Softw. Pract. Exper. 28(1), 49–76 (1998)

    Article  Google Scholar 

  35. Carlsson, M., Widen, J.: SICStus Prolog User’s Manual. Technical report, Swedish Institute of Computer Science (SICS) (1999)

    Google Scholar 

  36. Carraresi, P., Gallo, G., Rago, G.: A hypergraph model for constraint logic programming and applications to bus drivers’ scheduling. AMAI 8(3-4) (1993)

    Google Scholar 

  37. Cheadle, A., Harvey, W., Sadler, A., Schimpf, J., Shen, K., Wallace, M.: ECLiPSe: a tutorial introduction (2003), http://eclipse-clp.org/doc/tutorial

  38. Cipriano, R., Di Gaspero, L., Dovier, A.: Hybrid approaches for rostering: A case study in the integration of constraint programming and local search. In: Almeida, F., Blesa Aguilera, M.J., Blum, C., Moreno Vega, J.M., Pérez Pérez, M., Roli, A., Sampels, M. (eds.) HM 2006. LNCS, vol. 4030, pp. 110–123. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  39. Cipriano, R., Di Gaspero, L., Dovier, A.: A hybrid solver for large neighborhood search: Mixing Gecode and EasyLocal + + . In: Sampels, M. (ed.) HM 2009. LNCS, vol. 5818, pp. 141–155. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  40. Codognet, P., Diaz, D.: Compiling constraints in clp(fd). J. Log. Prog. (1996)

    Google Scholar 

  41. Colmerauer, A.: An introduction to Prolog-III. Communication of the ACM (1990)

    Google Scholar 

  42. Colmerauer, A.: Prolog II reference manual and theoretical model. Technical report, Groupe Intelligence Artificielle, Universitè Aix-Mareseille II (October 1982)

    Google Scholar 

  43. Colussi, L., Marchiori, E., Marchiori, M.: A dataflow semantics for constraint logic programs. In: Alpuente, Sessa [5], pp. 557–568

    Google Scholar 

  44. Corin, R., Etalle, S.: An improved constraint-based system for the verification of security protocols. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol. 2477, pp. 326–341. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  45. Cucchiara, R., Gavanelli, M., Lamma, E., Mello, P., Milano, M., Piccardi, M.: Extending CLP(FD) with interactive data acquisition for 3D visual object recognition. In: Proc. PACLP 1999, pp. 137–155 (1999)

    Google Scholar 

  46. Cucchiara, R., Gavanelli, M., Lamma, E., Mello, P., Milano, M., Piccardi, M.: From eager to lazy constrained data acquisition: A general framework. New Generation Computing 19(4), 339–367 (2001)

    Article  MATH  Google Scholar 

  47. Dahl, V., Niemelä, I. (eds.): ICLP 2007. LNCS, vol. 4670. Springer, Heidelberg (2007)

    MATH  Google Scholar 

  48. Dal Palù, A., Dovier, A., Fogolari, F.: Constraint logic programming approach to protein structure prediction. BMC Bioinformatics 5 (2004)

    Google Scholar 

  49. Dal Palù, A., Dovier, A., Pontelli, E.: Computing approximate solutions of the protein structure determination problem using global constraints on discrete crystal lattices. Int’l Journal of Data Mining and Bioinformatics 4(1) (January 2010)

    Google Scholar 

  50. Dal Palù, A., Dovier, A., Pontelli, E., Rossi, G.: Integrating finite domain constraints and CLP with sets. In: PPDP 2003, pp. 219–229. ACM, New York (2003)

    Chapter  Google Scholar 

  51. Dal Palù, A., Torroni, P.: 25 Years of Applications of Logic Programming. In: Dovier, Pontelli [68], vol. 6125, ch.14, pp. 298–325 (2010)

    Google Scholar 

  52. de Boer, F.S., Di Pierro, A., Palamidessi, C.: An algebraic perspective of constraint logic programming. Journal of Logic and Computation 7(1), 1–38 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  53. de Boer, F.S., Gabbrielli, M.: Infinite computations in concurrent constraint programming. Electr. Notes Theor. Comput. Sci. 6 (1997)

    Google Scholar 

  54. de Boer, F.S., Gabbrielli, M., Meo, M.C.: A timed concurrent constraint language. Inf. Comput. 161(1), 45–83 (2000)

    Article  MATH  Google Scholar 

  55. De Maria, E., Dovier, A., Montanari, A., Piazza, C.: Exploiting model checking in constraint-based approaches to the protein folding. In: WCB 2006 (2006)

    Google Scholar 

  56. Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)

    Google Scholar 

  57. Delzanno, G., Etalle, S.: Proof theory, transformations, and logic programming for debugging security protocols. In: Pettorossi, A. (ed.) LOPSTR 2001. LNCS, vol. 2372, p. 76. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  58. Delzanno, G., Gabbrielli, M., Meo, M.: A compositional semantics for CHR. In: PPDP 2005, pp. 209–217. ACM, New York (2005)

    Chapter  Google Scholar 

  59. Delzanno, G., Giacobazzi, R., Ranzato, F.: Analysis, Abstract Interpretation, and Verification in (Constraint Logic) Programming. In: Dovier, Pontelli [68], vol. 6125, ch. 7, pp. 136–158 (2010)

    Google Scholar 

  60. Díaz, D., Codognet, P.: GNU Prolog: Beyond compiling Prolog to C. In: Pontelli, E., Santos Costa, V. (eds.) PADL 2000. LNCS, vol. 1753, p. 81. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  61. Dondossola, G., Ratto, E.: GRF temporal reasoning language. Technical report, CISE, Milano (1993)

    Google Scholar 

  62. Dovier, A., Formisano, A., Pontelli, E.: Multivalued action languages with constraints in CLP(FD). In: Dahl, Niemelä [47], pp. 255–270

    Google Scholar 

  63. Dovier, A., Formisano, A., Pontelli, E.: An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems. J. Exp. Theor. Artif. Intell. 21(2) (2009)

    Google Scholar 

  64. Dovier, A., Omodeo, E., Pontelli, E., Rossi, G.: {log}: A logic programming language with finite sets. In: ICLP, pp. 111–124 (1991)

    Google Scholar 

  65. Dovier, A., Piazza, C., Pontelli, E., Rossi, G.: Sets and constraint logic programming. ACM Trans. Program. Lang. Syst. 22(5), 861–931 (2000)

    Article  Google Scholar 

  66. Dovier, A., Piazza, C., Rossi, G.: A uniform approach to constraint-solving for lists, multisets, compact lists, and sets. ACM Trans. Comput. Log. 9(3) (2008)

    Google Scholar 

  67. Dovier, A., Policriti, A., Rossi, G.: A uniform axiomatic view of lists, multisets, and sets, and the relevant unification algorithms. Fundam. Inform. 36(2-3) (1998)

    Google Scholar 

  68. Dovier, A., Pontelli, E. (eds.): 25 Years of Logic Programming. LNCS, vol. 6125. Springer, Heidelberg (2010)

    Google Scholar 

  69. Endriss, U., Mancarella, P., Sadri, F., Terreni, G., Toni, F.: The CIFF proof procedure for abductive logic programming with constraints. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 31–43. Springer, Heidelberg (2004)

    Google Scholar 

  70. Eremin, A., Wallace, M.: Hybrid Benders decomposition algorithms in constraint logic programming. In: Walsh [138], pp. 1–15

    Google Scholar 

  71. Etalle, S., Gabbrielli, M., Meo, M.: Transformations of CCP programs. ACM Trans. Program. Lang. Syst. 23(3), 304–395 (2001)

    Article  Google Scholar 

  72. Fahle, T., Schamberger, S., Sellman, M.: Symmetry breaking. In: Walsh [138]

    Google Scholar 

  73. Falaschi, M., Gabbrielli, M., Marriott, K., Palamidessi, C.: Confluence in concurrent constraint programming. Theor. Comput. Sci. 183(2), 281–315 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  74. Falaschi, M., Gabbrielli, M., Marriott, K., Palamidessi, C.: Constraint logic programming with dynamic scheduling: A semantics based on closure operators. Information and Computation 137(1), 41–67 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  75. Farenzena, M., Fusiello, A., Dovier, A.: Reconstruction with interval constraints propagation. In: CVPR, pp. 1185–1190. IEEE Computer Society, Los Alamitos (2006)

    Google Scholar 

  76. Festa, G., Sardu, G., Felici, R.: A decision support system for the Venice lagoon. In: Herold, A. (ed.) Handbook of parallel constraint logic programming applications (1995)

    Google Scholar 

  77. Fioravanti, F., Pettorossi, A., Proietti, M.: Transformation rules for locally stratified constraint logic programs. In: Bruynooghe, M., Lau, K.-K. (eds.) Program Development in Computational Logic. LNCS, vol. 3049, pp. 291–339. Springer, Heidelberg (2004)

    Google Scholar 

  78. Focacci, F., Laburthe, F., Lodi, A.: Local search and constraint programming: LS and CP illustrated on a transportation problem. In: Milano, M. (ed.) Constraint and Integer Programming. Towards a Unified Methodology, pp. 137–167. Kluwer Academic Publishers, Dordrecht (2003)

    Google Scholar 

  79. Focacci, F., Milano, M.: Global cut framework for removing symmetries. In: Walsh [138], pp. 77–92

    Google Scholar 

  80. Focacci, F., Milano, M., Lodi, A.: Soving TSP with time windows with constraints. In: International Conference on Logic Programming, pp. 515–529 (1999)

    Google Scholar 

  81. Frisch, A., Hnich, B., Kızıltan, Z., Miguel, I., Walsh, T.: Propagation algorithms for lexicographic ordering constraints. Artif. Int. 170(10), 803–834 (2006)

    Article  MATH  Google Scholar 

  82. Frühwirth, T.: Theory and practice of constraint handling rules. Journal of Logic Programming 37, 95–138 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  83. Frühwirth, T., Di Pierro, A., Wiklicky, H.: An implementation of probabilistic constraint handling rules. In: Comini, M., Falaschi, M. (eds.) WFLP (2002)

    Google Scholar 

  84. Gabbrielli, M., Dore, G.M., Levi, G.: Observable semantics for constraint logic programs. J. Log. Comput. 5(2), 133–171 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  85. Gabbrielli, M., Palamidessi, C., Valencia, F.D.: Concurrent and Reactive Constraint Programming. In: Dovier, Pontelli [68], vol. 6125, ch. 11, pp. 225–248 (2010)

    Google Scholar 

  86. Gavanelli, M.: University timetabling in ECLiPSe. ALP Newsletter 19(3) (2006)

    Google Scholar 

  87. Gavanelli, M., Alberti, M., Lamma, E.: Integration of abductive reasoning and constraint optimization in SCIFF. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 387–401. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  88. Gavanelli, M., Lamma, E., Mello, P., Milano, M.: Dealing with incomplete knowledge on CLP(FD) variable domains. ACM TOPLAS 27(2) (2005)

    Google Scholar 

  89. Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: An abductive framework for information exchange in multi-agent systems. In: Dix, J., Leite, J. (eds.) CLIMA 2004. LNCS (LNAI), vol. 3259, pp. 34–52. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  90. Gavanelli, M., Milano, M.: Cost-based filtering for determining the Pareto frontier. In: Junker, U., Kießling, W. (eds.) Multidisciplinary Workshop on Advances in Preference Handling, in conjunction with ECAI 2006 (2006)

    Google Scholar 

  91. Gennari, R., Mich, O.: Constraint-based temporal reasoning for e-learning with LODE. In: Bessiere [21]

    Google Scholar 

  92. Gent, I.P., Smith, B.M.: Symmetry breaking in constraint programming. In: Horn, W. (ed.) ECAI, pp. 599–603. IOS Press, Amsterdam (2000)

    Google Scholar 

  93. Georget, Y., Codognet, P.: Compiling semiring-based constraints with clp(fd,s). In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, p. 205. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  94. Giacobazzi, R., Debray, S., Levi, G.: Generalized semantics and abstract interpretation for constraint logic programs. J. Log. Program. 25(3) (1995)

    Google Scholar 

  95. Giordano, L., Toni, F.: Knowledge representation and non-monotonic reasoning. In: Dovier, Pontelli [68], vol. 6125, ch. 5, pp. 86–110 (2010)

    Google Scholar 

  96. Gualandi, S., Malucelli, F.: Constraint programming-based column generation. 4OR: A Quarterly Journal of Operations Research 7(2), 113–137 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  97. Van Hoeve, W.J., Pesant, G., Rousseau, L.-M.: On global warming: Flow-based soft global constraints. Journal of Heuristics 12(4-5), 347–373 (2006)

    Article  MATH  Google Scholar 

  98. Hooker, J.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. John Wiley & Sons, Chichester (2000)

    MATH  Google Scholar 

  99. Jaffar, J., Lassez, J.-L.: Constraint logic programming. In: Proc. 14th symp. on Principles of programming languages. ACM, New York (1987)

    Google Scholar 

  100. Jaffar, J., Michaylov, S., Stuckey, P., Yap, R.: The CLP(R) Language and System. ACM Transactions on Programming Languages and Systems (1992)

    Google Scholar 

  101. Kakas, A.C., Kowalski, R.A., Toni, F.: Abductive Logic Programming. Journal of Logic and Computation 2(6), 719–770 (1993)

    Article  MathSciNet  Google Scholar 

  102. Kakas, A.C., Mancarella, P.: On the relation between Truth Maintenance and Abduction. In: Fukumura, T. (ed.) PRICAI (1990)

    Google Scholar 

  103. Kakas, A.C., Michael, A., Mourlas, C.: ACLP: Abductive Constraint Logic Programming. Journal of Logic Programming 44(1-3), 129–177 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  104. Kakas, A.C., van Nuffelen, B., Denecker, M.: \({\cal A}\)-System: Problem solving through abduction. In: Nebel, B. (ed.) Proc. of IJCAI 2001, pp. 591–596 (2001)

    Google Scholar 

  105. Mackworth, A.: Consistency in networks of relations. Artif. Intell. 8(1) (1977)

    Google Scholar 

  106. Majkic, Z.: Constraint logic programming and logic modality for event’s valid-time approximation. In: 2nd Indian Int. Conf. on Artificial Intelligence (2005)

    Google Scholar 

  107. Mancarella, P., Terreni, G., Toni, F.: Web sites verification: An abductive logic programming tool. In: Dahl, Niemelä [47]

    Google Scholar 

  108. Mancini, T., Cadoli, M.: Detecting and breaking symmetries by reasoning on problem specifications. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), vol. 3607, pp. 165–181. Springer, Heidelberg (2005)

    Google Scholar 

  109. Mancini, T., Micaletto, D., Patrizi, F., Cadoli, M.: Evaluating ASP and commercial solvers on the CSPLib. Constraints 13(4), 407–436 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  110. Manco, G., Turini, F.: A structural (meta-logical) semantics for linear objects. In: Alpuente, Sessa [5], pp. 421–434

    Google Scholar 

  111. Mascardi, V., Merelli, E.: Agent-oriented and constraint technologies for distributed transaction management. In: Parenti, R., Masulli, F. (eds.) Proc. Int. ICSC Symposia IIA 1999 and SOCO 1999 (1999)

    Google Scholar 

  112. Merelli, E., De Leone, R., Martelli, M., Panti, M.: Embedding constraint logic programming formula in a local search algorithm for job shop scheduling. In: EURO XVI, Bruxelles (July 1998)

    Google Scholar 

  113. Meseguer, P., Rossi, F., Schiex, T.: Soft constraints. In: Rossi, et al [127]

    Google Scholar 

  114. Meseguer, P., Torras, C.: Exploiting symmetries within constraint satisfaction search. Artificial Intelligence 129(1-2), 133–163 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  115. Mesnard, F., Ruggieri, S.: On proving left termination of constraint logic programs. ACM Trans. Comput. Log. 4(2) (2003)

    Google Scholar 

  116. Mohr, R., Masini, G.: Good old discrete relaxation. In: ECAI (1988)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  118. Montesi, D., Bertino, E., Martelli, M.: Transactions and updates in deductive databases. IEEE Trans. Knowledge and Data Engineering 9(5), 784–797 (1997)

    Article  Google Scholar 

  119. Nethercote, N., Stuckey, P., Becket, R., Brand, S., Duck, G., Tack, G.: MiniZinc: Towards a standard CP modelling language. In: Bessiere [21], pp. 529–543

    Google Scholar 

  120. Novello, S.: ECLiPSe examples (1998), http://eclipse-clp.org/examples/golf.ecl.txt

  121. Orlandini, A.: Model-based rescue robot control with ECLiPSe framework. In: Oddi, A., Cesta, A., Fages, F., Policella, N., Rossi, F. (eds.) CSCLP (2008)

    Google Scholar 

  122. Pettorossi, A., Proietti, M., Senni, V.: The Transformational Approach to Program Development. In: Dovier, Pontelli [68], vol. 6125, ch. 6, pp. 111–135 (2010)

    Google Scholar 

  123. Pierro, A.D., Wiklicky, H.: An operational semantics for probabilistic concurrent constraint programming. In: ICCL, pp. 174–183 (1998)

    Google Scholar 

  124. Provetti, A., Rossi, G.: Action specifications in {log}. In: Falaschi, M., Navarro, M., Policriti, A. (eds.) APPIA-GULP-PRODE (1997)

    Google Scholar 

  125. Raffaetà, A., Ceccarelli, T., Centeno, D., Giannotti, F., Massolo, A., Parent, C., Renso, C., Spaccapietra, S., Turini, F.: An application of advanced spatio-temporal formalisms to behavioural ecology. Geoinformatica 12(1), 37–72 (2008)

    Article  Google Scholar 

  126. Raffaetà, A., Frühwirth, T.W.: Spatio-temporal annotated constraint logic programming. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol. 1990, pp. 259–273. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  127. Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier, Amsterdam (2006)

    MATH  Google Scholar 

  128. Rossi, G., Panegai, E., Poleo, E.: JSetL: a Java library for supporting declarative programming in Java. Softw. Pract. Exper. 37(2), 115–149 (2007)

    Article  Google Scholar 

  129. Ruttkay, Z.: Fuzzy constraint satisfaction. In: FUZZ-IEEE 1994, Orlando, FL (1994)

    Google Scholar 

  130. Saraswat, V.A.: Concurrent Constraint Programming. MIT Press, Cambridge (2003)

    Google Scholar 

  131. Schaerf, A.: Scheduling sport tournaments using constraint logic programming. Constraints 4(1), 43–65 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  132. Schaerf, A.: A survey of automated timetabling. Artif. Intell. Review 13(2) (1999)

    Google Scholar 

  133. Schiex, T., Fargier, H., Verfaillie, G.: Valued constraint satisfaction problems: hard and easy problems. In: IJCAI 1995, pp. 631–637 (1995)

    Google Scholar 

  134. Schulte, C., Stuckey, P.: Efficient constraint propagation engines. In: ToPLaS 2008 (2008)

    Google Scholar 

  135. Van Hentenryck, P.: Constraint Satisfaction in Logic Programming. MIT, Cambridge (1989)

    Google Scholar 

  136. van Hoeve, W.-J.: The all different constraint: a survey. In: Sixth Annual Workshop of the ERCIM Working Group on Constraints (2001)

    Google Scholar 

  137. Wallace, M.: Practical applications of constraint programming. Constraints (1996)

    Google Scholar 

  138. Walsh, T. (ed.): CP 2001. LNCS, vol. 2239. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  139. Wielemaker, J., Huang, Z., Van der Meij, L.: SWI-Prolog and the web. Theory and Practice of Logic Programming 8(3), 363–392 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  140. Zanarini, A., Milano, M., Pesant, G.: Improved algorithm for the soft global cardinality constraint. In: Beck, J.C., Smith, B.M. (eds.) CPAIOR 2006. LNCS, vol. 3990, pp. 288–299. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  141. Zhou, N.-F.: Programming finite-domain constraint propagators in action rules. Theory and Practice of Logic Programming 6(5), 483–507 (2006)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria, Università di Ferrara,  

    Marco Gavanelli

  2. Dipartimento di Matematica Pura e Applicata, Università di Padova,  

    Francesca Rossi

Authors
  1. Marco Gavanelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francesca Rossi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dip. di Matematica e Informatica, Università di Udine, Via delle Scienze 206, 33100, Udine, Italy

    Agostino Dovier

  2. Department of Computer Science, New Mexico State University, P.O. Box 30001, 88003, MSC CS, Las Cruces, NM, USA

    Enrico Pontelli

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gavanelli, M., Rossi, F. (2010). Constraint Logic Programming. In: Dovier, A., Pontelli, E. (eds) A 25-Year Perspective on Logic Programming. Lecture Notes in Computer Science, vol 6125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14309-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14309-0_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14308-3

  • Online ISBN: 978-3-642-14309-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation