Extracting Finite Sets of Entailments from OWL Ontologies
Extracting Finite Sets of Entailments from OWL Ontologies
复制标题
从 OWL 本体中提取有限蕴含集
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
U. Sattler
中科院分区：
文献类型：
--
作者：
Samantha Bail;B. Parsia;U. Sattler
规范化的标准描述逻辑推理服务是分类，即生成由某个本体所蕴涵的原子包含集。虽然这个结果关系是明确定义和有限的，但在该集合的组成中存在显著差异。例如，通常（在工具和讨论中）排除一些重言式（例如，A v >，A v A）。虽然对于许多目的来说，这种差异是无害的，但对于许多目的来说，分类中出现的内容的精确性是至关重要的，例如，估计逻辑内容的差异。在本文中，我们提出了不同类型的有限蕴涵集的OWL本体的基础上，其断言和推断类图的传递闭包和传递约简的定义。这项工作的目的是引入一个灵活的和可扩展的规范选择一组特定的蕴涵，以确保基于OWL的应用程序的正确性和可复制性的目的。
The canonical standard description logic reasoning service is classification, that is, the generation of the set of atomic subsumptions which are entailed by some ontology. While this consequence relation is well defined and finite, there is significant variance in the composition of that set. For example, it is common (in tools and in discussion) to exclude some tautologies (e.g., A v >, A v A). While for many purposes such divergences are harmless, there are many for which precision about what appears in the classification is essential, for example, estimating differences in logical content. In this paper, we propose definitions for different types of finite entailment sets of an OWL ontology based on the transitive closure and transitive reduction of its asserted and inferred class graphs. The purpose of this work is to introduce a flexible and extensible specification for selecting a particular set of entailments, with the aim of ensuring the correctness and replicability of OWL-based applications.