Skip to main content

Lazy Learning from Terminological Knowledge Bases

  • Conference paper
Foundations of Intelligent Systems (ISMIS 2006)

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

Included in the following conference series:

Abstract

This work presents a method founded on instance-based learning algorithms for inductive (memory-based) reasoning on ABoxes. The method, which exploits a semantic dissimilarity measure between concepts and instances, can be employed both to infer class membership of instances and to predict hidden assertions that are not logically entailed from the knowledge base and need to be successively validated by humans (e.g. a knowledge engineer or a domain expert). In the experimentation, we show that the method can effectively help populating an ontology with likely assertions that could not be logically derived.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Lisi, F.A.: Principles of inductive reasoning on the semantic web: A framework for learning in AL-log. In: Fages, F., Soliman, S. (eds.) PPSWR 2005. LNCS, vol. 3703, Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Sheth, A., Ramakrishnan, C., Thomas, C.: Semantics for the semantic web: The implicit, the formal and the powerful. Int. Journal on Semantic Web and Information Systems 1, 1–18 (2005)

    Article  Google Scholar 

  3. Hitzler, P., Vrandec̆ić, D.: Resolution-based approximate reasoning for OWL DL. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 383–397. Springer, Heidelberg (2005)

    Google Scholar 

  4. Rodríguez, M.: Assessing semantic similarity between spatial entity classes. PhD thesis, University of Maine (1997)

    Google Scholar 

  5. Borgida, A., Walsh, T., Hirsh, H.: Towards measuring similarity in description logics. In: Working Notes of the International Description Logics Workshop. CEUR Workshop Proceedings, Edinburgh, UK (2005)

    Google Scholar 

  6. d’Amato, C., Fanizzi, N., Esposito, F.: A dissimilarity measure for concept descriptions in expressive ontology languages. In: Alani, H., Brewster, C., Noy, N., Sleeman, D. (eds.) Proceedings of the KCAP2005 Ontology Management Workshop, Banff, Canada (2005)

    Google Scholar 

  7. Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  8. Bacchus, F.: Lp, a logic for representing and reasoning with statistical knowledge. Computational Intelligence 6, 209–231 (1990)

    Article  Google Scholar 

  9. Donini, F.M., Lenzerini, M., Nardi, D., Schaerf, A.: Deduction in concept languages: From subsumption to instance checking. Journal of Logic and Computation 4, 423–452 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  10. Mantay, T.: Commonality-based ABox retrieval. Technical Report FBI-HH-M-291/2000, Dept. of Computer Science, University of Hamburg, Germany (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

d’Amato, C., Fanizzi, N. (2006). Lazy Learning from Terminological Knowledge Bases. In: Esposito, F., Raś, Z.W., Malerba, D., Semeraro, G. (eds) Foundations of Intelligent Systems. ISMIS 2006. Lecture Notes in Computer Science(), vol 4203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11875604_64

Download citation

  • DOI: https://doi.org/10.1007/11875604_64

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45764-0

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy