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
214 Przymusinski
imality condition in the definition of a model of prioritized circumscription to
show that models of prioritized circumscription must satisfy the conditions (i)
and (ii) in Lemma 1 and must therefore be constructed exactly in the same way
as the models constructed in the proof of Theorem 4. This shows that every
such model must be perfect.
COROLLARY
1
Suppose that {P
Q
,...,P
n
} and {T
Q9
...,T
m
} are two stratifications of the same
database DB. Then M is a model of CIRC(DB,P
0
> ... > P
n
) if and only if it
is a model of CIRC(DB,r
o
> ... > TJ.
Proof:
We know that the definition of a perfect model does not depend on the
choice o
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