arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2308.03705cs.LO
收藏

结合描述逻辑与具体域推理的证明(技术报告)

Combining Proofs for Description Logic and Concrete Domain Reasoning (Technical Report)

Christian Alrabbaa, Franz Baader, Stefan Borgwardt, Patrick Koopmann, Alisa Kovtunova

AI总结:

本文针对扩展有理数具体域的轻量级描述逻辑,提出可提取证明的推理过程,并将其与纯DL推理结合,生成同时解释DL与CD推理的集成证明。

摘要:

基于逻辑的人工智能方法具有一个优势:原则上可以借助计算所得结论的证明来解释其行为。对于基于描述逻辑(DL)的本体,我们已将这一优势付诸实践,展示了如何计算由DL推理器得出的结论的证明,并以用户友好的方式加以展示。然而,在数值推理同样相关的应用中,这些方法尚不充分。本文考虑扩展了基于有理数的具体域(CD)的描述逻辑的证明问题,若将其集成到轻量级DL $\mathcal{E}\hspace{-0.1em}\mathcal{L}_\bot$ 中,推理仍保持可处理性。由于目前没有已实现的DL推理器支持这些具体域,我们首先为它们开发推理过程,并展示如何将其与纯DL的推理方法相结合,既适用于 $\mathcal{E}\hspace{-0.1em}\mathcal{L}_\bot$,也适用于表达能力更强的DL $\mathcal{ALC}$。这些过程的设计使得从中提取证明变得容易。我们展示了如何将提取出的CD证明与DL侧的证明结合为集成证明,以同时解释DL和CD的推理。

英文摘要:

Logic-based approaches to AI have the advantage that their behavior can in principle be explained with the help of proofs of the computed consequences. For ontologies based on Description Logic (DL), we have put this advantage into practice by showing how proofs for consequences derived by DL reasoners can be computed and displayed in a user-friendly way. However, these methods are insufficient in applications where also numerical reasoning is relevant. The present paper considers proofs for DLs extended with concrete domains (CDs) based on the rational numbers, which leave reasoning tractable if integrated into the lightweight DL $\mathcal{E}\hspace{-0.1em}\mathcal{L}_\bot$. Since no implemented DL reasoner supports these CDs, we first develop reasoning procedures for them, and show how they can be combined with reasoning approaches for pure DLs, both for $\mathcal{E}\hspace{-0.1em}\mathcal{L}_\bot$ and the more expressive DL $\mathcal{ALC}$. These procedures are designed such that it is easy to extract proofs from them. We show how the extracted CD proofs can be combined with proofs on the DL side into integrated proofs that explain both the DL and the CD reasoning.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