Foundations of Deductive Databases and Logic Programming
M. Kaufmann Publishers, 1988 - Computers - 746 pages
This volume explores the close relationship between deductive databases and logic programming and the foundational issues they share.
What people are saying - Write a review
We haven't found any reviews in the usual places.
PART IIFundamental Issues
Towards a Theory of Declarative Knowledge
17 other sections not shown
Other editions - View all
algorithm allowed answer appear applied assume assumption axioms base body bounded called clause closed comp(P complete computation condition consequence consider consistent constants constraints contains correct corresponding cost Deductive Databases defined definition delete denote depend derivation described domain equality equation equivalent evaluation example exists expression extended fact fails false finite fixed point formula function give given ground atoms head Herbrand model Horn clauses implies independent integrity interpreter language least Lemma literal Lloyd Logic Programming meaning method minimal model Minker negation as failure negative node Note obtained occur operator perfect positive possible predicate problem procedure Prolog proof prove provides query reason recursive relation respect restricted result rule satisfies selection semantics step stratified substitution Suppose symbols Theorem theory tion transformation tree true tuples University update variables