Skip to Main Content
Foundations of Deductive Databases and Logic Programming
book

Foundations of Deductive Databases and Logic Programming

by Jack Minker
May 2014
Intermediate to advanced content levelIntermediate to advanced
752 pages
35h 3m
English
Morgan Kaufmann
Content preview from Foundations of Deductive Databases and Logic Programming
Chapter 12: Performance Evaluation of Logic Programs 441
The
Methods
We shall use the same example for most of the methods. The intensional
database and query are:
Rl ancestor(X,Y) :- parent(X,Z),ancestor(Z,Y).
R2 ancestor(X,Y) :- parent(X,Y).
R3 query(X) :- ancestor(aa,X).
The extensional database is:
parent(a,aa).
parent(a,ab).
parent(aa,aaa).
parent(aa,aab).
parent(aaa,aaaa).
parent(c,ca).
The material in this section is taken from Bancilhon and Ramakrishnan
[1986],
and the reader should refer to it for detailed definitions (although we
now present a few important definitions). A rule in the intensional database is
range restricted if ever ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Concepts and Semantics of Programming Languages 1

Concepts and Semantics of Programming Languages 1

Therese Hardin, Mathieu Jaume, Francois Pessaux, Veronique Viguie Donzeau-Gouge
Handbook of Constraint Programming

Handbook of Constraint Programming

Francesca Rossi, Peter van Beek, Toby Walsh

Publisher Resources

ISBN: 9781483221120