An introduction to logic programming through Prolog
著者
書誌事項
An introduction to logic programming through Prolog
（Prentice-Hall International series in computer science）
Prentice Hall, c1996
- : pbk
大学図書館所蔵 件 / 全12件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and index
内容説明・目次
内容説明
This is one of the few texts that combines three essential theses in the study of logic programming: the logic that gives logic programs their unique character: the practice of programming effectively using the logic; and the efficient implementation of logic programming on computers. The book begins with a gentle introduction to logic programming using a number of simple examples, followed by a concise and self-contained account of the logic behind Prolog programming. This leads to a discussion of methods of writing programs so that the process of deriving anwers from them is as efficient as possible. The techniques are illustrated by practical examples and the final part of the book explains how logic programming can be implented efficiently. It includes source code for a small but Complete Prolog implementation written in Pascal. The implementation is capable of running all the programs presented in the book, and is available via the Internet.
目次
Introduction. Programming with Relations. Recursive Structures. The Meaning of Logic Programs. Inference Rules. Unification and Resolution, SLD -Resolution. SLD-Resolution and Answer Substitutions. Negation as Failure. Searching Problems. Parsing Evaluating and Simplifying Expressions. Hardware simulations. Program Transformation. About PicoProlog. Implementing Depth-First Search, Representing Terms and Substitutions. Implementation Notes. Interpreter Optimizations. In Conclusion. Bibliography, Index.
「Nielsen BookData」 より
