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
5:
Declarative Semantics
of
Deductive Databases
209
Proof
of
Lemma
1: First modify the database DB
a
as follows:
R1.
Remove all clauses containing
a
negative premise\B
t
such that
B
t
is in
S;
R2.
Remove all clauses whose heads contain atoms belonging to T;
R3.
From the remaining clauses remove all the negative premises (they are all
satisfied in S);
and let D be the modified database.
Now consider a positive disjunctive database Ε defined as follows:
E
=
DUSU(7nH
a
),
and let
a
subset M of
Η
Ί
be
a
minimal model of E.
Notice that Μ |α
=
S. Indeed, since consequents of clauses from D belong
to //
a
, the only elements from
H
a
"forced" to
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