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
451
The initial state is <{query(X)},{}}, evaluate(query(X)).
It is important to note that this version of QSQ is very similar to Prolog. It
solves goals in a top-down fashion using recursion, and it considers the literals
ordered in the rule (the order is defined by the selection function). The impor-
tant differences with Prolog are: (i) The method is set-at-a-time instead of
tuple-at-a-time, through the generalized query concept, and (ii) as pointed out
in Dietrich and Warren [1985], the method uses a dynamic programming ap-
proach of storing the intermediate results and re-using them whe ...
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