Finite Model Reasoning in DL-Lite
Finite Model Reasoning in DL-Lite
复制标题
DL-Lite 中的有限模型推理
DOI：
10.1007/978-3-540-68234-9_18
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
R. Rosati
中科院分区：
文献类型：
--
作者：
R. Rosati
OWL-DL及其子类的语义基于一阶逻辑的经典语义，其中解释域可能是无限集。这构成了这种本体论语言的严重表达限制，因为在语义网的许多实际应用方案中，感兴趣的领域实际上是有限的，尽管该领域的确切基数尚不清楚。因此，在这些情况下，OWL-DL本体论的正式语义与其预期的语义不一致。在本文中，我们通过考虑与DL-Lite家族的逻辑相对应的OWL-DL的子类，并在此类逻辑中对有限模型进行推理，从而开始填补这一空白。特别是，我们主要考虑两个推理问题：确定本体的满意度，并在本体方面回答联合查询工会（UCQ）。我们首先考虑描述逻辑DL级别，并表明，对于上述两个问题，有限的模型推理与经典推理（即对任意，无限制模型的推理）一致。然后，我们分析描述逻辑DL-LiteF和DL-Litea。与DL级别不同，在Sostlogics有限模型推理中，与经典推理不一致。为了解决这些逻辑中有限模型的满意度和查询答案，我们定义了在多项式上将上述推理问题超过有限模型降低到任意模型的相应问题的技术。因此，对于所有考虑的DL-Lite语言，在有限的模型语义下，经典语义下的满意度和查询回答的良好计算属性也存在。此外，我们已经有效，轻松地实施了上述技术，并在支持有限模型推理的支持下扩展了DL-Lite推理Quonto。
The semantics of OWL-DL and its subclasses are based on the classical semantics of first-order logic, in which the interpretation domain may be an infinite set. This constitutes a serious expressive limitation for such ontology languages, since, in many real application scenarios for the Semantic Web, the domain of interest is actually finite, although the exact cardinality of the domain is unknown. Hence, in these cases the formal semantics of the OWL-DL ontology does not coincide with its intended semantics. In this paper we start filling this gap, by considering the subclasses of OWL-DL which correspond to the logics of the DL-Lite family, and studying reasoning over finite models in such logics. In particular, we mainly consider two reasoning problems: deciding satisfiability of an ontology, and answering unions of conjunctive queries (UCQs) over an ontology. We first consider the description logic DL-LiteR and show that, for the two above mentioned problems, finite model reasoning coincides with classical reasoning, i.e., reasoning over arbitrary, unrestricted models. Then, we analyze the description logics DL-LiteF and DL-LiteA. Differently from DL-LiteR, in suchlogics finite model reasoning does not coincide with classical reasoning. To solve satisfiability and query answering over finite models in these logics, we define techniques which reduce polynomially both the above reasoning problems over finite models to the corresponding problem over arbitrary models. Thus, for all the DL-Lite languages considered, the good computational properties of satisfiability and query answering under the classical semantics also hold under the finite model semantics. Moreover, we have effectively and easily implemented the above techniques, extending the DL-Lite reasoner QuOnto with support for finite model reasoning.
影响因子：
5
作者：
Glimm, Birte;Horrocks, Ian;Sattler, Ulrike
通讯作者：
Sattler, Ulrike