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 475
Notation
and
Preliminary
Derivations
In this section, we explain the notation and terminology used in analytically
deriving the cost functions. We also derive some expressions that are used in
the analysis of some of the strategies. The derivations of these expressions are
of some interest in their own right since they are good examples of the tech-
niques we use in subsequent analyses. We denote multiplication by simply jux-
taposing the operands. Where there is ambiguity, parentheses are used to
clarify the expression, or we use * to denote multiplication. We denote the
number of node ...
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