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
Shepherdson
models of comp(P) are models of P, so all the classes of models described are
contained in the class of 3-valued models of P. Since they all contain the class
of 2-valued Herbrand models of comp(P), it is enough to show that if Q is true
in all 2-valued Herbrand models of comp(P), it is true in all 3-valued models of
P.
The hypothesis implies that Q is true in lfp(T
p
). If
Q is 3
Xl
. . . 3x
m
(A
1
(x
1
, . . .
Γ
) Λ . . . Λ A
s
(x
1
, . . . , x
r
) )
then
A
1
(t
iy
. . . ,
t
r
) Λ · · · Λ A
s
(t
lf
. . . ,
t
r
)
is true in lfp(T
p
) for some ground terms t
p
...,t
r
. Since lfp(T
p
) = T
p
fco all the
A
s
(tj,...,t
r
) are in T
p
fn for some finite n. By induction
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