
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 ...