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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\) Envelope. In: IJCAI, pp. 364–369 (2005)
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)
Baader, F., Suntisrivaraporn, B.: Debugging SNOMED CT Using Axiom Pinpointing in the Description Logic \(\mathcal{EL}^{+}\). In: KR-MED (2008)
Cheng, X., Qi, G.: An algorithm for axiom pinpointing in \(\mathcal{EL}^{+}\) and its incremental variant. In: CIKM, pp. 2433–2436 (2011)
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)
Kalyanpur, A., Parsia, B., Sirin, E., Hendler, J.A.: Debugging unsatisfiable classes in OWL ontologies. J. Web Sem., 268–293 (2005)
Schlobach, S., Cornet, R.: Non-Standard Reasoning Services for the Debugging of Description Logic Terminologies. In: IJCAI, pp. 355–362 (2003)
Suntisrivaraporn, B.: Finding all justifications in SNOMED CT. Research Article, 79–90 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, Z., Qi, G. (2013). Implementation and Evaluation of a Backtracking Algorithm for Finding All Justifications in OWL 2 EL. In: Qi, G., Tang, J., Du, J., Pan, J.Z., Yu, Y. (eds) Linked Data and Knowledge Graph. CSWS 2013. Communications in Computer and Information Science, vol 406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54025-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-54025-7_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54024-0
Online ISBN: 978-3-642-54025-7
eBook Packages: Computer ScienceComputer Science (R0)