Skip to main content
SpringerLink
Log in
Book cover

On Knowledge Base Management Systems pp 125–145Cite as

Negation in Knowledge Base Management Systems

  • Chapter

  • 222 Accesses

Part of the book series: Topics in Information Systems ((TINF))

Abstract

A Knowledge Base is defined as a set of closed universally quantified first-order formulas; this allows a relational database to be incorporated as a component of the Knowledge Base. A Knowledge Base Management System is defined as the system that manages the Knowledge Base. Storage of negative information in knowledge bases is impractical due to the potentially huge amount that would have to be stored. The Closed World Assumption, negation from failure to prove, and the Generalised Closed World Assumption are discussed as methods of avoiding the storage of negative information explicitly. A new method of “closing off” a Knowledge Base is presented and a system architecture for Knowledge Based Management Systems is proposed. Finally, it is shown that this architecture supports previous work in handling recursive queries in Knowledge Bases; it thus builds upon previous results and provides a coherent and unifying framework for building Knowledge Base Management Systems.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K., M. van Emden, Contributions to the Theory of Logic Programming, J of the ACM 29, 3, 1982.

    Article  Google Scholar 

  2. Aho, A., J. Ullman, “Universality of Data Retrieval Languages”, Sixth ACM Symposium on Principles of Programming Languages, 1979.

    Google Scholar 

  3. Brodie, M., J. Mylopoulos, J. Schmidt, Conceptual Modelling: Perspectives from Artificial Intelligence, Databases and Programming Languages, Springer-Verlag, 1983.

    Google Scholar 

  4. Chang, C., R. Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press, 1973.

    Google Scholar 

  5. Clark, K., “Negation as Failure”, in [GM78], 1978.

    Google Scholar 

  6. Codd, E.F., “Extending the database relational model to capture more meaning,” ACM Trans. on Database Systems, Vol. 4, No. 4, December 1979, pp. 395–434.

    Article  Google Scholar 

  7. Chang, C., J. Slagle, Using Rewriting Rules for Connection Graphs to Prove Theorems, Artificial Intelligence 12, 2, 1979.

    Article  MathSciNet  Google Scholar 

  8. Gallaire, H. and Minker, J. (eds.), Logic and Data Bases. New York, Plenum Press, 1978.

    MATH  Google Scholar 

  9. Gallaire, H., J. Nicolas, J. Minker, Advances in Database Theory, Vol. 1, Plenum Press, New York 1981.

    Google Scholar 

  10. Gallaire, H.,J. Minker, J. Nicolas, Advances in Database Theory, Plenum Press, Vol. 2, 1984.

    Google Scholar 

  11. Henschen, L. J. and S. A. Naqvi, “On compiling queries in recursive first-order databases”, J. ACM, Vol. 31, No. 1, pp. 47–85, January, 1984.

    Google Scholar 

  12. Kowalski, R., Logic for Data Description, In [GM78], 1978.

    Google Scholar 

  13. Levesque, H., The Logic of Incomplete Knowledge Bases, In [BMS83].

    Google Scholar 

  14. Minker, J., On Indefinite Databases and the Closed World Assumption, 6th Conf. on Automated Deduction, New York, in Lecture Notes in Computer Science, no. 138, (ed. D. Loveland ), Springer-Verlag, 1982.

    Google Scholar 

  15. Naqvi, S., Some Extensions to the Closed World Assumption, submitted for publication.

    Google Scholar 

  16. Naqvi, S., Negative Queries in Horn Databases, submitted for publication.

    Google Scholar 

  17. Reiter, R., Deductive Q-A on Relational Databases, In [GM78].

    Google Scholar 

  18. Reiter, R., On Closed World Databases, In [GM78].

    Google Scholar 

  19. Reiter, R., Equality and Domain Closure in First-Order Databases, J. of the ACM 27, 2, 1980.

    Article  MathSciNet  Google Scholar 

  20. Sickel, S., A Search Technique for Clause Interconnectivity Graphs, IEEE Trans, on Computers C-25,8, Aug. 1976.

    Google Scholar 

  21. Ullman, J.D., Principles of Database Systems, Computer Science Press 1983.

    Google Scholar 

  22. Van Emden, M., R. Kowalski, The Semantics of Predicate Logic as a Programming Language, J. of the ACM 23,4, 1976.

    Google Scholar 

  23. Yahya, A., L. Henschen, “Deduction in Non-Horn Databases”, Journal of Automated Reasoning, 1, No. 2, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AT&T Bell Laboratories, USA

    Shamin A. Naqvi

Authors
  1. Shamin A. Naqvi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Corporation of America, 4 Cambridge Center, 02142, Cambridge, MA, USA

    Micheal L. Brodie

  2. Department of Computer Science, University of Toronto, M5S IA4, Toronto, Ontario, Canada

    John Mylopoulos

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag New York Inc.

About this chapter

Cite this chapter

Naqvi, S.A. (1986). Negation in Knowledge Base Management Systems. In: Brodie, M.L., Mylopoulos, J. (eds) On Knowledge Base Management Systems. Topics in Information Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4980-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-4980-1_15

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-9383-5

  • Online ISBN: 978-1-4612-4980-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation