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
410
Henschen
and
Park
3.
Ql(x,y) +R2(x,y)
m + 1. Ql(x,y) Rm(x,y)
Then clauses obtained by resolving clause 1 with a clause from 2 through
m + 1 other than clause i + 1 can be excluded from NH[/?i].
This theorem says that a forward AND-branch can also be treated indepen-
dently as a forward OR-branch.
Backward
AND-Branch
Reduction
LEMMA
3
Let CDB contain
l.PW-ß^v... νβ(χ,α„)
2.
Q(x
v
x
2
) & Q(x
2
,x
3
) -+R(x
v
x
3
).
Then clauses derived from 1 and 2 which contain more than one R are not
needed to compute Indef[/?(c7
,c2)].
The significant effect of Lemma 3 is illustrated with the following ex-
ample. Let CDB =
{\.P(x)^Q(x,a
l
)yQ(x,a
2
)
2.
Q(x
v
x
2
) & ...
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