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 11
:
Compiling
the
GCWA
433
KN1
ν KP1, and nhj =
[R($l,$2)
ν KN2 ν
KP2]%,
where
KP1
contains
Q($3,$4) and/or
R($5,$6),
KN2 = KN1 ν -,
Q($3,$4)
or KN1
\^R($5,$6),
KP2
= (KP1 ι
Q($3,$4))
ν
S(x,y)
or
(KP1
n
R($5,$6))
ν
5(jc,y).
Proof of Theorem 11
Notice that
Κ
does
not
contain
a
negative literal over
P,
since
DB is
non-recursive.
Case
1:
Suppose
no
clause contains
a
literal over
P.
Then
CDB has no
clauses containing more than
one
positive literal over
P, but of
course there
will
be
some clause containing exactly
one
such literal.
Let CL be
such
a
clause.
By
resolving
CL and
P(x
v
x
2
,y
]
y
2
) Q(x
x
,x
2
,z), each literal over
Ρ
in
CI can be
replace ...
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