Programming constraint services : high-level programming of standard and new constraint services
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 sear...
保存先:
| 第一著者: | |
|---|---|
| フォーマット: | Livre numérique |
| 言語: | Anglais |
| 出版事項: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| シリーズ: | Lecture notes in computer science. Lecture notes in artificial intelligence
2302 |
| 主題: | |
| オンライン･アクセス: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 注記: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Programming constraint services, high-level programming of standard and new constraint services, Christian Schulte, 2002, Berlin, Springer, 1 vol. (XII-176 p.), Lecture notes in computer science, 3-540-43371-6 • Programming Constraint Services, Texte imprimé, 9783662168042 |
| LEADER | 04387nam a22004097a 4500 | ||
|---|---|---|---|
| 001 | 969987 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155182668 | ||
| 020 | |a 9783540459453 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 005.11 | ||
| 082 | |a 004 | ||
| 100 | 1 | |a Schulte, Christian, |d 19..- | |
| 245 | 1 | 0 | |a Programming constraint services : |b high-level programming of standard and new constraint services |c Christian Schulte. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science. Lecture notes in artificial intelligence |v 2302 |x 1611-3349 |x 2945-9141 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a 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. | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Langages de programmation | ||
| 650 | |a Ordinateurs | ||
| 650 | |a Intelligence artificielle | ||
| 650 | |a Programmation par contraintes | ||
| 776 | 0 | |0 060407670 |t Programming constraint services |o high-level programming of standard and new constraint services |f Christian Schulte |d 2002 |c Berlin |n Springer |p 1 vol. (XII-176 p.) |s Lecture notes in computer science |z 3-540-43371-6 | |
| 776 | 0 | |t Programming Constraint Services |b Texte imprimé |z 9783662168042 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-45945-6 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-KJWGS54K-G |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750668032 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-45945-6 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754017133 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-45945-6 |z Accès INSA CVL | |
| 997 | |0 969987 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||