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
16:
Equivalences
of
Logic Programs
633
unifier of A and H such that
G
i+l
is ground. If the initial goal is ground, then
it is equivalent to say that a ground derivation is a derivation using the ground
instances of clauses of P. An SLD tree for a goal G is a tree with goals as
nodes where G is at the root, each non-empty goal contains a selected atom,
and the children of a node are the goals obtained in one derivation step using
the selected atom of that node.
The operational model we will use is fair SLD-resolution (Lassez and
Maher [1984]); that is, SLD-resolution where every branch of the SLD tree
forms a fair derivation. We conside ...
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