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
704 van Emden and Szeredi
Let us combine this definition with that of merge. As the first step, we obtain
from the above implication the instance:
conj (m. Χ, Β. Υ, A. Z) ,T2,T3,S)
if merge(m(Α.X,B.Y,A.Z)),times2(T2),times3(T3),
split(S)
We use the definition of merge to obtain by resolution ("unfolding" or
"partial application"):
conj (m(A.X,B. Υ,Α.Ζ) , T2,T3,S)
if lt(A,B) , merge (m(X,B. Υ, Z) ) , times2 (T2) ,times3(T3),
split(S)
When we now use the only if part of the definition of conj on the right-hand
side,
we obtain (by "folding"):
conj (m(A.X,B. Υ,Α.Ζ) ,T2,T3,S)
if lt(A,B) ,conj (m(X,B. Y,Z) ,T2,T3,S)
In a similar way, each of th ...
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