| 書(shū)目名稱(chēng) | Parallel and Constraint Logic Programming | | 副標(biāo)題 | An Introduction to L | | 編輯 | Ioannis Vlahavas,Panagiotis Tsarchopoulos,Ilias Sa | | 視頻video | http://file.papertrans.cn/742/741062/741062.mp4 | | 叢書(shū)名稱(chēng) | The Springer International Series in Engineering and Computer Science | | 圖書(shū)封面 |  | | 描述 | Constraint Logic Programming (CLP), an area of extreme researchinterest in recent years, extends the semantics of Prolog in such away that the combinatorial explosion, a characteristic of mostproblems in the field of Artificial Intelligence, can be tackledefficiently. By employing solvers dedicated to each domain instead ofthe unification algorithm, CLP drastically reduces the search space ofthe problem, which leads to increased efficiency in the execution oflogic programs. CLP offers the possibility of solving complexcombinatorial problems in an efficient way, and at the same timemaintains the advantages offered by the declarativeness of logicprogramming. .The aim of this book is to present parallel and constraint logicprogramming, offering a basic understanding of the two fields to thereader new to the area. The first part of the book gives anintroduction to the fundamental aspects of conventional logicprogramming which is necessary for understanding the parts thatfollow. The second part includes an introduction to parallel logicprogramming, architectures and implementations proposed in the area.Finally, the third part presents the principles of constraint logicprogramming. The l | | 出版日期 | Book 1998 | | 關(guān)鍵詞 | CLIPS; Constraint; Eclipse; Prolog; algorithms; artificial intelligence; intelligence; programming; semantic | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4615-5119-5 | | isbn_softcover | 978-1-4613-7329-2 | | isbn_ebook | 978-1-4615-5119-5Series ISSN 0893-3405 | | issn_series | 0893-3405 | | copyright | Springer Science+Business Media New York 1998 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-15 22:52
發(fā)表于 2025-3-21 19:45:49
