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
414
Henschen
and
Park
3. MIG(JC) ENEMY(JC),
4.
ι
ENEMY(fl)}.
Additional resolutions in the compile phase due to this update are
5.
(3,4)-!MIG(a)
6. (1,5) PHANTOM(a)
7.
(2,6) FRIEND(ö)
Thus,
FRIEND(ö) is true, as before. Since FRIEND(a) subsumes FRIEND(a)
MIG(a), NHr[FRIEND] and PSUB[NHr[FRIEND]] are empty. In addition, it
is necessary to add PHANTOM(a) to the RDB.
We observe, then, that in Representation 2 with a reduced NH set, the
evaluator apparently must perform some of the deductions that were
eliminated by the reduction, as in the resolution of
j
ENEMY(a) with clause
3.
The full NH set already contains a clause derived from claus ...
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