𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Constraint satisfaction in logic programming

✍ Scribed by Pascal Van Hentenryck


Publisher
The MIT Press
Year
1989
Tongue
English
Leaves
240
Edition
First Edition
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


This book tackles classic problems from operations research and circuit design using a logic programming language embedding consistency techniques, a paradigm emerging from artificial intelligence research. Van Hentenryck proposes a new approach to solving discrete combinatorial problems using these techniques.

Logic programming serves as a convenient language for stating combinatorial problems, but its "generate and test" paradigm leads to inefficient programs. Van Hentenryck's approach preserves one of the most useful features of logic programming - the duality of its semantics - yet allows a short development time for the programs while preserving most of the efficiency of special purpose programs written in a procedural language.

Embedding consistency techniques in logic programming allows for ease and flexibility of programming and short development time because constraint propagation and tree-search programming are abstracted away from the user. It also enables logic programs to be executed efficiently as consistency techniques permit an active use of constraints to remove combinations of values that cannot appear in a solution Van Hentenryck presents a comprehensive overview of this new approach from its theoretical foundations to its design and implementation, including applications to real life combinatorial problems.

The ideas introduced in Constraint Satisfaction in Logic Programming have been used successfully to solve more than a dozen practical problems in operations research and circuit design, including disjunctive scheduling, warehouse location, cutting stock car sequencing, and microcode labeling problems.

Pascal Van Hentenryck is a member of the research staff at the European Computer Industry Research Centre. Constraint Satisfaction in Logic Programming is based on research for the Centre's CHIP project. As an outgrowth of this project, a new language (CHIP) that will include consistency techniques has been developed for commercial use. The book is included in the Logic Programming series edited by Ehud Shapiro


πŸ“œ SIMILAR VOLUMES


Recent Advances in Constraints: 12th Ann
✍ FranΓ§ois Fages, Francesca Rossi, Sylvain Soliman πŸ“‚ Library πŸ“… 2008 πŸ› Springer 🌐 English

<P>This book constitutes the thoroughly refereed and extended post-workshop proceedings of the 12th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2007, held in Rocquencourt, France, in June 2007.</P> <P>The 10 revised full papers presented were ca

Constraint Logic Programming using Eclip
✍ Krzysztof R. Apt, Mark Wallace πŸ“‚ Library πŸ“… 2007 πŸ› Cambridge University Press 🌐 English

Constraint logic programming lies at the intersection of logic programming, optimisation and artificial intelligence. It has proved a successful tool in many areas including production planning, transportation scheduling, numerical analysis and bioinformatics. Eclipse is one of the leading software

Constraint Logic Programming: Selected R
✍ FrΓ©dΓ©ric Benhamou, Alain Colmerauer πŸ“‚ Library πŸ“… 1993 πŸ› The MIT Press 🌐 English

Constraint logic programming, the notion of computing with partial information, is becoming recognized as a way of dramatically improving on the current generation of programming languages. This collection presents the best of current work on all aspects of constraint logic programming languages, fr

Complexity of Infinite-Domain Constraint
✍ Manuel Bodirsky πŸ“‚ Library πŸ“… 2021 πŸ› Cambridge University Press 🌐 English

<span>Constraint Satisfaction Problems (CSPs) are natural computational problems that appear in many areas of theoretical computer science. Exploring which CSPs are solvable in polynomial time and which are NP-hard reveals a surprising link with central questions in universal algebra. This monograph

Parallel and Constraint Logic Programmin
✍ Ioannis Vlahavas, Panagiotis Tsarchopoulos, Ilias Sakellariou (auth.) πŸ“‚ Library πŸ“… 1998 πŸ› Springer US 🌐 English

<p>Constraint Logic Programming (CLP), an area of extreme research interest in recent years, extends the semantics of Prolog in such a way that the combinatorial explosion, a characteristic of most problems in the field of Artificial Intelligence, can be tackled efficiently. By employing solvers ded