Skip to main content

Learning Improved Integrity Constraints and Schemas From Exceptions in Data and Knowledge Bases

  • Chapter
On Knowledge Base Management Systems

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

Abstract

In order to set up efficient storage structures and detect errors in the data being stored, the designers of data and knowledge base management systems must initially build schema and integrity constraints that anticipate the kind of facts that are to be stored. The purpose of this chapter is to demonstrate some ways in which a KBMS can be endowed with the ability to refine its schema on the basis of the data actually stored so far. In particular, due to the unpredictability and evolution of the natural world, as well as possible errors made by designers, a KBMS must be tolerant of occasional deviations from the norms set out during design — in other words, it must accommodate exceptions. Two techniques are presented through which a computer system can suggest modifications and additions to the current definitions and semantic integrity constraints of a knowledge base by “ learning from the exceptions encountered. One schema refinement method is based on generalizing from example exceptions to form descriptions of classes of similar objects. The other technique refines integrity constraints by” explaining the occurrence of exceptions in terms of a detailed theoretical world-model and then generalizing to those cases where similar explanations hold.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brachman, R.J., R.E. Fikes and H.J. Levesque.,- “Krypton: A Functional Approach to Knowledge Representation”, IEEE COMPUTER, Special Issue on Knowledge Representation, Vol. 16, No. 10, October 1983, pp. 67–73.

    Google Scholar 

  2. Borgida, A., “Features of languages for the development of Information Systems at the Conceptual level”, IEEE SOFTWARE. Vol.2, No.1, pp. 63–73, January 1985.

    Google Scholar 

  3. Borgida, A., “Language features for flexible handling of exceptions in Information Systems”, ACM Trans. on Database Systems, Vol. 10, No. 4, December 1985.

    Google Scholar 

  4. Chan, A., S. Danberg, S. Fox, W.K. Lin, A. Nori and D. Ries, “Storage and access structures to support a semantic data model”, Proc. 1982 VLDB Conference, Mexico, September 1982.

    Google Scholar 

  5. Findler, N.V., “Associative Networks: Representation and Use of Knowledge by Computer”, Academic Press, New York, 1979.

    MATH  Google Scholar 

  6. Hayes-Roth, F. “Patterns of Induction and Associated Knowledge Acquisition Algorithms”, In Chen, C. (editor), Pattern Recognition and Artificial Intelligence. Academic Press, New York, 1976.

    Google Scholar 

  7. King, J., “Intelligent Retrieval Planning”, Proc. 1st Natl Conf on AI, pp. 243–245, August 1980.

    Google Scholar 

  8. Mitchell, T., “Generalization as Search”, Artificial Intelligence 18 (2), pp. 203–226, March 1982.

    Article  MathSciNet  Google Scholar 

  9. Mitchell, T., “Learning and Problem Solving”, Proc. of IJCAI 83, pp.1139–1151, Karlsrhue, Germany, August 1983.

    Google Scholar 

  10. Mitchell, T., Keller, R., and S. Kedar-Cabelli, “Explanation-Based Generalization: A Unifying View” Machine Learning, Vol. 1, No. 1, Kluwar Academic Press, January 1986.

    Google Scholar 

  11. Nilsson, N., Principles of Artificial Intelligence. Tioga Publishing Company, 1980.

    Google Scholar 

  12. Shipman, D., “The Functional Data Model and the Data Language DAPLEX,” ACM Transactions on Database Systems, Vol. 6, No. 1, March 1981.

    Google Scholar 

  13. Smith, R.G., H.A. Winston, T.A. Mitchell and B.G. Buchanan, “Representation and use of explicit justification for knowledge base refinemnent”, Proc. 9th IJCAI, Los Angeles, CA. August 1985.

    Google Scholar 

  14. Vere, S. A., “Inductive learning of relational productions”, In Waterman, D. A. and Hayes-Roth, F. (editors), Pattern-Directed Inference Systems. Academic Press, New York, 1978.

    Google Scholar 

  15. Winston, P., “Learning by Augmenting Rules and Accumulating Censors”, Machine Learning: An Artificial Intelligence Approach, Volume II, Michalski, Carbonell, and Mitchell eds., Kaufman- Morgan Publishers, 1986.).

    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 New York Inc.

About this chapter

Cite this chapter

Borgida, A., Mitchell, T., Williamson, K.E. (1986). Learning Improved Integrity Constraints and Schemas From Exceptions in Data and Knowledge Bases. 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_23

Download citation

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

  • 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