This new book presents the fundamentals of logic programming from both practical and theoretical viewpoints, covering various extensions of the formalism, its relationship to Prolog, its formal semantics and its applications to program analysis and transformation.

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

Christopher John HoggerSenior Lecturer in Computing, Imperial College, London

This book should be of interest to any student in computer science.Zbl. Math.