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
265
H Pl*,...,Pm* {Rl;...;Rn} (terms omitted).
Here,
H Pl*,...,Pm*
is a (compiled) axiom A, and Rl,...,Rn are the residues of A with the in-
tegrity constraints that are merge compatible with A.
The process of residue generation can be applied to extensional predicates
also by applying the "axiom" P*-«- P* for the predicate P*. This way we ob-
tain semantically constrained extensional predicates which may be useful for
processing queries for a non-deductive (or the extensional portion of a
deductive) database.
Procedurally, a semantically constrained axiom, as given in the definition ...
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