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
Chapter 2: Towards
a
Theory
of
Declarative Knowledge 107
We
now
define
a
standard interpretation
of Ρ by
putting
Model Theory
of
Stratified
Programs
Consider
a
program
Ρ
stratified
by
It
is
time
to
relate
the
above results
to
logic programs.
(by symmetry)
(by Lemma
9)
Proof:
We
have
THEOREM
3
Suppose that
T
x
and T
2
are
independent. Then
for all /
The lemma implies
the
following theorem.
Suppose
now the
claim holds
for
some
k > 1. We
then have
(1) by an
obvious
induction.
By
symmetry
(2)
holds
as
well, which proves
the
lemma.
Proof:
Suppose that
/ C J C T
2
\
ω(7). Note that
LEMMA
9
Suppose that
T
x
and T
2
are
independent. Then
for all it > ...
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