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 11
:
Compiling the GCWA
THEOREM 2 (GCWA THEOREM)
False[A] iff NOT True[A] and PIGC[A] is empty.
Proofs:
Proofs of all theorems are provided in the appendix.
Theorems 1 and 2 say that the PIGC characterizes the indefiniteness of an
IDDB.
That is, it seems unavoidable to consider PIGC in some form or other
for answering Indef[A] and False[A]. However, since it is obviously infeasible
to derive PIGC in general, we should develop an appropriate mechanism to
handle only PIGC[A], that is, the portion of PIGC relevant to the atom being
evaluated.
Compilation
and
Representation
Alternatives
In this section, we introduce the two important
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