Constraint Logic Programming
 Mark Wallace
 … show all 1 hide
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.
 S. Abdennadher and H. Schlenker. INTERDIPan interactive constraint based nurse scheduler. In PACLP’99. The Practical Applications Company, April 1999.
 Aggoun, A., Beldiceanu, N. (1993) Extending CHIP in order to solve complex scheduling and placement problems. Journal of Mathematical and Computer Modelling 17: pp. 5773 CrossRef
 http://www.aiai.ed.ac.uk/project/statements/sched.html.
 Appelgren, L. H. (1969) A column generation algorithm for a ship scheduling problem. Transportation Science 3: pp. 5368 CrossRef
 Krzysztof Apt. The essence of constraint propagation. TCS: Theoretical Computer Science, 221, 1999.
 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.
 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.
 N. Beldiceanu. New global constraints in chip. Presented at the CHIP Users’ Club 95, 1995.
 Beldiceanu, N. Global constraints as graph properties on a structured network of elementary constraints of the same type. In: Dechter, R. eds. (2000) Proc. Conf. on Principles and Practice of Constraint Programming, CP’2000. Springer, Berlin Heidelberg, pp. 5266
 Beldiceanu, N., Contjean, E. (1994) Introducing global constraints in CHIP. Mathematical and Computer Modelling 12: pp. 97123 CrossRef
 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.
 Alex Brodsky. Constraint databases: promising technology or just intellectual exercise? CSURVES: Computing Surveys Electronic Section, 28, 1996.
 Caseau, Y., Laburthe, F. (1999) Heuristics for large constrained vehicle routing problems. Journal of Heuristics 5: pp. 281303 CrossRef
 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.
 http://www.icparc.ic.ac.uk/chic2/chic2_methodology/index.html.
 K. L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293–322. Plenum Press, 1978.
 A. Colmerauer. Equations and Inequations on Finite and Infinite Trees. In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS84), pages 85–99, Tokyo, Japan, November 1984. ICOT.
 Corsini, M.M., Musumbu, K., Rauzy, A., Charlier, B. L. (1993) Efficient bottomup abstract interpretation of Prolog by means of constraint solving over symbolic finite domains. Springer, Berlin Heidelberg
 http://www.cosytec.fr/.
 J. de Kleer. A comparison of ATMS and CSP techniques. In Proc. 11th International Joint Conference on Artificial Intelligence, IJCAI’89, 1989.
 M. Dincbas and H. Simonis. APACHEa constraintbased, automated stand allocation system. In Proc. of Advanced Software Technology in Air Transport (ASTAIR’91, 1991.
 Dincbas, M., Hentenryck, P., Simonis, H., Aggoun, A., Graf, T., Berthier, F. (1988) The constraint logic programming language CHIP. Proceedings Intl. Conf. on Fifth Generation Computer Systems, Tokyo, Japan, Dec 1988. Ohmsha Publishers, Tokyo, pp. 693702
 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.
 M. Fisher. An applications oriented guide to lagrangian relaxation, 1985.
 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.
 E.C. Freuder. Synthesizing constraint expressions. Communications of the ACM, 21:958–966, November 1978.
 Fromherz, M. P. J., Saraswat, V. A., Bobrow, D. G. (1999) Modelbased computing: Developing flexible machine control software. Artificial Intelligence 114: pp. 157202 CrossRef
 T. Fruhwirth. Theory and practice of constraint handling rules, 1998.
 Gaede, V., Brodsky, A., Guenther, O., Srivastava, D., Vianu, V., Wallace, M. G. (1998) Constraint Databases and Applications. Springer, Berlin Heidelberg
 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.
 Matt Ginsberg. Dynamic backtracking. Technical report, 1992. http://citeseer.nj.nec.com/ginsberg96dynamic.html.
 Weiqing He and Kim Marriott. Constrained graph layout. Constraints, 3(4), 1998.
 P. Van Hentenryck, Y. Deville, and C.M. Teng. A generic arcconsistency algorithm and its specializations. Artificial Intelligence, 57(2–3): 291–321, October 1992.
 http://www.i2.com.
 http://www.ifcomputer.de/consulting/home.html.
 ILOG. CPLEX. http://www.ilog.com/products/cplex/, 2001.
 J. Jaffar and J.L. Lassez. Constraint logic programming. In ACM, editor, POPL’ 87. Fourteenth Annual ACM SIGACTSIGPLAN Symposium on Principles of programming languages, January 21–23, 1987, Munich, W. Germany, pages 111–119, New York, NY, USA, 1987. ACM Press.
 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.
 Joxan Jaffar and Michael J. Maher. Constraint logic programming: A survey. The Journal of Logic Programming, 19 & 20:503–582, May 1994.
 Junker, U., Karisch, S. E., Kohl, N., Vaaben, B., Fahle, T., Sellmann, M. (1999) A framework for constraint programming based column generation. Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming. Springer, Berlin Heidelberg, pp. 261274
 Bob Kowalski. Logic for Problem Solving. North Holland, 1979.
 R. Kowalski, F. Toni, and G. Wetzel. Executing suspended logic programs. FUNDINF: Fundamenta Informatica, 34, 1998.
 G. Kuper, L. Libkin, and J. Paradeans. Constraint Databases. Springer Verlag, 2000.
 Laburthe, F., Caseau, Y. (1998) SALSA: A language for search algorithms. Springer, Berlin Heidelberg
 Pape, C., Baptiste, P. (1998) Resource constraints for preemptive jobshop scheduling. Constraints 3: pp. 263287 CrossRef
 Claude Le Pape and Mark Wallace. From constraint programming to hybrid problemsolving algorithms. Tutorial at CP98, Pisa. http://www.icparc.ic.ac.uk/~mgw/cp98_Tutorial.ppt, 1998.
 Thierry Le Provost and Mark Wallace. Generalized constraint propagation over the CLP scheme. Journal of Logic Programming, 16(3–4):319–359, August 1993.
 V. Liatsos and E. B. Richards. Scaleability in planning. In Proceedings of the 5th European Conference on Planning, Durham, UK, September 1999.
 Mackworth, A.K. (1977) Consistency in network of relations. Artificial Intelligence 8: pp. 99118 CrossRef
 Mackworth, A.K., Freuder, E.C. (1985) The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence 25: pp. 6574 CrossRef
 Michel, L., Hentenryck, P. (1997) Localizer: A modeling language for local search. Springer, Berlin Heidelberg
 M. Milano, G. Ottosson, P. Refalo, and E. Thorsteinsson. Global constraints: When constraint programming meets operations research. Under Submission, 2001.
 Mohr, R., Henderson, T.C. (1986) Arc and path consistency revisited. Artificial Intelligence 28: pp. 225233 CrossRef
 Montanari, U. (1974) Networks of constraints: fundamental properties and applications to picture processing. Information Science 7: pp. 95132 CrossRef
 Dash Optimization. XPRESSMP. http://www.dash.co.uk/, 2001.
 http://www.practicalapplications.co.uk/paclp2000/index.html.
 http://www.pdc.dk/.
 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.
 http://prologianet. univmrs. fr/us/domaines. htm.
 http://www.parctechnologies.com.
 Regin, J.C. (1994) A filtering algorithm for constraints of difference in CSPs. Proc. 12th Conf. American Assoc. Artificial Intelligence 1: pp. 362367
 Thomas Richards, E., Richards, B. (2000) Nonsystematic search and nogood learning. Journal of Automated Reasoning 24: pp. 483533 CrossRef
 Rodosek, R., Wallace, M. G., Hajian, M. T. (1999) A new approach to integrating mixed integer programming and constraint logic programming. Annals of Operations Research 86: pp. 6387 CrossRef
 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 (ECAI98), pages 504–508, Chichester, August 23–28 1998. John Wiley & Sons.
 Sakkout, H., Wallace, M. (2000) Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints 5: pp. 359388 CrossRef
 V. Saraswat, Rinard M., and P. Panangaden. Semantic foundations of concurrent constraint programming. In Proc. 18th ACM POPL, Jan 1991.
 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.
 Schimpf, J., Wallace, M. (1999) Finding the right algorithma combinatorial metaproblem. Electronic Notes in Discrete Mathematics 4: pp. 8092
 M. Sellmann and T. Fahle. Cpbased lagrangian relaxation for a multimedia application. Programme and papers presented at CPAIOR’01: http://www.icparc.ic.ac.uk/cpAIOR01/, 2001.
 E. Shapiro. The family of concurrent logic programming languages. ACM Computing Surveys, 21(3), 1989.
 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.
 http://www.sics.se/isl/decs/.
 Simonis, H. Application development with the CHIP system. In: Kuper, G., Wallace, M. eds. (1995) Proc. 1st Int. Database Workshop on Constraint Database Systems (CDB’95). Friedrichshafen, Germany, pp. 121
 H. Simonis. More standard constraint models. Tutorial presented at PAPACT98, 1998.
 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.
 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.
 http://www.temposoft.fr.
 P. Van Hentenryck, H. Simonis, and M. Dincbas. Constraint satisfaction using constraint logic programming. Artificial Intelligence, 58, 1992.
 Pascal Van Hentenryck. The OPL Optimization Programming Language. The MIT Press, 1999.
 Wallace, M. G., Novello, S., Schimpf, J. (1997) Eclipsea platform for constraint programming. ICL Systems Journal 12: pp. 159200
 Mark Wallace. Practical applications of constraint programming. Constraints Journal, 1(1), 1996.
 Waltz, D. (1972) Generating semantic descriptions from drawings of scenes with shadows. Technical Report AI271. MIT, Massachusetts
 Yokoo, M. (1994) Weakcommitment search for solving constraint satisfaction problems. AAAI 1: pp. 313318
 Yunes, T. H., Moura, A. V., Souza, C. C. (2000) A hybrid approach for solving large scale crew scheduling problems. Proc. 2nd International Workshop on Practical Aspects of Declarative Languages (PADL’ 00). Springer, Berlin Heidelberg CrossRef
 Title
 Constraint Logic Programming
 Book Title
 Computational Logic: Logic Programming and Beyond
 Book Subtitle
 Essays in Honour of Robert A. Kowalski Part I
 Book Part
 IV
 Pages
 pp 512532
 Copyright
 2002
 DOI
 10.1007/3540456287_19
 Print ISBN
 9783540439592
 Online ISBN
 9783540456285
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 2407
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag Berlin Heidelberg
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors

 Antonis C. Kakas ^{(1)}
 Fariba Sadri ^{(2)}
 Editor Affiliations

 1. Department of Computer Science, University of Cyprus
 2. Department of Computing, Imperial College of Science, Technology and Medicine
 Authors

 Mark Wallace ^{(5)}
 Author Affiliations

 5. ICParc, William Penney Laboratory, Imperial College, London, SW7 2AZ
Continue reading...
To view the rest of this content please follow the download PDF link above.