| 書目名稱 | Programming Constraint Services |
| 副標(biāo)題 | High-Level Programmi |
| 編輯 | Christian Schulte |
| 視頻video | http://file.papertrans.cn/761/760044/760044.mp4 |
| 概述 | Includes supplementary material: |
| 叢書名稱 | Lecture Notes in Computer Science |
| 圖書封面 |  |
| 描述 | 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 consid |
| 出版日期 | Book 2002 |
| 關(guān)鍵詞 | AI Planning; Combinatorial Optimization; Constraint Combinators; Constraint Logical Programming; Constra |
| 版次 | 1 |
| doi | https://doi.org/10.1007/3-540-45945-6 |
| isbn_softcover | 978-3-540-43371-2 |
| isbn_ebook | 978-3-540-45945-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag Berlin Heidelberg 2002 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-17 23:39
發(fā)表于 2025-3-21 18:51:08
