Constraint Logic Programming

Mark G Wallace

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

Constraint Logic Programming

Research output: Chapter in Book/Report/Conference proceeding › Chapter (Book) › Research › peer-review

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.

Original language	English
Title of host publication	Computational Logic: Logic Programming and Beyond
Subtitle of host publication	Essays in Honour of Robert A. Kowalski Part I
Editors	Antonis C. Kakas, Fariba Sadri
Place of Publication	Berlin Germany
Publisher	Springer
Pages	512-532
Number of pages	21
ISBN (Print)	3540439595
DOIs	https://doi.org/10.1007/3-540-45628-7_19
Publication status	Published - 2002
Externally published	Yes

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	2407
ISSN (Print)	0302-9743

Access to Document

10.1007/3-540-45628-7_19

Cite this

@inbook{17241d02acd04480834c19641b5b0904,

title = "Constraint Logic Programming",

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.",

author = "Wallace, {Mark G}",

year = "2002",

doi = "10.1007/3-540-45628-7_19",

language = "English",

isbn = "3540439595",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "512--532",

editor = "Kakas, {Antonis C.} and Fariba Sadri",

booktitle = "Computational Logic: Logic Programming and Beyond",

}

Constraint Logic Programming. / Wallace, Mark G.
Computational Logic: Logic Programming and Beyond: Essays in Honour of Robert A. Kowalski Part I. ed. / Antonis C. Kakas; Fariba Sadri. Berlin Germany: Springer, 2002. p. 512-532 (Lecture Notes in Computer Science; Vol. 2407).

Research output: Chapter in Book/Report/Conference proceeding › Chapter (Book) › Research › peer-review

TY - CHAP

T1 - Constraint Logic Programming

AU - Wallace, Mark G

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

U2 - 10.1007/3-540-45628-7_19

DO - 10.1007/3-540-45628-7_19

M3 - Chapter (Book)

SN - 3540439595

T3 - Lecture Notes in Computer Science

SP - 512

EP - 532

BT - Computational Logic: Logic Programming and Beyond

A2 - Kakas, Antonis C.

A2 - Sadri, Fariba

PB - Springer

CY - Berlin Germany

ER -