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 597
The following theorem further illustrates the usefulness of the notion of
dimension. An interesting alternative view of this theorem will be found at the
end of the section on anti-unification and most general solutions.
THEOREM 2
Suppose the Herbrand universe is infinite. Let £ be a set of equations of
dimension d and E
v
E
2
be sets of equations of dimension strictly less
than d. Then there is a solution of Ε which is not a solution of any E
r
Proof:
We can assume, without loss of generality, that Ε and the E
i
are in
solved form. Note that, since Ε has strictly greater dimension (and so strictly
lesser rank ...
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