No label defined (Q3678638)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3900124
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3900124

      Statements

      0 references
      0 references
      1985
      0 references
      Prolog
      0 references
      logic programming
      0 references
      Metamorphosis grammars
      0 references
      Prolog interpreter
      0 references
      Even the Prolog has been chosen by the Japanese as the programming language for the so-called ''fifth-generation computers'', there are not (yet) many books about this language or its theoretical basis, the logic programming. The reason is, probably, that the Japanese decision was, in some way, unexpected. Only the few clear-minded computer scientists which worked into the field were prepared for this impact. Among them are, certainly, the authors of this book, belonging to the excellent Polish research teams from the Warsaw specialized institutes (in this case, the Institute of Informatics). They have a great experience in Prolog applications. The opportunity to make public their experience materialized in the present book, a high-competence practical guide for the Prolog programmers. Prolog, as a non-conventional logic programming language, can be classified as a descriptive language, as opposed to prescriptive (or imperative) languages such as Pascal, C or Ada. However, in practice, Prolog can be treated as a procedural language. Prolog is not standardized: the most widespread dialect is Prolog-10, originally implemented by David H. D. Warren for DEC-10 computers. (It is well-known that the Prolog author is Alain Colmerauer.) In the present book is described a variant of this dialect, based on an interpreter written in Pascal especially for this book. Chapter 1, An introduction to Prolog, presents data structures, the form of the Prolog ''statements'' (clauses), the general form of a procedure, along with the technical specific problems (unification, occur check, backtracking, etc.). Chapter 2 explains Prolog in terms of logic. The aspects of automated theorem proving (resolution, Horn clauses, strategies) are presented in an intuitive manner. A full appreciation of the close relation between Prolog and logic (programming) is possible only from the viewpoint of a solid background in mathematical logic. [A very good introduction to the Prolog formal semantics is \textit{J. W. Lloyd}'s book: Foundations of logic programming (Berlin, 1984; Zbl 0547.68005)]. Chapter 3 (Metamorphosis grammars: A powerful extension) presents the Prolog approach to parsing problems. Metamorphosis grammars correspond to Prolog programs which implement a very general parsing strategy: non- deterministic top-down parsing with backtracking. Even parsing algorithms for restricted classes of context-free grammars can be conveniently programmed in Prolog without metamorphosis grammars, these ones are by themselves as powerful as attribute grammars (Knuth, 1968) or two-level grammars (van Vijngaarden, 1976). Parameters and conditions/actions make it possible to construct an intuitively appealing, concise and readable metamorphosis grammar of any existing programming language, and of reasonable subsets of natural languages, capturing semantics as well as syntax. Chapter 4 summarizes some of the Prolog programming techniques. The main advantages are: systematic top-down design of programs, modularity, clean interfaces. Two examples, unbalanced binary search trees and one-day linear lists, are analysed as an illustration of the methods of implementing recursive data structures in Prolog. Representation of data structures by clauses is briefly discussed, the array representation as procedures consisting of unit clauses (one clause for each sequence of subscripts and the corresponding value) is presented. Very practical and useful Prolog programming hints and a consistent paragraph which discusses, in detail, interesting examples are included. Chapter 5 is, in fact, a reference manual for the implementation of the Prolog version described in Chapter 7 and in the appendices (which contain complete listings). The supported dialect is very similar to Prolog-10 [see, for instance, the classic book of \textit{W. F. Clocksin} and \textit{C. S. Mellish}: Programming in Prolog (Berlin, 1981; Zbl 0466.68009)]. The user communicates with the presented Prolog version through an interactive interface. Chapter 6 is a brief survey on the implementation techniques specific to Prolog. Chapter 7 provides a detailed and complete case study of how the basic principles can be applied in practice (on the Prolog implementation presented in the book). The Prolog interpreter is written in Pascal language because this language is easy to understand, well known and generally available. Chapter 8 presents two very interesting case studies for Prolog programming: planning (with the complete listing of the D. H. D. Warren's program WARPLAN) and relational data bases applications (the listing of the Toy-Sequel interpreter). Chapter 9 is written by Janusz S. Bień (who also did most of the bibliography). It briefly outlines the characteristic features of several Prolog dialects. The appendices contain the complete listings for the (1) Toy-Prolog interpreter; (2) Kernel File; (3) ''Bootstrapper''; (4) User interface and utilities; (5) Three useful programs: a simple editor, a primitive tracing tool, a program structure analyser with analyser analysed. The book is an eloquent illustration of the authors' high professionalism. Their large experience in the field allowed to present the general and particular problems of the Prolog programming in an elegant and learnable (by examples) manner. The Prolog interpreter and programs presented by complete listings fill 38 \% in the book space. There is no hint to whom the book is addressing. We are deeply convinced that it should have to be on everyone's desk related to computer.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references