Essentials of logic programming
Author(s)
Bibliographic Information
Essentials of logic programming
(Graduate texts in computer science, 1)
Clarendon Press , Oxford University Press, 1990
- :
- : pbk
Available at / 20 libraries
-
Hokkaido University, Library, Graduate School of Science, Faculty of Science and School of Science図書
DC19:005.1/H6792070183877
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
- Volume
-
: ISBN 9780198538202
Description
Logic programming has developed into a broad discipline within computing science. Besides its basic role as a declarative programming language, it is also contributing significantly to such fields as artificial intelligence, new-generation computing, software engineering and deductive databases. This book presents the fundamentals of logic programming from both practical and theoretical viewpoints. It covers various extensions of the formalism, its relationship to Prolog, its formal semantics and its applications to program analysis and transformation. The text is illustrated with numerous diagrams. There are two distinguishing features of the book designed to make it adaptable to various forms of usage and accessible to various audiences. The material is organized into sixty modular themes, permitting many kinds of course to be based upon it and it includes nearly seventy pages of detailed answers to all of the exercises posed in the themes.
Table of Contents
- Background (Themes 1-4)
- Overview (Themes 5-8)
- First-order logic (Themes 9-13)
- Clausal-form logic (Themes 14-18)
- Problem solving (Themes 19-22)
- The Herbrand domain (Themes 23-25)
- Resolution (Themes 26-30)
- Programming with SLD-resolution (Themes 31-39)
- Semantics of definite programs (Themes 48-53)
- Programming with finite failure (Themes 54-58)
- Verifying programs (Themes 59-60)
- Answers to exercises.
- Volume
-
: pbk ISBN 9780198538325
Description
Logic programming has developed into a broad discipline within computing science. Besides its basic role as a declarative programming language, it is also contributing significantly to such fields as artificial intelligence, new-generation computing, software engineering and deductive databases.
This new book presents the fundamentals of logic programming from both practical and theoretical viewpoints. It covers various extensions of the formalism, its relationship to Prolog, its formal semantics and its applications to program analysis and transformation. The text is illustrated with numerous diagrams.
There are two distinguishing features of the book designed to make it adaptable to various forms of usage and accessible to various audiences. The material is organized into sixty modular themes, permitting many kinds of course to be based upon it; and it includes nearly seventy pages of detailed answers to all of the exercises posed in the themes.
Table of Contents
- Preface
- Acknowledgements
- Background (Themes 1-4)
- Overview (Themes 5-8)
- First-order logic (Themes 9-13)
- Clausal-form logic (Themes 14-18)
- Problem solving (Themes 19-22)
- The Herbrand domain (Themes 23-25)
- Resolution (Themes 26-30)
- Programming with SLD-resolution (Themes 31-39)
- Semantics of definite programs (Themes 48-53)
- Programming with finite failure (Themes 54-58)
- Verifying programs (Themes 59-60)
- Answers to exercises
- Index
by "Nielsen BookData"