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
Apt,
Blair,
and
Walker
and if (p,q) is a negative edge, then the level assigned to q is strictly smaller
than that assigned to p. Thus, there are no cycles in the dependency graph
through a negative edge.
For the converse, decompose the dependency graph into strongly connected
components, each of maximum cardinality (i.e., such that any two nodes in a
component are connected in a cycle). Then the relation "there is an edge from
component G to component H" is well founded, since it is finite, and contains
no cycles. Thus, for some η the numbers
l,...,n
can be assigned to the com-
ponents so that if there is an edge from G to H, then the numbe ...
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