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
280
Imielinski
We now describe the notion of a query more formally. Traditionally,
queries in databases are expressed using two different formalisms: the rela-
tional algebra or the relational calculus (Ullman [1982]). The relational cal-
culus is a variant of the predicate calculus with queries being open formulas of
the language. Formally, by the answer to a query Q(x) in the database DB
(which is viewed as a first order theory, a combination of database extension
and intension), we mean the set of all substitutions of domain constants for the
variable χ such that the resulting formula is a semantic consequence of the
database DB. If the databas ...
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