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
100
Apt,
Blair,
and
Walker
3.
Ρ has two different minimal models: {A} and {B}.
Several results concerning positive programs depend critically on the properties
(a),
(b), and (c). Fortunately, a very important property remains true.
LEMMA
2
Let Ρ be a program. Then / is a model of Ρ iff T
P
(I) C I.
Proof:
Essentially the same as the proof for programs without negation; see
Lloyd [1984].
This simple fact saves the whole approach based on the analysis of the
operator T
p
\ Further, the notion of a supported model can also be naturally ex-
pressed in terms of the operator T
p
. We have the following simple result.
LEMMA
3
Let Ρ be a program. The
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