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
384
Manchanda and Warren
on p
d
. Therefore, the dynamic meaning of D is unchanged in Λ/' i.e. M
d
(D) =
M'
d
(D).
Then clearly M'
d
(p
d
)(c) CM
d
(p
d
)(c) for all c ΕH
c
n
.
Now we show that Λ/' is a model of Δ. Since Λ/' is identical to Ν except on the
dynamic meaning of p
d
, we only have to show that Λ/' satisfies every update
rule in Δ. Consider any update rule τ in Δ. Three cases arise.
Case (a): τ is the given update rule (pß)) D. Then clearly, τ is true in Λ/'.
If τ is not the given update rule, then it is some other update rule (q
d
(t))
Case (b): Β contains a dynamic predicate that depends on p
d
. Since τ is true in
N, we have M
d
(B[s]) C M
d
(q
d
(t)[s]). ...
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