Advertisement

Implementation and Evaluation of a Backtracking Algorithm for Finding All Justifications in OWL 2 EL

  • Zhangquan Zhou
  • Guilin Qi
Part of the Communications in Computer and Information Science book series (CCIS, volume 406)

Abstract

Finding justifications plays an important role in the development and maintenance of ontologies. It helps users or developers to understand the entailments by presenting the minimal subsets of the ontology which are responsible for the entailment (called justification). In our previous work, we have proposed a backtracking algorithm for finding justifications in description logic \(\mathcal{EL}^{+}\), which underpins OWL 2 EL, a profile of the latest version of Web Ontology Language (OWL). However, the algorithm is not implemented. In this paper, we implement this algorithm and conduct experiments on some real world ontologies, including Snomed-CT. We compare our algorithm with a black-box algorithm for finding all justification in OWL 2 EL. The experimental results show that in most cases, the backtracking algorithm outperforms the black-box one.

Keywords

Description Logic Dependency Graph Minimal Subset Real Ontology Reasoning Service 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\) Envelope. In: IJCAI, pp. 364–369 (2005)Google Scholar
  2. 2.
    Baader, F., Peñaloza, R., Suntisrivaraporn, B.: Pinpointing in the Description Logic \(\mathcal{EL}^{+}\). In: Hertzberg, J., Beetz, M., Englert, R. (eds.) KI 2007. LNCS (LNAI), vol. 4667, pp. 52–67. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    Baader, F., Suntisrivaraporn, B.: Debugging SNOMED CT Using Axiom Pinpointing in the Description Logic \(\mathcal{EL}^{+}\). In: KR-MED (2008)Google Scholar
  4. 4.
    Cheng, X., Qi, G.: An algorithm for axiom pinpointing in \(\mathcal{EL}^{+}\) and its incremental variant. In: CIKM, pp. 2433–2436 (2011)Google Scholar
  5. 5.
    Kalyanpur, A., Parsia, B., Horridge, M., Sirin, E.: Finding All Justifications of OWL DL Entailments. In: Aberer, K., Choi, K.-S., Noy, N., Allemang, D., Lee, K.-I., Nixon, L.J.B., Golbeck, J., Mika, P., Maynard, D., Mizoguchi, R., Schreiber, G., Cudré-Mauroux, P. (eds.) ASWC 2007 and ISWC 2007. LNCS, vol. 4825, pp. 267–280. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  6. 6.
    Kalyanpur, A., Parsia, B., Sirin, E., Hendler, J.A.: Debugging unsatisfiable classes in OWL ontologies. J. Web Sem., 268–293 (2005)Google Scholar
  7. 7.
    Schlobach, S., Cornet, R.: Non-Standard Reasoning Services for the Debugging of Description Logic Terminologies. In: IJCAI, pp. 355–362 (2003)Google Scholar
  8. 8.
    Suntisrivaraporn, B.: Finding all justifications in SNOMED CT. Research Article, 79–90 (2013)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Zhangquan Zhou
    • 1
  • Guilin Qi
    • 1
  1. 1.Key Laboratory of Computer Network and Information Integration of State Education Ministry School of Computer Science and EngineeringSoutheast UniversityChina

Personalised recommendations