Constraint logic programming – an informal introduction

Thom Frühwirth; Alexander Herold; Volker Küchenhoff; Thierry Le Provost; Pierre Lim; Eric Monfroy; Mark Wallace

Constraint logic programming – an informal introduction

Thom Frühwirth, Alexander Herold, Volker Küchenhoff, Thierry Le Provost, Pierre Lim, Eric Monfroy, Mark Wallace

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

Abstract

Constraint Logic Programming (CLP) is a new class of programming languages combining the declarativity of logic programming with the efficiency of constraint solving. New application areas, amongst them many different classes of combinatorial search problems such as scheduling, planning or resource allocation can now be solved, which were intractable for logic programming so far. The most important advantage that these languages offer is the short development time while exhibiting an efficiency comparable to imperative languages. This tutorial aims at presenting the principles and concepts underlying these languages and explaining them by examples. The objective of this paper is not to give a technical survey of the current state of art in research on CLP, but rather to give a tutorial introduction and to convey the basic philosophy that is behind the different ideas in CLP. It will discuss the currently most successful computation domains and provide an overview on the different consistency techniques used in CLP and its implementations.

Original language	English
Title of host publication	Logic Programming in Action - 2nd International Logic Programming Summer School, LPSS 1992, Proceedings
Editors	Gerard Comyn, Michael J. Ratcliffe, Norbert E. Fuchs
Publisher	Springer
Pages	3-35
Number of pages	33
ISBN (Print)	9783540559306
Publication status	Published - 1992
Externally published	Yes
Event	2nd International Logic Programming Summer School, LPSS 1992 - Zurich, Switzerland Duration: 7 Sept 1992 → 11 Sept 1992

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	636 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	2nd International Logic Programming Summer School, LPSS 1992
Country/Territory	Switzerland
City	Zurich
Period	7/09/92 → 11/09/92

Cite this

Frühwirth, T., Herold, A., Küchenhoff, V., Le Provost, T., Lim, P., Monfroy, E., & Wallace, M. (1992). Constraint logic programming – an informal introduction. In G. Comyn, M. J. Ratcliffe, & N. E. Fuchs (Eds.), Logic Programming in Action - 2nd International Logic Programming Summer School, LPSS 1992, Proceedings (pp. 3-35). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 636 LNCS). Springer.

Frühwirth, Thom ; Herold, Alexander ; Küchenhoff, Volker et al. / Constraint logic programming – an informal introduction. Logic Programming in Action - 2nd International Logic Programming Summer School, LPSS 1992, Proceedings. editor / Gerard Comyn ; Michael J. Ratcliffe ; Norbert E. Fuchs. Springer, 1992. pp. 3-35 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{6cee552a1a0e41e780668f844988edef,

title = "Constraint logic programming – an informal introduction",

abstract = "Constraint Logic Programming (CLP) is a new class of programming languages combining the declarativity of logic programming with the efficiency of constraint solving. New application areas, amongst them many different classes of combinatorial search problems such as scheduling, planning or resource allocation can now be solved, which were intractable for logic programming so far. The most important advantage that these languages offer is the short development time while exhibiting an efficiency comparable to imperative languages. This tutorial aims at presenting the principles and concepts underlying these languages and explaining them by examples. The objective of this paper is not to give a technical survey of the current state of art in research on CLP, but rather to give a tutorial introduction and to convey the basic philosophy that is behind the different ideas in CLP. It will discuss the currently most successful computation domains and provide an overview on the different consistency techniques used in CLP and its implementations.",

author = "Thom Fr{\"u}hwirth and Alexander Herold and Volker K{\"u}chenhoff and {Le Provost}, Thierry and Pierre Lim and Eric Monfroy and Mark Wallace",

year = "1992",

language = "English",

isbn = "9783540559306",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "3--35",

editor = "Gerard Comyn and Ratcliffe, {Michael J.} and Fuchs, {Norbert E.}",

booktitle = "Logic Programming in Action - 2nd International Logic Programming Summer School, LPSS 1992, Proceedings",

note = "2nd International Logic Programming Summer School, LPSS 1992 ; Conference date: 07-09-1992 Through 11-09-1992",

}

