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 14: Logic Programming and Parallel Complexity 577
1.
The root of T, node u, is mapped by ρ to v.
2.
For all nodes w of T, w and p(w) are labeled by the same function, or w
is labeled by a variable.
3. For all nodes w and w' of T, if there is an arc in Τ labeled i from wtow'
then there is an arc in dag ν labeled i from p(w) to p(w').
If there is no embedding, then clearly t
u
and t
v
are not unifiable.
M3 The embedding ρ gives a substitution for all the variables of t
u
. Specifi-
cally, if variable χ is the label of (the unique) node w in dag u then the subdag
rooted at p(w) represents the term substituted for x. The substitution is per
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