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
706 van Emden and Szeredi
? conj (m(X,Y',Z') , t2 (U, X) , t3 (1. V, 2. Y') , s (2. Ζ', U, V) )
Not only has a 2 appeared in the output channel of merge, but the equivalent
of pushing it into the empty input channel has also occurred.
The third clause should not be obtained by merely inserting the guard. In-
stead, it should be recognized that there is an implicit test for equality (the first
two occurrences of A) and that this test should come after a guard ensuring that
the input channels are nonempty, like this:
conj (m(A.X,B. Υ,Α.Ζ) ,T2,T3,S)
if not (var (A) ) , not (var (B) ) , eq (A, B) , conj (m, Υ, Ζ) ,
T2,T3,
S)
An
Alternative
Route ...
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