| 書(shū)目名稱 | Foundations of Logic Programming | | 編輯 | John Wylie Lloyd | | 視頻video | http://file.papertrans.cn/348/347045/347045.mp4 | | 叢書(shū)名稱 | Symbolic Computation | | 圖書(shū)封面 |  | | 描述 | This book gives an account oC the mathematical Coundations oC logic programming. I have attempted to make the book selC-contained by including prooCs of almost all the results needed. The only prerequisites are some Camiliarity with a logic programming language, such as PROLOG, and a certain mathematical maturity. For example, the reader should be Camiliar with induction arguments and be comCortable manipulating logical expressions. Also the last chapter assumes some acquaintance with the elementary aspects of metric spaces, especially properties oC continuous mappings and compact spaces. Chapter 1 presents the declarative aspects of logic programming. This chapter contains the basic material Crom first order logic and fixpoint theory which will be required. The main concepts discussed here are those oC a logic program, model, correct answer substitution and fixpoint. Also the unification algorithm is discussed in some detail. Chapter 2 is concerned with the procedural semantics oC logic programs. The declarative concepts are implemented by means oC a specialized Corm oC resolution, called SLD-resolution. The main results of this chapter concern the soundness and completeness oC SL | | 出版日期 | Book 19841st edition | | 關(guān)鍵詞 | Mathematica; Resolution; algorithms; artificial intelligence; intelligence; logic; logic programming; progr | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-642-96826-6 | | isbn_ebook | 978-3-642-96826-6 | | copyright | J. W. Lloyd 1984 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-10 18:41
發(fā)表于 2025-3-21 17:57:41
