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
686 Sagiv
Note that in this case, the tgd τ cannot be applied to d to produce new atoms.
But when r is applied nonrecursively to d
9
the DB r
n
(d) becomes equal to
G(y
0
,z
0
),
G(y
0
,w
0
)
To see that G(y
0
,z
0
) is in r
n
(d), note that this atom was unified with the head
of r and the instantiated body became a part of d. To see that G(y
0
,w
0
) is in
r
n
(d),
instantiate the variables of r as follows. Instantiate χ to y
0
, y to y
p
and
both ζ and w to w
0
.
The ground atoms G(y
0
,w
0
) and C(w
0
) show that (d,r
n
(d,)) does not violate
τ when the left-hand side is instantiated to G(y
0
,z
0
). Thus, r preserves τ.
Determining
Equivalence
In this section we will show ho ...
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