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 6: On Domain Independent Databases 227
THEOREM 3 (TOPOR [1986])
Every allowed formula is safe and hence domain independent.
The proof that every allowed formula is safe is, by structural induction,
using the similarity of the defining conditions. Second, allowed formulas can
be transformed into particularly simple equivalent relational algebra expres-
sions (Van Gelder and Topor [1987]). Finally, the evaluation of an allowed
query, with respect to a database using SLDNF-resolution as described in
Lloyd and Topor [1986], never terminates with a control error (i.e., it never
"flounders").
Other recursive subclasses of the domain independen ...
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