1 option
Programming Constraint Services : High-Level Programming of Standard and New Constraint Services / by Christian Schulte.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Author/Creator:
- Schulte, Christian, author.
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science. Lecture notes in artificial intelligence ; 2302.
- Lecture Notes in Artificial Intelligence ; 2302
- Language:
- English
- Subjects (All):
- Computer engineering.
- Artificial intelligence.
- Programming languages (Electronic computers).
- Computer programming.
- Algorithms.
- Computer science--Mathematics.
- Computer science.
- Computer Engineering.
- Artificial Intelligence.
- Programming Languages, Compilers, Interpreters.
- Programming Techniques.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Local Subjects:
- Computer Engineering.
- Artificial Intelligence.
- Programming Languages, Compilers, Interpreters.
- Programming Techniques.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Physical Description:
- 1 online resource (XII, 176 pages).
- Edition:
- First edition 2002.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
- System Details:
- text file PDF
- Summary:
- 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.
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-45945-3
- 9783540459453
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.