Skip to main content

A Method of Similarity-Driven Knowledge Revision for Type Specializations

  • Conference paper
  • First Online:
Algorithmic Learning Theory (ALT 1999)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1720))

Included in the following conference series:

Abstract

This paper proposes a new framework of knowledge revision, called Similarity-Driven Knowledge Revision. Our revision is invoked based on a similarity observation by users and is intended to match with the observation. Particularly, we are concerned with a revision strategy according to which an inadequate variable typing in describing an object-oriented knowledge base is revised by specializing the typing to more specific one without loss of the original inference power. To realize it, we introduce a notion of extended sorts that can be viewed as a concept not appearing explicitly in the original knowledge base. If a variable typing with some sort is considered over-general, the typing is modified by replacing it with more specific extended sort. Such an extended sort can efficiently be identified by forward reasoning with SOL-deduction from the original knowledge base. Some experimental results show the use of SOL-deduction can drastically improve the computational efficiency.

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. S. Wrobel. Concept Formation and Knowledge Revision, Kluwer Academic Publishers, Netherlands, 1994.

    MATH  Google Scholar 

  2. C. Walter. Many-Sorted Unification, Journal of the Association for Computing Machinery, Vol. 35 No. 1, 1988, pp.1–17.

    MathSciNet  Google Scholar 

  3. D. J. Tenenberg. Abstracting First-Order Theories, Change of Representation and Inductive Bias (P. D. Benjamin, ed.), Kluwer Academic Publishers, USA, 1989, pp. 67–79.

    Google Scholar 

  4. T. Kakuta, M. Haraguchi and Y. Okubo. A Goal-Dependent Abstraction for Legal Reasoning by Analogy, Artificial Intelligence & Law, Vol.5, Kluwer Academic Publishers, Netherlands, 1997, pp. 97–118.

    Google Scholar 

  5. Y. Okubo and M. Haraguchi. Constructing Predicate Mappings for Goal-Dependent Abstraction, Annals of Mathematics and Artificial Intelligence, Vol.23, 1998, pp. 169–197.

    Article  MATH  MathSciNet  Google Scholar 

  6. T. Mitchell, R. Keller and S. Kedar-Cabelli. Explanation-Based Generalization: A Unifying View, Machine Learning, Vol.1, 1986, pp. 47–80.

    Google Scholar 

  7. K. Inoue. Liner Resolution for Consequence-Finding, Artificial Intelligence, Vol. 56 No. 2–3, 1992, pp 301–353.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Morita, N., Haraguchi, M., Okubo, Y. (1999). A Method of Similarity-Driven Knowledge Revision for Type Specializations. In: Watanabe, O., Yokomori, T. (eds) Algorithmic Learning Theory. ALT 1999. Lecture Notes in Computer Science(), vol 1720. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46769-6_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-46769-6_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66748-3

  • Online ISBN: 978-3-540-46769-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics