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
7:
Foundations
of
Semantic Query Optimization
263
ther. So the only way that FULLY_SUBSUMES could be set to TRUE would
be if one resolvent were a goal clause with only true atoms in the body. But
then, going through the cases (c = c), (ki = ki), as well as GE(c,c) and
LE(c,c), essentially going in the opposite direction to what we did in Case 1,
we find that IC must have subsumed the body of A. But this contradicts the
hypothesis. So FULLY_SUBSUMES is set to FALSE.
Case
2a;
IC and A are not merge compatible.
This means that all the residues are either maximal or redundant. There can
be only one maximal residue, IC+. In this case NOT_MERGE_COM ...
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