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 16: Equivalences of Logic Programs 641
PROPOSITION 5
If Ρ is subsumption-equivalent to a program that is locally deterministic and
such that no clause has local variables, then T
p
is down-distributive.
Proof:
By Theorem 3 T
p
is down-continuous. Thus, it suffices to prove that
T
P
(X ΠΥ) = T
P
{X) Π Τ
Ρ
(Υ) VX, Y. Further, by Theorem 2, it suffices to con-
sider only the case where Ρ is locally deterministic and such that no clause has
local variables. Let X, Y QHB. Since T
p
is monotonie, VX, Υ T
P
(X Π Y) C
Tp(X) Π Τρ(Υ). Suppose Α Ε Τ
Ρ
(Χ) Π Τ
Ρ
(Υ). Then, since there is only one in-
stance of a clause of the form A
B
v
...,B
n
,
we have that {B
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