Consequence-based Axiom Pinpointing for Expressive Description Logic Ontologies

被引：0
|
作者：
Li J. [1 ,2 ]
Ouyang D.-T. [1 ,2 ]
Ye Y.-X. [1 ,2 ]
机构：
[1] College of Computer Science and Technology, Jilin University, Changchun
[2] Key Laboratory of Symbolic Computation and Knowledge Engineering, Ministry of Education, Jilin University, Changchun
来源：
Ruan Jian Xue Bao/Journal of Software | 2023年 / 34卷 / 08期
关键词：
axiom pinpointing; black-box; consequence-based method; glass-box; pinpointing rules;
D O I：
10.13328/j.cnki.jos.006870
中图分类号：
学科分类号：
摘要：
Axiom pinpointing has attracted extensive interest for Description Logics due to its effect of exploring explicable defects in the ontology and searching hidden justifications for the logic consequence. Balancing the expressive power of description logics and the solving efficiency of reasoners has always been the focus of axiom pinpointing research. In this paper, from both glass-box and black-box perspectives proposed a consequence-based method to computing justifications. The glass-box method uses modified reasoning rules to trace the specific process of inference, and introduces the concept of pinpointing formula to establish the correspondence between the label of Boolean formula and all the minimal axioms sets. The black-box method directly calls the inference engine based on the unmodified reasoning rules, and further uses the HST to compute all justifications for the inference. Two reasoning tools have been designed based on the two axiom pinpointing algorithms for expressive description logics ontologies. Its feasibility is verified theoretically and experimentally, and its solving efficiency is compared with that of existing axiom pinpointing tools. © 2023 Chinese Academy of Sciences. All rights reserved.
引用
收藏
相关论文
共 24 条
  • [1] Baader F, Calvanese D, McGuinness D, Nardiand D, Patel-Schncider P F., Basic Description Logics, pp. 47-100, (2007)
  • [2] Suntisrivaraporn B, Baader F, Schulz S, Spackman K A., Replacing SEP-Triplets in SNOMED CT Using Tractable Description Logic Operators, Proc. of the 11th Conference on Artificial Intelligence in Medicine, pp. 287-291, (2007)
  • [3] Schlobach S, Cornet R., Non-standard Reasoning Services for the Debugging of Description Logic Terminologies, Proc. of the 18th International Joint Conference on Artificial Intelligence, pp. 355-362, (2003)
  • [4] Kalyanpur A, Parsia B, Sirin E, Hendler J A., Debugging Unsatisfiable Classes in OWL Ontologies, Journal of Web Semantics, 3, 4, pp. 268-293, (2005)
  • [5] Kalyanpur A, Parsia B, Horridge M, Sirin E., Finding All Justifications of OWL DL Entailments, Proc. of the 16th International Semantic Web Conference, pp. 267-280, (2007)
  • [6] Ouyang DT, Su J, Ye YX, Cui XJ., The ontology debugging method based on concept R-MUPS, Ruan Jian Xue Bao/Journal of Software, 26, 9, pp. 2231-2249, (2015)
  • [7] Schlobach S, Huang Z, Cornet R, Van Harmelen F., Debugging Incoherent Terminologies, Journal of Automated Reasoning, 39, 3, pp. 317-349, (2007)
  • [8] Ji Q, Qi GL, Haase P., A Relevance-Directed Algorithm for Finding Justifications of DL Entailments, Proc. of the 4th Asian Conference on the Semantic Web, pp. 306-320, (2009)
  • [9] Zhang Y, Ouyang DT, Ye YX., Debugging and repairing incoherent ontologies based on the clash path, Ruan Jian Xue Bao/Journal of Software, 29, 10, pp. 2948-2965, (2018)
  • [10] Zhang Y, Ouyang DT, Cui XJ, Ye YX., Semi-Models Based Justifications Detection for OWL Ontologies, Chinese Journal of Computers, 41, 12, pp. 2710-1733, (2018)
123