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
638
Mäher
For some properties of the function T
p
we are able to characterize syntac-
tically those sets of clauses Ρ such that the property holds. These results,
when taken with the obvious algorithm for computing the canonical form of a
program, will mean that the presence or absence of such properties can be
determined simply and without the need to deal directly with the functions.
Theorem 2 greatly simplifies the proofs of these results.
T
p
is distributive if T
p
(\J X.) = \JT
p
(X
t
) for every collection {X. : i EI}
of subsets of HB. But, since T
p
is continuous, this condition is equivalent to
VX, Y C HBJ
P
{X UY) = T
P
(X) UT
P
(Y). Distributiv
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