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 405
with the negative data in the RDB, and diese resolutions are made at evalua-
tion time, not at compile time. In Representation 3, any negative information
about V would have to be in the CDB and would therefore be resolved at com-
pile time. Notice also that clause 2 could lead to a Horn clause with positive
literal over S because there is explicit negative information about V which can
remove the second positive literal. Thus, in Representation 2, clause 2 would
be included in the set of compiled clauses that could prove 5 atoms true. Of
course, in Representation 3, any such negative information over V woul ...
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