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
564 Kanellakis
) database
(b)
width
2
tree
(c) width
I
tree
Figure
2:
Derivation
Tree
Example
width 1. They can be used to characterize programs expressing NC queries. In
fact Ullman and Van Gelder [1986] show something far more interesting re-
lated to the stage function.
Given such a parallelizable program H (Ullman and Van Gelder [1986])
provides a simple syntactic transformation of H into an equivalent program Η'.
The transformation is such that the naive evaluation of Η' takes, at most,
Chapter 14: Logic Programming and Parallel Complexit ...
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