---

＜電子ブック＞
Foundations of Equational Logic Programming / by Steffen Hölldobler
(Lecture Notes in Artificial Intelligence. ISSN:29459141 ; 353)

版	1st ed. 1989.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1989
本文言語	英語
大きさ	XII, 256 p : online resource
著者標目	*Hölldobler, Steffen author SpringerLink (Online service)
件　名	LCSH:Artificial intelligence LCSH:Machine theory LCSH:Compilers (Computer programs) FREE:Artificial Intelligence FREE:Formal Languages and Automata Theory FREE:Compilers and Interpreters
一般注記	Preliminaries -- Equational Logic Programming -- Universal Unification -- SLDE-Resolution -- Paramodulation -- Universal Unification by Complete Sets of Transformations -- Lazy Resolution and Complete Sets of Inference Rules for Horn Equational Theories -- Conclusion 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 HTTP:URL=https://doi.org/10.1007/BFb0015791

 類似資料