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
684
Sagiv
and, hence, there
are
four possible combinations
of
unifying
the
atoms
in the
left-hand side
of τ
with heads
of
rules.
So let
G(x
0
,y
0
),
G(y
0
,z
0
)
be
the
instantiated left-hand side
of τ, and
consider
the
following four com-
binations.
Combination
1:
G(x
0
,y
0
)
is
unified with
the
head
of r and, as a
result,
the
fol-
lowing ground atoms (i.e., those from
the
body
of r) are in d:
G(x
0
,y
x
)
9
G(y
x
,y
0
),A(y
v
w
0
)
and G(y
0
,z
0
)
is
unified with
the
head
of the
trivial rule, which adds
the
fol-
lowing atom
to d:
G(y
09
z
0
)
Now
Τ =}
should
be
applied
to d and,
actually, only
the
following applica-
tion
is
possible.
The
left-hand side
of τ is
instantiate ...
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