Willkommen, schön sind Sie da!
Logo Ex Libris

Programming Constraint Services

  • Kartonierter Einband
  • 188 Seiten
(0) Erste Bewertung abgeben
Bewertungen & Rezensionen
Alle Bewertungen ansehen
This book is concerned with the architecture and implementation of constraint engines. The author's main contribution is that... Weiterlesen
100.00 CHF 80.00
Sie sparen CHF 20.00
Print on Demand - Auslieferung erfolgt in der Regel innert 4 bis 6 Wochen.
Bestellung & Lieferung in eine Filiale möglich


This book is concerned with the architecture and implementation of constraint engines. The author's main contribution is that constraint services, such as search and combinators, are made programmable; this is achieved by devising computa- tion spaces as simple abstractions for programming constraint services at a high level. State-of-the-art and novel search strategies such as visual interactive search and parallel search are covered. This book is indispensable reading for anyone seriously interested in constraint technology.

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.

Includes supplementary material: sn.pub/extras

Constraint Programming.- Introducing Oz Light.- Spaces for Search.- Search Engines.- Best-Solution Search.- Recomputation.- Oz Explorer:Visual Search.- Distributed Search.- Spaces for Combinators.- Constraint Combinators.- Implementing Oz Light.- Implementing Spaces.- Other Approaches to Search.- Conclusion.


Titel: Programming Constraint Services
Untertitel: High-Level Programming of Standard and New Constraint Services
EAN: 9783540433712
ISBN: 3540433716
Format: Kartonierter Einband
Herausgeber: Springer Berlin Heidelberg
Genre: Informatik
Anzahl Seiten: 188
Gewicht: 295g
Größe: H235mm x B155mm x T10mm
Jahr: 2002
Untertitel: Englisch
Auflage: 2002

Weitere Produkte aus der Reihe "Lecture Notes in Artificial Intelligence"