The Not-So-Easy Task of Computing Class Subsumptions in OWL RL
The Not-So-Easy Task of Computing Class Subsumptions in OWL RL
复制标题
在 OWL RL 中计算类包含的任务并不容易
DOI：
--
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
M. Krötzsch
中科院分区：
文献类型：
--
作者：
M. Krötzsch
轻量级本体语言OWL RL用于对大量数据进行推理。为此，W3C标准提供了一个简单的推导规则系统，该系统直接对OWL的RDF语法进行操作。已经研究了几个类似的系统。然而，这些方法通常仅适用于实例检索。本文询问这些方法是否以及如何也可以用于计算蕴含的子类关系。检查任意 OWL RL 类包含的蕴含是共 NP 困难的，但当限制于原子类之间的包含时，基于规则的推理是可能的。然而，令人惊讶的是，这在任何基于 RDF 的规则系统中都无法实现，即 W3C 演算无法扩展到计算所有原子类包含。我们确定了句法限制来缓解这个问题，并提出了一个对于许多 OWL RL 本体而言健全且完整的规则系统。
The lightweight ontology language OWL RL is used for reasoning with large amounts of data. To this end, the W3C standard provides a simple system of deduction rules, which operate directly on the RDF syntax of OWL. Several similar systems have been studied. However, these approaches are usually complete for instance retrieval only. This paper asks if and how such methods could also be used for computing entailed subclass relationships. Checking entailment for arbitrary OWL RL class subsumptions is co-NP-hard, but tractable rule-based reasoning is possible when restricting to subsumptions between atomic classes. Surprisingly, however, this cannot be achieved in any RDF-based rule system, i.e., the W3C calculus cannot be extended to compute all atomic class subsumptions. We identify syntactic restrictions to mitigate this problem, and propose a rule system that is sound and complete for many OWL RL ontologies.
非循环条件及其在描述逻辑查询应答中的应用
DOI：
--
发表时间：
2012
期刊：
--
影响因子：
--
作者：
Cuenca Grau B
通讯作者：
Cuenca Grau B