Angielski
This is the second edition of the first book to give an account of the mathematical foundations of Logic Programming. Its purpose is to collect, in a unified and comprehensive manner, the basic theoretical results of Logic Programming, which have previously only been available in widely scattered research papers. In addition to presenting the technical results, the book also contains many illustrative examples. Many of the examples and problems are part of the folklore of Logic Programming and are not easily obtainable elsewhere. The second edition contains about 70 % more material than the first edition. There are two new chapters, one on a more general class of programs in which the body of a program statement can be an arbitrary first order formula, and one on Deductive Database Systems. Further material on negation has been added to the third chapter. In addition, the problem sections of each chapter have been expanded so that there are now over 100 problems. The book is intended to be self-contained, the only prerequisites being some familarity with PROLOG and knowledge of some basic undergraduate mathematics. The book is aimed at researchers and graduate students in Logic Programming, Artificial Intelligence and Database Systems. The material is suitable either as a reference book for researchers or as a text book for a graduate course on the theoretical aspects of Logic Programming and Deductive Database Systems.
