Constraint Logic Programming

  • Mark Wallace
Conference paper

DOI: 10.1007/3-540-45628-7_19

Volume 2407 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Wallace M. (2002) Constraint Logic Programming. In: Kakas A.C., Sadri F. (eds) Computational Logic: Logic Programming and Beyond. Lecture Notes in Computer Science, vol 2407. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Mark Wallace
    • 1
  1. 1.IC-ParcWilliam Penney Laboratory, Imperial CollegeLondon