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 12: Performance Evaluation of Logic Programs 497
ment of length 2 in up, and so on. In this way we generate all such paths with
a segment of length i in up where i = 1 to min((h
up
—(h'
up
-
h
,
up
down))down)- To
see we note
^at
we
begin with answers that are at a
distance h
r
down
from "John," and "John" is h'
up
levels from the the lowest
level of up. Thus we can extend the answers by up to \
P
~Q^'
up
~^'
up
.^
ww
) arcs
in up, and by up to h'
down
levels in down. Since the segments in up and down
must be equal in any valid extension, the lower of these two values denotes the
length of the longest possible extension.
Each such extension represent ...
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