Some extensions to the closed world assumption in databases
Minker has shown how the CWA can be generalized to non-Horn domains. However, his results hold for assuming ground atomic formulas only. We have shown extensions by which non-ground and non-atomic formulas can be assumed in non-Horn databases.
Unable to display preview. Download preview PDF.
- G. Bossu, P. Siegel 1985: Saturation, Non-monotonic Reasoning, and the Closed World Assumption, Artificial Intelligence 25, No. 1, Jan 1985.Google Scholar
- C. Hewitt 1972: Description and Theoretical Analysis (Using Schemata) of PLANNER: A Language for Proving Theorems and Manipulating Models in a Robot, AI Memo No. 251, MIT Project MAC, Cambridge, MA 1980.Google Scholar
- D. Fishman, J. Minker 1975: P-Representation: A Clause Representation for Parallel Search, Artificial Intelligence 6, 1975.Google Scholar
- R. Kowalski 1978: Logic for Data Description, In Logic and Data Bases, (H. Gallaire and J. Minker, eds.), Plenum Press, NY 1978.Google Scholar
- J. McCarthy 1980: Circumscription-A Form of non-Monotonic Reasoning, Artificial Intelligence 13, 1 1980.Google Scholar
- J. Minker 1982: On Indefinite Data Bases and the Closed World Assumption, Springer-Verlag Lecture Notes in Computer Science, (ed. D. Loveland), no. 138, NY 1982.Google Scholar
- R. Reiter 1978a: Deductive Q-A on Relational Data Bases, In Logic and Data Bases, (H. Gallaire and J. Minker, eds.), Plenum Press, NY 1978.Google Scholar
- R. Reiter 1978b: On Closed World Data Bases, In Logic and Data Bases, (H. Gallaire and J. Minker, eds.), Plenum Press, NY 1978.Google Scholar
- R. Reiter 1982: Circumscription Implies Predicate Completion(Sometimes), Proc. of NCAI, Pittsburgh, PA, 1982.Google Scholar
- M. van Emden,R. Kowalski 1976: The Semantics of Predicate Logic as a Programming Language, J. of the ACM 23, 4, 1976.Google Scholar
- A. Yahya, L. Henschen 1985: Deduction in non-Horn Databases, Journal of Automated Reasoning, 1, No. 2, 1985.Google Scholar