Advertisement

DeFind: A Protege Plugin for Computing Concept Definitions in \(\mathcal {EL}\) Ontologies

  • Denis PonomaryovEmail author
  • Stepan Yakovenko
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11341)

Abstract

We introduce an extension to the Protégé ontology editor, which allows for discovering concept definitions, which are not explicitly present in axioms, but are logically implied by an ontology. The plugin supports ontologies formulated in the Description Logic \(\mathcal {EL}\), which underpins the OWL 2 EL profile of the Web Ontology Language and despite its limited expressiveness captures most of the biomedical ontologies published on the Web. The developed tool allows to verify whether a concept can be defined using a vocabulary of interest specified by a user. In particular, it allows to decide whether some vocabulary items cabe omitted in a formulation of a complex concept. The corresponding definitions are presented to the user and are provided with explanations generated by an ontology reasoner.

References

  1. 1.
    Kazakov, Y., Krötzsch, M., Simancik, F.: The incredible ELK - from polynomial procedures to efficient reasoning with \(\cal{EL}\) ontologies. J. Autom. Reason. 53(1), 1–61 (2014)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Kazakov, Y., Klinov, P., Stupnikov, A.: Towards reusable explanation services in protege. In: Artale, A., Glimm, B., Kontchakov, R. (eds.) Proceedings of the 30th International Workshop on Description Logics, CEUR Workshop Proceedings, Montpellier, France, 18–21 July 2017, vol. 1879. CEUR-WS.org (2017)Google Scholar
  3. 3.
    ten Cate, B., Franconi, E., Seylan, I.: Beth definability in expressive description logics. J. Artif. Intell. Res. 48, 347–414 (2013)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Ponomaryov, D.K., Vlasov, D.: Concept definability and interpolation in enriched models of \(\cal{EL}\) -tboxes. In: Eiter, T., Glimm, B., Kazakov, Y., Krötzsch, M. (eds.) Informal Proceedings of the 26th International Workshop on Description Logics, CEUR Workshop Proceedings, Ulm, Germany, 23–26 July 2013, vol. 1014, pp. 898–916. CEUR-WS.org (2013)Google Scholar
  5. 5.
    Franconi, E., Kerhet, V., Ngo, N.: Exact query reformulation over databases with first-order and description logics ontologies. J. Artif. Intell. Res. 48, 885–922 (2013)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Konev, B., Lutz, C., Ponomaryov, D.K., Wolter, F.: Decomposing description logic ontologies. In: Lin, F., Sattler, U., Truszczynski, M. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010, Toronto, Ontario, Canada, 9–13 May 2010. AAAI Press (2010)Google Scholar
  7. 7.
    Geleta, D., Payne, T.R., Tamma, V., Wolter, F.: Computing minimal definition signatures in description logic ontologies. Technical report, University of Liverpool (2016)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Institute of MathematicsNovosibirsk State UniversityNovosibirskRussia
  2. 2.Institute of Informatics SystemsNovosibirsk State UniversityNovosibirskRussia

Personalised recommendations