Matches in Harvard for { <http://id.lib.harvard.edu/aleph/001817784/catalog> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- catalog abstract ""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."--Publisher's web site.".
- catalog contributor b2611481.
- catalog created "c1989.".
- catalog date "1989".
- catalog date "c1989.".
- catalog dateCopyrighted "c1989.".
- catalog description ""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."--Publisher's web site.".
- catalog description "Includes bibliographical references.".
- catalog extent "x, 250 p. :".
- catalog hasFormat "Foundations of equational logic programming.".
- catalog identifier "038751533X (U.S.) :".
- catalog isFormatOf "Foundations of equational logic programming.".
- catalog isPartOf "Lecture notes in computer science ; 353. Lecture notes in artificial intelligence".
- catalog isPartOf "Lecture notes in computer science ; 353.".
- catalog isPartOf "Lecture notes in computer science. Lecture notes in artificial intelligence.".
- catalog issued "1989".
- catalog issued "c1989.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer-Verlag,".
- catalog relation "Foundations of equational logic programming.".
- catalog subject "006.3 20".
- catalog subject "Logic programming.".
- catalog subject "QA76.63 .H65 1989".
- catalog title "Foundations of equational logic programming / Steffen Holldobler.".
- catalog type "text".