Abstract
Ontology debugging is an important nonstandard reasoning task in ontology engineering which provides the explanations of the causes of incoherence in an ontology. In this paper, we propose a graph-based algorithm to calculate minimal incoherence-preserving subterminology (MIPS) of an ontology in a light-weight ontology language, DL-Lite. We first encode a DL-Lite ontology to a graph, then calculate all the MIPS of an ontology by backtracking some pairs of nodes in the graph. We implement the algorithm and conduct experiments over some real ontologies. The experimental results show that our debugging system is efficient and outperforms the existing systems.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. Journal of Artificial Intelligence Research 36(1), 1–69 (2009)
Baader, F., Peñaloza, R.: Automata-based axiom pinpointing. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 226–241. Springer, Heidelberg (2008)
Baader, F., Peñaloza, R., Suntisrivaraporn, B.: Pinpointing in the description logic \(\cal EL\). In: Hertzberg, J., Beetz, M., Englert, R. (eds.) KI 2007. LNCS (LNAI), vol. 4667, pp. 52–67. Springer, Heidelberg (2007)
Bienvenu, M., Rosati, R.: Tractable approximations of consistent query answering for robust ontology-based data access. In: Proc. of IJCAI 2013 (2013)
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-Lite family. Journal of Automated Reasoning 39(3), 385–429 (2007)
Friedrich, G.E., Shchekotykhin, K.: A general diagnosis method for ontologies. In: Gil, Y., Motta, E., Benjamins, V.R., Musen, M.A. (eds.) ISWC 2005. LNCS, vol. 3729, pp. 232–246. Springer, Heidelberg (2005)
Gao, S., Qi, G., Wang, H.: A new operator for ABox revision in DL-Lite. In: Proc. of AAAI 2012, pp. 2423–2324 (2012)
Grau, B.C., Horrocks, I., Kazakov, Y., Sattler, U.: Just the right amount: extracting modules from ontologies. In: Proc. of WWW 2007, pp. 717–726 (2007)
Ji, Q., Gao, Z., Huang, Z., Zhu, M.: An efficient approach to debugging ontologies based on patterns. In: Pan, J.Z., Chen, H., Kim, H.-G., Li, J., Horrocks, I., Mizoguchi, R., Wu, Z., Wu, Z. (eds.) JIST 2011. LNCS, vol. 7185, pp. 425–433. Springer, Heidelberg (2012)
Junker, U.: Quickxplain: preferred explanations and relaxations for over-constrained problems. In: Proc. of AAAI 2004, pp. 167–172 (2004)
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.: Debugging unsatisfiable classes in OWL ontologies. Journal of Web Semantics 3(4), 268–293 (2005)
Lembo, D., Santarelli, V., Savo, D.F.: Graph-Based ontology classification in OWL 2 QL. In: Cimiano, P., Corcho, O., Presutti, V., Hollink, L., Rudolph, S. (eds.) ESWC 2013. LNCS, vol. 7882, pp. 320–334. Springer, Heidelberg (2013)
Parsia, B., Sirin, E., Kalyanpur, A.: Debugging OWL ontologies. In: Proc. of the WWW 2005, pp. 633–640 (2005)
Raunich, S., Rahm, E.: Towards a benchmark for ontology merging. In: Herrero, P., Panetto, H., Meersman, R., Dillon, T. (eds.) OTM-WS 2012. LNCS, vol. 7567, pp. 124–133. Springer, Heidelberg (2012)
Robinson, I., Webber, J., Eifrem, E.: Graph Databases, pp. 25–63. O’Reilly Media Inc. (2013)
Schlobach, S., Cornet, R.: Non-standard reasoning services for the debugging of description logic terminologies. In: Proc. of IJCAI 2003, pp. 355–362 (2003)
Schlobach, S., Huang, Z., Cornet, R., Van Harmelen, F.: Debugging incoherent terminologies. Journal of Automated Reasoning 39(3), 317–349 (2007)
Wang, H., Horridge, M., Rector, A.L., Drummond, N., Seidenberg, J.: Debugging OWL-DL ontologies: a heuristic approach. In: Gil, Y., Motta, E., Benjamins, V.R., Musen, M.A. (eds.) ISWC 2005. LNCS, vol. 3729, pp. 745–757. Springer, Heidelberg (2005)
Webber, J.: A programmatic introduction to neo4j. In: Proc. of SPLASH 2012, pp. 217–218 (2012)
Zhou, L., Huang, H., Qi, G., Qu, Y., Ji, Q.: An algorithm for calculating minimal unsatisfiability-preserving subsets of ontology in dl-lite. Journal of Computer Research and Development 48(3), 2334–2342 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Fu, X., Zhang, Y., Qi, G. (2015). A Graph-Based Approach to Ontology Debugging in DL-Lite. In: Supnithi, T., Yamaguchi, T., Pan, J., Wuwongse, V., Buranarach, M. (eds) Semantic Technology. JIST 2014. Lecture Notes in Computer Science(), vol 8943. Springer, Cham. https://doi.org/10.1007/978-3-319-15615-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-15615-6_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15614-9
Online ISBN: 978-3-319-15615-6
eBook Packages: Computer ScienceComputer Science (R0)