A Graph-Based Approach to Ontology Debugging in DL-Lite

详细信息    查看全文

• 作者：Xuefeng Fu (18)
  Yong Zhang (18)
  Guilin Qi (18)
  
• 关键词：$$\textit{DL ; Lite}$$ ; Ontology ; Debugging ; MIPS ; Graph
• 刊名：Lecture Notes in Computer Science
• 出版年：2015
• 出版时间：2015
• 年：2015
• 卷：8943
• 期：1
• 页码：33-46
• 全文大小：319 KB
• 参考文献：1. Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. Journal of Artificial Intelligence Research 36(1), 1鈥?9 (2009)
  2. 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鈥?41. Springer, Heidelberg (2008) CrossRef
  3. 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鈥?7. Springer, Heidelberg (2007) CrossRef
  4. Bienvenu, M., Rosati, R.: Tractable approximations of consistent query answering for robust ontology-based data access. In: Proc. of IJCAI 2013 (2013)
  5. 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鈥?29 (2007) CrossRef
  6. 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鈥?46. Springer, Heidelberg (2005) CrossRef
  7. Gao, S., Qi, G., Wang, H.: A new operator for ABox revision in DL-Lite. In: Proc. of AAAI 2012, pp. 2423鈥?324 (2012)
  8. Grau, B.C., Horrocks, I., Kazakov, Y., Sattler, U.: Just the right amount: extracting modules from ontologies. In: Proc. of WWW 2007, pp. 717鈥?26 (2007)
  9. 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鈥?33. Springer, Heidelberg (2012) CrossRef
  10. Junker, U.: Quickxplain: preferred explanations and relaxations for over-constrained problems. In: Proc. of AAAI 2004, pp. 167鈥?72 (2004)
  11. 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鈥?80. Springer, Heidelberg (2007) CrossRef
  12. Kalyanpur, A., Parsia, B., Sirin, E., Hendler, J.: Debugging unsatisfiable classes in OWL ontologies. Journal of Web Semantics 3(4), 268鈥?93 (2005) CrossRef
  13. 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鈥?34. Springer, Heidelberg (2013) CrossRef
  14. Parsia, B., Sirin, E., Kalyanpur, A.: Debugging OWL ontologies. In: Proc. of the WWW 2005, pp. 633鈥?40 (2005)
  15. 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鈥?33. Springer, Heidelberg (2012) CrossRef
  16. Robinson, I., Webber, J., Eifrem, E.: Graph Databases, pp. 25鈥?3. O鈥橰eilly Media Inc. (2013)
  17. Schlobach, S., Cornet, R.: Non-standard reasoning services for the debugging of description logic terminologies. In: Proc. of IJCAI 2003, pp. 355鈥?62 (2003)
  18. Schlobach, S., Huang, Z., Cornet, R., Van Harmelen, F.: Debugging incoherent terminologies. Journal of Automated Reasoning 39(3), 317鈥?49 (2007) CrossRef
  19. 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鈥?57. Springer, Heidelberg (2005) CrossRef
  20. Webber, J.: A programmatic introduction to neo4j. In: Proc. of SPLASH 2012, pp. 217鈥?18 (2012)
  21. 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鈥?342 (2011)
  
• 作者单位：Xuefeng Fu (18)
  Yong Zhang (18)
  Guilin Qi (18)
  
  18. School of Computer Science and Engineering, Southeast University, Nanjing, China
  
• 丛书名：Semantic Technology
• ISBN：978-3-319-15615-6
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349

文摘

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.