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
290
Imielinski
Frequently it also turns out that although a given set of rules is not trans-
formable by the query, some other equivalent set of rules is. The following ex-
ample illustrates the point:
EXAMPLE 6
Given two rules p(a) p(b) and p(b) p(c) and selection σ
(Α = a)v(A = c)
, we
can get the implied rule p(a) p(c) by application of modus ponens to the
above two rules. In this case only the rule p(b) p(c) should be evaluated be-
fore the query; the implied rule could be part of the answer. Therefore, the
"closure" of this set of rules allows us to postpone one of the rules until after
the query evaluation, which was not the case for th ...
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