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
129
previous step
iff (by clause (3) of Definition 18)
I
p
(
-\B, -iB,S U S
T
_,β) for every negative leaf
-iB of Τ
iff (by rules (1) and (2) of 18)
7
p
(root(T),T,S).
(2)
"
We now give the theorem that, in effect, says the interpreter unambiguously
"computes" the standard model M
p
of P, when Ρ is stratified. The statement
of the theorem may at first seem a bit arcane, but recall that the definition of I
p
does not in general uniquely determine a relation on Ü x IT x 2
U
. We are
about to show, under the assumption that Ρ is stratified, that if the definition of
I
p
is satisfied on Ü x IT x 2
U
, the ...
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