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
569
Figure
3:
Illustrating the Proof of Theorem
2
Figure 3a by unique subgraphs, and will be omitted. One can show that H(G)
is bounded iff G is three-colorable.
"If" Let G be three-colorable, then the above sirup is equivalent to the fol-
lowing sirup:
R(x,y,z,v) R(x,y,
z
,w), R
1
(x,v),R
1
(y,v),R
1
(z,v),R
2
(w,x),R
2
(w,y),
R
2
(w,z),
R
3
(x,y),R3(y,x),R3(z,x),R3(x,z),R3(z,y),R
3
(y,z).
This is represented in Figure 3b. For this all one has to note is that Figure 3a
(3b) can be homomorphically mapped in Figure 3b (3a), where x,y,z,v,w are
570
Kanellakis
mapped to x,y,z,v,w (Ullman [1983]). Now the siru ...
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