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
112
Apt, Blair,
and
Walker
THEOREM 8
Μ ρ is a minimal model of P.
Note that in view of Lemmas 6 and 2 and Theorems 4 and 6, M
p
is a model
of Ρ whenever the sequence P
v
...,P
n
defines new relations. But to prove that
Μ ρ is supported we also need Lemma 7, which requires that all T
p
are grow-
ing. This condition is satisfied (see Theorem 5) if each P. is semi-positive.
Now it is easy to see that if the sequence P
v
...,P
n
defines new relations and
each P. is semi-positive, then Ρ is stratified by Ρ = P
x
Ù ... ÙP
n
. In other
words, our general results on nonmonotonic operators do not allow us to con-
clude existence of supported models for other tha ...
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