rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Programming Constraint Services
    sub title: High-Level Programming of Standard and New Constraint Services
  name:
    name part: Schulte, Christian.
    role:
      role term: creator
    role:
      role term: author.
    role:
      role term: aut
    role:
      role term: http://id.loc.gov/vocabulary/relators/aut
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2002
    edition: 1st ed. 2002.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XII, 176 p. online resource.
  abstract: 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.
  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.
  note: by Christian Schulte.
  subject:
    topic: Computer engineering
  subject:
    topic: Artificial intelligence
  subject:
    topic: Programming languages (Electronic computers)
  subject:
    topic: Computer programming
  subject:
    topic: Algorithms
  subject:
    topic: Computer science-Mathematics
  subject:
    topic: Computer Engineering
  subject:
    topic: Artificial Intelligence
  subject:
    topic: Programming Languages, Compilers, Interpreters
  subject:
    topic: Programming Techniques
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Discrete Mathematics in Computer Science
  classification: TK7885-7895
  classification: 621.39
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Artificial Intelligence ; 2302
  identifier: 9783540459453
  identifier: https://doi.org/10.1007/3-540-45945-6
  record info:
    record creation date: 121227
    record change date: 20191027131309.0
    record identifier: 978-3-540-45945-3