Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Programming Constraint Services

High-Level Programming of Standard and New Constraint Services

  • Book
  • © 2002

Overview

Editors:
  1. Christian Schulte

    1. Programming Systems Laboratory, Saarland University, Saarbrücken, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (15 chapters)

  1. Front Matter

    Pages I-XII
    Download chapter PDF

  2. Introduction

    Pages 1-7

  3. Constraint Programming

    Pages 9-14

  4. Introducing Oz Light

    Pages 15-27

  5. Spaces for Search

    Pages 29-44

  6. Search Engines

    Pages 45-54

  7. Best-Solution Search

    Pages 55-58

  8. Recomputation

    Pages 59-67

  9. Oz Explorer:Visual Search

    Pages 69-78

  10. Distributed Search

    Pages 79-91

  11. Spaces for Combinators

    Pages 93-104

  12. Constraint Combinators

    Pages 105-116

  13. Implementing Oz Light

    Pages 117-120

  14. Implementing Spaces

    Pages 121-141

  15. Other Approaches to Search

    Pages 143-152

  16. Conclusion

    Pages 153-156

  17. Back Matter

    Pages 157-176
    Download chapter PDF
Back to top

Keywords

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.

Editors and Affiliations

  • Programming Systems Laboratory, Saarland University, Saarbrücken, Germany

    Christian Schulte

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation