Programming Constraint Services: High-Level Programming of Standard and New Constraint Services by Christian SchulteProgramming Constraint Services: High-Level Programming of Standard and New Constraint Services by Christian Schulte

Programming Constraint Services: High-Level Programming of Standard and New Constraint Services

byChristian Schulte

Paperback | March 20, 2002

Pricing and Purchase Info

$105.75 online 
$117.50 list price save 10%
Earn 529 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.
Title:Programming Constraint Services: High-Level Programming of Standard and New Constraint ServicesFormat:PaperbackDimensions:176 pagesPublished:March 20, 2002Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540433716

ISBN - 13:9783540433712

Look for similar items by category:

Reviews

Table of Contents

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.