Frühwirth, T, Herold, A, Küchenhoff, V, Le Provost, T, Lim, P, Monfroy, E & Wallace, M 1992, Constraint logic programming – an informal introduction. in G Comyn, MJ Ratcliffe & NE Fuchs (eds), Logic Programming in Action - 2nd International Logic Programming Summer School, LPSS 1992, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 636 LNCS, Springer, pp. 3-35, 2nd International Logic Programming Summer School, LPSS 1992, Zurich, Switzerland, 7/09/92.

Constraint logic programming – an informal introduction. / Frühwirth, Thom; Herold, Alexander; Küchenhoff, Volker et al.
Logic Programming in Action - 2nd International Logic Programming Summer School, LPSS 1992, Proceedings. ed. / Gerard Comyn; Michael J. Ratcliffe; Norbert E. Fuchs. Springer, 1992. p. 3-35 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 636 LNCS).

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

TY - GEN

T1 - Constraint logic programming – an informal introduction

AU - Frühwirth, Thom

AU - Herold, Alexander

AU - Küchenhoff, Volker

AU - Le Provost, Thierry

AU - Lim, Pierre

AU - Monfroy, Eric

AU - Wallace, Mark

PY - 1992

Y1 - 1992

N2 - Constraint Logic Programming (CLP) is a new class of programming languages combining the declarativity of logic programming with the efficiency of constraint solving. New application areas, amongst them many different classes of combinatorial search problems such as scheduling, planning or resource allocation can now be solved, which were intractable for logic programming so far. The most important advantage that these languages offer is the short development time while exhibiting an efficiency comparable to imperative languages. This tutorial aims at presenting the principles and concepts underlying these languages and explaining them by examples. The objective of this paper is not to give a technical survey of the current state of art in research on CLP, but rather to give a tutorial introduction and to convey the basic philosophy that is behind the different ideas in CLP. It will discuss the currently most successful computation domains and provide an overview on the different consistency techniques used in CLP and its implementations.

AB - Constraint Logic Programming (CLP) is a new class of programming languages combining the declarativity of logic programming with the efficiency of constraint solving. New application areas, amongst them many different classes of combinatorial search problems such as scheduling, planning or resource allocation can now be solved, which were intractable for logic programming so far. The most important advantage that these languages offer is the short development time while exhibiting an efficiency comparable to imperative languages. This tutorial aims at presenting the principles and concepts underlying these languages and explaining them by examples. The objective of this paper is not to give a technical survey of the current state of art in research on CLP, but rather to give a tutorial introduction and to convey the basic philosophy that is behind the different ideas in CLP. It will discuss the currently most successful computation domains and provide an overview on the different consistency techniques used in CLP and its implementations.

UR - http://www.scopus.com/inward/record.url?scp=84968432070&partnerID=8YFLogxK

M3 - Conference Paper

AN - SCOPUS:84968432070

SN - 9783540559306

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 3

EP - 35

BT - Logic Programming in Action - 2nd International Logic Programming Summer School, LPSS 1992, Proceedings

A2 - Comyn, Gerard

A2 - Ratcliffe, Michael J.

A2 - Fuchs, Norbert E.

PB - Springer

T2 - 2nd International Logic Programming Summer School, LPSS 1992

Y2 - 7 September 1992 through 11 September 1992

ER -

Frühwirth T, Herold A, Küchenhoff V, Le Provost T, Lim P, Monfroy E et al. Constraint logic programming – an informal introduction. In Comyn G, Ratcliffe MJ, Fuchs NE, editors, Logic Programming in Action - 2nd International Logic Programming Summer School, LPSS 1992, Proceedings. Springer. 1992. p. 3-35. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

Constraint logic programming – an informal introduction

Abstract

Publication series

Conference

Other files and links

Cite this