Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2302)
Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
Constraint Programming is an approach for modeling and solving combi- torial problems that has proven successful in many applications. It builds on techniques developed in Arti?cial Intelligence, Logic Programming, and - erations Research. Key techniques are constraint propagation and heuristic search. Constraint Programming is based on an abstraction that decomposes a problem solver into a reusable constraint engine and a declarative program modeling the problem. The constraint engine implements the required pr- agation and search algorithms. It can be realized as a library for a general purpose programming language (e.g. C++), as an extension of an existing language (e.g. Prolog), or as a system with its own dedicated language. The present book is concerned with the architecture and implementation of constraint engines. It presents a new, concurrent architecture that is far superior to the sequential architecture underlying Prolog. The new archit- ture is based on concurrent search with copying and recomputation rather than sequential search with trailing and backtracking. One advantage of the concurrent approach is that it accommodates any search strategy. Furth- more, it considerably simpli?es the implementation of constraint propagation algorithms since it eliminates the need to account for trailing and backtra- ing. The book investigates an expressive generalization of the concurrent - chitecture that accommodates propagation-preserving combinators (known as deep guard combinators) for negation, disjunction, implication, and re- cation of constraint propagators. Such combinators are beyond the scope of Prolog’s technology. In the concurrent approach they can be obtained with a re?ective encapsulation primitive.
Similar content being viewed by others
Keywords
Table of contents (15 chapters)
-
Front Matter
-
Back Matter
Editors and Affiliations
Bibliographic Information
Book Title: Programming Constraint Services
Book Subtitle: High-Level Programming of Standard and New Constraint Services
Editors: Christian Schulte
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-45945-6
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2002
Softcover ISBN: 978-3-540-43371-2Published: 20 March 2002
eBook ISBN: 978-3-540-45945-3Published: 01 August 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XII, 176
Topics: Computer Engineering, Artificial Intelligence, Programming Languages, Compilers, Interpreters, Programming Techniques, Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science