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 469
rules are then used to produce the optimized set of rules. Both these steps are
now directed, however, by the notion of sideways information passing graphs
(sips).
A sip corresponding to the above rule which binds Ζ is:
A -*»
x
ö.l, Α,α.1
z
a.2
The predicate A denotes the bound part of the head. This graph indicates that
the head binds X and this is used in solving the first occurrence of a. Further,
this solution is used to bind Ζ in solving the second occurrence of a. This
generates the adorned rule:
α*(Χ,Υ) :-α*(Χ,Ζ), a
bf
(Z,Y).
The magic rules corresponding to the two occurrences o ...
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