Foundations of Equational Logic Programming
| Author/creator | Hölldobler, Steffen Author |
| Format | Electronic |
| Publication Info | New York : Springer |
| Description | 264 p. 09.210 x 06.140 in. |
| Supplemental Content | Full text available from SpringerLINK Lecture Notes in Computer Science |
| Supplemental Content | Full text available from Springer Books |
| Subjects |
| Series | Lecture Notes in Computer Science Ser. |
| Summary | Annotation 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. |
| Access restriction | Available only to authorized users. |
| Technical details | Mode of access: World Wide Web |
| Genre/form | Electronic books. |
| ISBN | 9783540515333 |
| ISBN | 354051533X (Perfect) Active Record |
| Standard identifier# | 9783540515333 |
| Stock number | 00024965 |
Availability
| Library | Location | Call Number | Status | Item Actions |
|---|---|---|---|---|
| Electronic Resources | ✔ Available |