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 15: Unification Revisited 615
On termination of the while loop it follows from Proposition 21 that σ is an
mgs.
Thus equip) is well defined, the set of solutions of equip) is included in
soln(E) and contains soln(E) for each /. Consequently it is an msg.
The rank of the msg of an equation collection has analogous properties to
the size of the lea of a term set. That is, for equation sets E
V
E
2
,...
1.
rank(msg{E
l9
...,E
k
}) > rank(msg{E
x
,...,E
k
, E
M
}).
2.
If rank(msg{E
v
...,E
k
}) = ranUmsg{E
v
...,E
k
,
E
k+l
}),
then msg{E
v
...,E
k
} « msg{E
x
,...,E
k
,
E
k+l
}.
It follows from an identical argument to that given in the case of terms
(following Propositio ...
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