Skip to main content
SpringerLink
Log in
Book cover

International Conference on Inductive Logic Programming

ILP 2007: Inductive Logic Programming pp 161–174Cite as

Foundations of Refinement Operators for Description Logics

  • Conference paper

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

Abstract

In order to leverage techniques from Inductive Logic Programming for the learning in description logics (DLs), which are the foundation of ontology languages in the Semantic Web, it is important to acquire a thorough understanding of the theoretical potential and limitations of using refinement operators within the description logic paradigm. In this paper, we present a comprehensive study which analyses desirable properties such operators should have. In particular, we show that ideal refinement operators in general do not exist, which is indicative of the hardness inherent in learning in DLs. We also show which combinations of desirable properties are theoretically possible, thus providing an important step towards the definition of practically applicable operators.

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. Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  2. Badea, L., Stanciu, M.: Refinement operators can be (weakly) perfect. In: Džeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol. 1634, pp. 21–32. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  3. Badea, L.: Perfect refinement operators can be flexible. In: Horn, W. (ed.) Proceedings of the 14th European Conference on Artificial Intelligence, August 2000, pp. 266–270. IOS Press, Amsterdam (2000)

    Google Scholar 

  4. Badea, L., Nienhuys-Cheng, S.-H.: A refinement operator for description logics. In: Cussens, J., Frisch, A.M. (eds.) ILP 2000. LNCS (LNAI), vol. 1866, pp. 40–59. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  5. Cohen, W.W., Hirsh, H.: Learning the classic description logic: Theoretical and experimental results. In: Doyle, P.T.J., Sandewall, E. (eds.) Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning, Bonn, FRG, May 1994, pp. 121–133. Morgan Kaufmann, San Francisco (1994)

    Google Scholar 

  6. Esposito, F., Fanizzi, N., Iannone, L., Palmisano, I., Semeraro, G.: Knowledge-intensive induction of terminologies from metadata. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 441–455. Springer, Heidelberg (2004)

    Google Scholar 

  7. Fanizzi, N., Ferilli, S., Iannone, L., Palmisano, I., Semeraro, G.: Downward refinement in the ALN description logic. In: 4th International Conference on Hybrid Intelligent Systems (HIS 2004), Kitakyushu, Japan, December 2004, pp. 68–73. IEEE Computer Society, Los Alamitos (2004)

    Chapter  Google Scholar 

  8. Fanizzi, N., Ferilli, S., Di Mauro, N., Basile, T.M.A.: Spaces of theories with ideal refinement operators. In: Gottlob, G., Walsh, T. (eds.) IJCAI 2003, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, August 9-15, 2003, pp. 527–532. Morgan Kaufmann, San Francisco (2003)

    Google Scholar 

  9. Iannone, L., Palmisano, I.: An algorithm based on counterfactuals for concept learning in the semantic web. In: Ali, M., Esposito, F. (eds.) Innovations in Applied Artificial Intelligence. Proceedings of the 18th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, Bari, Italy, June 2005, pp. 370–379 (2005)

    Google Scholar 

  10. Kietz, J.-U., Morik, K.: A polynomial approach to the constructive induction of structural knowledge. Machine Learning 14, 193–217 (1994)

    Article  MATH  Google Scholar 

  11. Lehmann, J.: Hybrid learning of ontology classes. In: Perner, P. (ed.) MLDM 2007. LNCS (LNAI), vol. 4571, Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Lehmann, J., Hitzler, P.: Foundations of refinement operators for description logics. In: Technical report. University of Leipzig (2007), http://www.jens-lehmann.org

  13. Lehmann, J., Hitzler, P.: Foundations of refinement operators for description logics. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) ILP 2007. LNCS (LNAI), vol. 4894, pp. 161–174. Springer, Heidelberg (2007)

    Google Scholar 

  14. Lisi, F.A., Malerba, D.: Ideal refinement of descriptions in AL-log. In: Horváth, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol. 2835, pp. 215–232. Springer, Heidelberg (2003)

    Google Scholar 

  15. Mitchell, T.: Machine Learning. McGraw Hill, New York (1997)

    MATH  Google Scholar 

  16. Nienhuys-Cheng, S.-H., Van Laer, W., Ramon, J., De Raedt, L.: Generalizing refinement operators to learn prenex conjunctive normal forms. In: Džeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol. 1634, pp. 245–256. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  17. Nienhuys-Cheng, S.H., van der Laag, P.R.J., van der Torre, L.W.N.: Constructing refinement operators by decomposing logical implication. In: Torasso, P. (ed.) AI*IA 1993. LNCS, vol. 728, pp. 178–189. Springer, Heidelberg (1993)

    Google Scholar 

  18. Nienhuys-Cheng, S.-H., de Wolf, R. (eds.): Foundations of Inductive Logic Programming. LNCS, vol. 1228. Springer, Heidelberg (1997)

    Google Scholar 

  19. Shapiro, E.Y.: Inductive inference of theories from facts. In: Lassez, J.L., Plotkin, G.D. (eds.) Computational Logic: Essays in Honor of Alan Robinson, pp. 199–255. MIT Press, Cambridge (1991)

    Google Scholar 

  20. van der Laag, P.R.J., Nienhuys-Cheng, S.-H.: Existence and nonexistence of complete refinement operators. In: Bergadano, F., De Raedt, L. (eds.) ECML 1994. LNCS, vol. 784, pp. 307–322. Springer, Heidelberg (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Universität Leipzig, Johannisgasse 26, D-04103, Leipzig, Germany

    Jens Lehmann

  2. AIFB Institute, Universität Karlsruhe (TH), D-76128, Karlsruhe, Germany

    Pascal Hitzler

Authors
  1. Jens Lehmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pascal Hitzler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hendrik Blockeel Jan Ramon Jude Shavlik Prasad Tadepalli

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lehmann, J., Hitzler, P. (2008). Foundations of Refinement Operators for Description Logics. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds) Inductive Logic Programming. ILP 2007. Lecture Notes in Computer Science(), vol 4894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78469-2_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78469-2_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78468-5

  • Online ISBN: 978-3-540-78469-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation