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
124
Apt,
Blair,
and
Walker
First,
in the
case
of
program
P
2
Ρ
should indeed prove
ρ
since there
is no
proof
of q. It is
instructive
to
explicitly
see
the
considerations
in
building
an
implication tree
to
prove
ρ
using
P
v
Step
1:
Ρ
q
r
is
an
initial segment
of an
implication tree,
r is a
positive leaf that
is
also
a
fact
in
P
v
Thus,
r is
proved.
Step
2:
There
are two
possibilities
for
extending
the
initial segment
of
Step
1.
(a)
(b)
Ρ
Ρ
q
r q r
p
\S
Alternative
(a) is not an
initial segment
of any
loop-free implication tree.
Hence, there
is no
need
to
bother trying
to
prove
ρ
using alternative
(a). Now,
to
use (b) we
need
to
show that ther
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