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
696 Sagiv
pared
to P, it
would have been impossible
to
infer P
f
(bQ)C P(bQ)). Thus,
we
have shown that P^does
not
have
any
redundant rule.
Now suppose that some rule
r of Pj
(i.e.,
the
final program)
has a
redun-
dant atom
α in its
body.
Ρ
denotes
the
program
at the
beginning
of the
itera-
tions
in
which
α was
considered
for
deletion.
Let h be the
head
of r, and let b
and
bj be its
bodies
in Ρ and Pp
respectively (note that every atom
of
£y
is
also
in
b). The
bodies
and b are
obtained from
iy and b,
respectively,
by
deleting
a.
Let θ be a
one-to-one mapping
of all the
variables
of r to
constants
not al-
ready
in r or P.
Since
α has not
been delete ...
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