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 2: Towards
a
Theory
of
Declarative Knowledge
119
Now by Lemma 10
(by ind. hyp., Lemma 2, Th. 7)
(by Lemma 2)
(by (4)).
(by (4))
T
?i
(M(P
i+i
))
QTp M
i
+
I
= 7>(A/)U7> (M)
1
i+l
= 7>(Λί Π Up) U7> (M)
Γ
\
ι ί+1
= Tp-mP,)) U Tp (M)
I « +1
Q
A/(P
t
) U M
= M.
Since M was arbitrary, by the definition of M(P
i + x
) this proves (2), which con-
cludes the
proof.
Note that the theorem does not hold when the assumption that M is sup-
ported in the definition of M(P
t
) is dropped. Indeed, let Ρ be ρ \q. Then
Pj is empty, so Up =0 and Af(Pj) = M
x
= 0. On the other hand M
2
= {p}
whereas
Our purpose in this and the next section is to study the foundation ...
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