Ontology-Based Access to Probabilistic Data
Ontology-Based Access to Probabilistic Data
复制标题
基于本体的概率数据访问
DOI：
--
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
C. Lutz
中科院分区：
文献类型：
--
作者：
J. C. Jung;C. Lutz
我们提出了一个在存在OWL2 QL本体论的情况下查询概率实例数据的框架，认为概率和本体论的相互作用在许多应用程序中，例如从网络中提取的数据进行管理。主要的推理问题是计算答案概率，可以使用标准概率数据库系统实现。我们通过取消概率数据库的相应结果来建立PTIME与#P二分法，以实现该问题的数据复杂性。我们还证明了查询重写（向后链接）是我们框架的重要工具，表明将重新写入一阶逻辑的不存在意味着＃p-hardness，并简要讨论答案概率的近似值。
We propose a framework for querying probabilistic instance data in the presence of an OWL2 QL ontology, arguing that the interplay of probabilities and ontologies is fruitful in many applications such as managing data that was extracted from the web. The prime inference problem is computing answer probabilities, and it can be implemented using standard probabilistic database systems. We establish a PTime vs. #P dichotomy for the data complexity of this problem by lifting a corresponding result from probabilistic databases. We also demonstrate that query rewriting (backwards chaining) is an important tool for our framework, show that non-existence of a rewriting into first-order logic implies #P-hardness, and briefly discuss approximation of answer probabilities.