微信服务号

微信订阅号

2025-4-3- 23
Home > Archive>Volume 29, Issue 10, 2018 >2948-2965. DOI:10.13328/j.cnki.jos.005550
PDF HTML XML Export Cite reminder
Debugging and Repairing Incoherent Ontologies Based on the Clash Path
Author:
Affiliation:

Fund Project:

National Natural Science Foundation of China (61672261, 61502199)

  • Article
    • | |
  • Metrics
    • |
  • Reference [36]
    • |
  • Related [20]
    • |
  • Cited by
    • | |
  • Comments
    Abstract:

    This study focuses on the debugging and repairing techniques for incoherent ontology based on the black-box method and discusses the limitations of the existing black-box methods and their optimizations. To solve this problem, the study proposes a new strategy called clash path for debugging and repairing incoherent ontology. This strategy can construct the clash path related to the basis clash models and then identify the clash set based on the clash path. In this case, deubgging can be rapidly performed based on the clash set because the clash set is smaller than the original ontology. In addition, the unsatisfiable dependent path can be identified from the clash path and the repair set can be easily obtained on the basis of the unsatisfiable dependent path. The theoretic proofs and experimental evaluation demonstrate that the presented debugging and repairing strategies are correct and efficiency.

    Reference
    [1] Baader F, Calvanese D, McGuinness D, Nardiand D, Patel-Schncider PF. Basic Description Logics. 2nd ed., Cambridge:Cambridge University Press, 2007. 47-100.
    [2] Li P, Jiang YC, Wang J. Modular ontology reuse based on conservative extension theory. Ruan Jian Xue Bao/Journal of Software, 2016,27(11):2777-2795(in Chinese with English abstract). http://www.jos.org.cn/1000-9825/4920.htm[doi:10.13328/j.cnki.jos. 004920]
    [3] Cui XJ, Ouyang DT, Ye YX. Integrity constraint validation for ontology using modularization. Journal of Information & Computational Science, 2014,11(9):2705-2713.[doi:10.12733/jics20103476]
    [4] Ouyang DT, Qu JF, Ye YX. Extending training set in distant supervision by ontology for relation extraction. Ruan Jian Xue Bao/Journal of Software, 2014,25(9):2088-2101(in Chinese with English abstract). http://www.jos.org.cn/1000-9825/4638.htm[doi:10.13328/j.cnki.jos.004638]
    [5] Schlobach S, Huang Z, Cornet R, Van Harmelen F. Debugging incoherent terminologies. Journal of Automated Reasoning, 2007,39(3):317-349.[doi:10.1007/s10817-007-9076-z]
    [6] Meyer T, Lee K, Booth R, Pan J.Z. Finding maximally satisfiable terminologies for the description logic ALC. In:Proc. of the 21st AAAI. American Association for Artificial Intelligence, 2006. 269-274.
    [7] Ouyang DT, Su J, Ye YX, Cui XJ. The ontology debugging method based on concept R-MUPS. Ruan Jian Xue Bao/Journal of Software, 2015,26(9):2231-2249(in Chinese with English abstract). http://www.jos.org.cn/1000-9825/4735.htm[doi:10.13328/j. cnki.jos.004735]
    [8] Schlobach S, Cornet R. Non-Standard reasoning services for the debugging of description logic terminologies. In:Proc. of the 18th Int'l Joint Conf. on Artificial Intelligence. 2003. 355-360.
    [9] Baader F, Penaloza R. Automata-Based axiom pinpointing. In:Proc. of the 4th IJCAR. Heidelberg:Springer-Verlag, 2008. 226-241.
    [10] Baader F, Penaloza R, Suntisrivaraporn B. Pinpointing in the description logic EL+. In:Proc. of the 20th DL. Tilburg:Sun SITE Central Europe CEUR-WS, 2007. 171-178.
    [11] Baader F, Suntisrivaraporn B. Debugging snomed CT using axiom pinpointing in the description logic EL+. In:Proc. of the 3rd KR-MED. Tilburg:Sun SITE Central Europe CEUR-WS, 2008. 1-7.
    [12] Kalyanpur A. Debugging and repair of OWL ontologies[Ph.D. Thesis]. Maryland:University of Maryland, 2006.
    [13] Kalyanpur A, Parsia B, Horridge M, Sirin E. Finding all justifications of OWL DL entailments. In:Proc. of the 6th ISWC. Heidelberg:Springer-Verlag, 2007. 267-280.[doi:10.1007/978-3-540-76298-0_20]
    [14] Cuencagrau B, Ian H, Yevgeny K, Ulrike S. Just the right amount:Extracting modules from ontologies. In:Proc. of the 16th Int'l World Wide Web Conf. New York:Association for Computing Machinery, 2007. 717-726.[doi:10.1145/1242572.1242669]
    [15] Ji Q, Qi GL, Haase P. A relevance-directed algorithm for finding justifications of DL entailments. In:Proc. of the 4th ASWC. Heidelberg:Springer-Verlag, 2009. 306-320.[doi:10.1007/978-3-642-10871-6_21]
    [16] Suntisrivaraporn B, Ji Q, Haase P. A modularization-based approach to finding all justifications for OWL DL entailments. In:Proc. of the 3rd ASWC. Heidelberg:Springer-Verlag, 2008. 1-15.[doi:10.1007/978-3-540-89704-0_1]
    [17] Del Vescovo C, Parsia B, Sattler U, Schneider T. The modular structure of an ontology:Atomic decomposition. In:Proc. of the 22nd Int'l Joint Conf. on Artificial Intelligence. 2011. 2232-2237.[doi:10.5591/978-1-57735-516-8/IJCAI11-372]
    [18] Grau BC, Halaschek-Wiener C. Incremental classification of description logics ontologies. Journal of Automated Reasoning, 2010,44:337-369.[doi:10.1007/s10817-009-9159-0]
    [19] Ji Q, Gao ZQ, Huang ZS, Zhu M. An efficient approach to debugging ontologies based on patterns. In:Proc. of the Joint Int'l Semantic Technology Conf. Heidelberg:Springer-Verlag, 2011. 425-433.[doi:10.1007/978-3-642-29923-0_33]
    [20] Horridge M. Justification based explanation in ontologies[Ph.D. Thesis]. Manchester:University of Manchester, 2011.
    [21] Shchekotykhin K, Friedrich G, Dietmar J. On computing minimal conflicts for ontology debugging. In:Proc. of the ECAI 2008 Workshop on Model-Based Systems. 2008. 7-11.
    [22] Ji Q, Gao ZQ, Huang ZS, Zhu M. Measuring effectiveness of ontology debugging systems. Knowledge-Based Systems, 2014,71:169-186.[doi:10.1016/j.knosys.2014.07.023]
    [23] Lam SC, Pan JZ, Sleeman D, Vasconcelos W. A fine-grained approach to resolving unsatisfiable ontologies. Journal on Data Semantics X, 2800,62-95.[doi:10.1007/978-3-540-77688-8_3]
    [24] Du JF. Qi GL, Fu XF. A practical fine-grained approach to resolving incoherent owl 2 DL terminologies. In:Proc. of the 23rd ACM-CIKM. 2014. 919-928.[doi:10.1145/2661829.2662046]
    [25] Fu XF, Qi GL, Zhang Y. A graph-based approach for calculating minimal unsatisfiability-preserving subsets of ontology in DL-Lite. Chinese Journal of Electronics, 2016,44(9):2040-2045(in Chinese with English abstract).[doi:10.3969/j.issn.0372-2112.2016.09. 002]
    [26] Fu XF, Qi GL, Zhang Y, Zhou, Z. Graph-Based approaches to debugging and revision of terminologies in DL-Lite. Knowledge-Based Systems, 2016,100:1-12.[doi:10.1016/j.knosys.2016.01.039]
    [27] Qi GL, Wang Z, Wang KW, et al. Approximating model-based ABox revision in DL-Lite:Theory and practice. In:Proc. of the 29th AAAI. AI Access Foundation. 2015. 254-260.
    [28] Gao SB, Qi GL, Wang HF. A new operator for ABox revision in DL-Lite. In:Proc. of the 26th AAAI Conf. on Artificial Intelligence. El Segundo:AI Access Foundation, 2012. 2423-2424.
    [29] Zhuang ZQ, Wang Z, Wang KW, Qi GL. Contraction and revision over DL-Lite TBoxes. In:Proc. of the 28th AAAI Conf. on Artificial Intelligence. El Segundo:AI Access Foundation, 2014. 1149-1155.
    [30] Parsia B, Sirin E, Kalyanpur A. Debugging owl ontologies. In:Proc of the WWW-2005. 2005,1:633-640.
    [31] Krötzsch M, Simancik F, Horrocks I. A description logic primer. Perspectives on Ontology Learning, 2014,18:3-20.
    附中文参考文献:
    [2] 李璞,蒋运承,王驹.基于保守扩充理论的模块化本体重用.软件学报,2016,27(11):2777-2795. http://www.jos.org.cn/1000-9825/4920.htm[doi:10.13328/j.cnki.jos.004920]
    [4] 欧阳丹彤,瞿剑峰,叶育鑫.关系抽取中基于本体的远监督样本扩充.软件学报,2014,25(9):2088-2101. http://www.jos.org.cn/1000-9825/4638.htm[doi:10.13328/j.cnki.jos.004638]
    [7] 欧阳丹彤,苏静,叶育鑫,崔仙姬.基于概念R-MUPS的本体调试方法.软件学报,2015,26(9):2231-2249. http://www.jos.org.cn/1000-9825/4735.htm[doi:10.13328/j.cnki.jos.004735]
    [25] 付雪峰,漆桂林,张勇.一种基于图的DL-Lite本体最小不可满足保持子集的计算方法.电子学报,2016,44(9):2040-2045.
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

张瑜,欧阳丹彤,叶育鑫.不协调本体调试与修复的冲突路径优化策略.软件学报,2018,29(10):2948-2965

Copy
Share
Article Metrics
  • Abstract:4390
  • PDF: 5611
  • HTML: 2971
  • Cited by: 0
History
  • Received:July 20,2017
  • Revised:November 08,2017
  • Online: February 08,2018
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the first2032491Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063