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 11
:
Compiling the GCWA 419
backward AND-branch unless we restrict the number of such backward AND-
branches and the number of partially derived relations in them.
Compiling
Unit Queries in
Recursive
IDDB
Recently, several research reports (Bancilhon and Ramakrishnan [1987]
Chang [1981], Henschen and Naqvi [1984], Han [1985]) showed that many
practical recursive axioms can be compiled into specific patterns of negative
clauses in recursive Horn databases. However, it seems very difficult to find
some regular patterns for the positive parts of non-Horn clauses in a recursive
IDDB,
in addition to the patterns for their negative parts.
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