Kurs in Logischer Programmierung. (A course in logic programming.)

From MaRDI portal





It is one of the unique features of the book that it does not restrict itself to the description of the programming language Prolog and to the foundations of programming in Prolog. If Prolog is the mostly wide-spread implementation of the logic programming paradigma, it is not the only one and nobody thinks it is the last word in the new discipline of logic programming. Chapters 1 and 2 start with a careful explanation of the idea of declarative programming in Horn logic, a fragment of the first-order predicate logic, and the concepts of the procedural interpretation of Horn clauses, recursion and search trees. The Prolog syntax is described including the list notation. Chapter 3 compares nonprocedural declarative programming in Horn logic with the extralogical and control features of Prolog. This chapter describes Prolog's arithmetic, extralogical built-in predicates for input/output operations, data types testing predicates and predicates analyzing/synthesizing terms. Metalogical predicates testing bindings of variables, unifiability/identity of terms and metavariables used by the built-in predicate ``call are discussed in detail.. Then the cut operator is introduced. The chapter gives a very clear exposition of negation as failure. Its relationship to the negation in logic is examined and it is stressed that negation as failure is rather an operator in second-order logic different from the ordinary first-order negation. The chapter is concluded by a description of the built-in predicates `findall', `bagof', `setof' handling sets of solutions. Chapter 4 deals with advanced Prolog programming techniques. Loops, accumulators and difference lists are presented demonstrating by this way the power of Prolog. In the chapters 5 and 6 the syntax of the predicate logic is discussed in connection with knowledge representation and declarative semantics of pure logic programs. The logical inference is described in detail on the basis of the resolution method with unification. The completeness of the resolution method is discussed in general and the SLD-resolution underlying the procedural interpretation of logic programs is explained. A short discussion of declarative and procedural semantics of Prolog concludes chapter 6. Chapters 7-9 are devoted to applications of Prolog. Chapter 7 describes several algorithms of state space search, Chapter 8 presents logical grammars. It covers e.g. axiomatization of context-free languages, Definite Clause Grammars and their application to natural language processing. The last chapter is one of the highlights of the book. It gives an introduction to metaprogramming. It describes the concepts of metainterpreters and partial evaluation, and their application as tools for fast prototyping and expert systems building. The book is concluded by an annotated bibliography and index. The book is well-written in a concise logical style. It does not assume any previous knowledge of logic or programming. It can be recommended as a text for an undergraduate/first graduate course on Prolog and logic programming. It is of interest for students and specialists in various branches of Computer science.












This page was built for publication: Kurs in Logischer Programmierung. (A course in logic programming.)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3998191)