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
117
Proof:
Straightforward—use the bubble sort.
We now complete the proof of Theorem 11. Let ß
p
...,ß
w
and
Q\,...,Q'
n
be two stratifications of Ρ consisting of clusters. If the relative order of two
clusters Q
i
and Q. in these two sequences differs, then by Lemma 12 Q
i
and Q-
are unrelated. Then by Theorem 4, T
Q
and T
Q
are independent. This together
with the previous lemma concludes the
proof.
An
Alternative Characterization
of M
p
The definition of the model M
p
is somewhat operational in the sense that it is
defined in terms of the iterations of the operators T
p
. We now offer another,
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