Skip to main content

Some extensions to the closed world assumption in databases

Contributed Papers

Part of the Lecture Notes in Computer Science book series (LNCS,volume 243)

Abstract

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/3-540-17187-8_45
  • Chapter length: 8 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   89.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-47346-6
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   119.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  • 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Naqvi, S.A. (1986). Some extensions to the closed world assumption in databases. In: Ausiello, G., Atzeni, P. (eds) ICDT '86. ICDT 1986. Lecture Notes in Computer Science, vol 243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17187-8_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-17187-8_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17187-4

  • Online ISBN: 978-3-540-47346-6

  • eBook Packages: Springer Book Archive