Finding All Justifications of OWL DL Entailments
Finding All Justifications of OWL DL Entailments
复制标题
DOI：
10.1007/978-3-540-76298-0_20
复制
发表时间：
2007-11
期刊：
影响因子：
--
通讯作者：
Aditya Kalyanpur;B. Parsia;M. Horridge;E. Sirin
中科院分区：
文献类型：
--
作者：
Aditya Kalyanpur;B. Parsia;M. Horridge;E. Sirin
找到一个蕴涵的理由（即，所有的最小公理集足以产生一个蕴涵）已经成为Web本体语言（OWL）的关键推理服务。调整对于调试不可满足的类和矛盾是必不可少的。作为蕴涵解释的合理性的可用性提高了大型和复杂本体的可理解性。在本文中，我们提出了几种算法，计算所有的理由的蕴涵在OWL-DL本体，并显示，通过实证评估，即使是一个推理机独立的方法工作良好的真实的本体。
Finding the justifications of an entailment (that is, all the minimal set of axioms sufficient to produce an entailment) has emerged as a key inference service for the Web Ontology Language (OWL). Justifications are essential for debugging unsatisfiable classes and contradictions. The availability of justifications as explanations of entailments improves the understandability of large and complex ontologies. In this paper, we present several algorithms for computing all the justifications of an entailment in an OWL-DL Ontology and show, by an empirical evaluation, that even a reasoner independent approach works well on real ontologies.