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
u
Compiling the GCWA in Indefinite
Deductive Databases
Lawrence J.
Henschen
Hyung-Sik
Park
Electrical Engineering and Computer Science
Northwestern University, Evanston,
IL
Abstract
This paper presents several fundamental results on compiling the GCWA
(Generalized Closed World Assumption) in IDDB (Indefinite Deductive
Databases). We do not allow function symbols, but we do allow non-Horn
clauses. Further, although the GCWA is used to derive negative assumptions,
we do allow also negative clauses to occur explicitly. We show a fundamental
relationship between indefiniteness and GCWA inference. We consider three
representation alternative ...
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