| 書(shū)目名稱(chēng) | Foundations of Equational Logic Programming | | 編輯 | Steffen H?lldobler | | 視頻video | http://file.papertrans.cn/347/346961/346961.mp4 | | 叢書(shū)名稱(chēng) | Lecture Notes in Computer Science | | 圖書(shū)封面 |  | | 描述 | Equations play a vital role in many fields of mathematics, computer science, and artificial intelligence. Therefore, many proposals have been made to integrate equational, functional, and logic programming. This book presents the foundations of equational logic programming. After generalizing logic programming by augmenting programs with a conditional equational theory, the author defines a unifying framework for logic programming, equation solving, universal unification, and term rewriting. Within this framework many known results are developed. In particular, a presentation of the least model and the fixpoint semantics of equational logic programs is followed by a rigorous proof of the soundness and the strong completeness of various proof techniques: SLDE-resolution, where a universal unification procedure replaces the traditional unification algorithm; linear paramodulation and special forms of it such as rewriting and narrowing; complete sets of transformations for conditional equational theories; and lazy resolution combined with any complete set of inference rules for conditional equational theories. | | 出版日期 | Book 1989 | | 關(guān)鍵詞 | Beweistechniken; Lazy Resolution; Logisches Programmieren; Proof Techniques; SLDE-Resolution; Semantics f | | 版次 | 1 | | doi | https://doi.org/10.1007/BFb0015791 | | isbn_softcover | 978-3-540-51533-3 | | isbn_ebook | 978-3-540-48226-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 | | issn_series | 0302-9743 | | copyright | Springer-Verlag Berlin Heidelberg 1989 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-12 19:30
發(fā)表于 2025-3-21 19:32:42
