arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.11222cs.LO
收藏

一种优化的基于KE-tableau的系统,用于描述逻辑 $\mathcal{DL}_{\mathbf{D}}^{4,\\!\times}$ 中的推理(扩展版)

An optimized KE-tableau-based system for reasoning in the description logic $\mathcal{DL}_{\mathbf{D}}^{4,\!\times}$ (Extended Version)

Domenico Cantone, Marianna Nicolosi-Asmundo, Daniele Francesco Santamaria

AI总结:

本文提出优化的KE$^γ$-tableau系统,用于描述逻辑$\mathcal{DL}_{\mathbf{D}}^{4,\\!\times}$的TBox和ABox推理,实验表明其性能比现有系统提升约400%。

摘要:

我们提出了一种基于KE-tableau的过程,用于描述逻辑 $\mathcal{DL}\langle \mathsf{4LQS^{R,\\!\times}}\rangle(\mathbf{D})$(简称 $\mathcal{DL}_{\mathbf{D}}^{4,\\!\times}$)的主要TBox和ABox推理任务。逻辑 $\mathcal{DL}_{\mathbf{D}}^{4,\\!\times}$ 可在可判定的多排序量化集合论片段 $\mathsf{4LQS^R}$ 中表示,它结合了诸如语义网规则语言(SWRL)等规则语言的高可扩展性和高效率,以及描述逻辑的表达能力。我们的算法基于一种针对全称量化子句集合的KE-tableau系统变体,其中KE-消去规则被推广以纳入$γ$-规则。这个新系统被称为KE$^γ$-tableau,它被证明是对文献\cite{RR2017}中引入的系统以及标准一阶KE-tableau \cite{dagostino94}的改进。在C++实现上对上述三个系统执行的合适基准测试集表明,基于KE$^γ$-tableau的推理器的性能通常比其他两个系统高出约400%。这是朝着基于可计算集合论片段构建表达性OWL本体的高效推理器迈出的第一步。

英文摘要:

We present a KE-tableau-based procedure for the main TBox and ABox reasoning tasks for the description logic $\mathcal{DL}\langle \mathsf{4LQS^{R,\!\times}}\rangle(\mathbf{D})$, in short $\mathcal{DL}_{\mathbf{D}}^{4,\!\times}$. The logic $\mathcal{DL}_{\mathbf{D}}^{4,\!\times}$, representable in the decidable multi-sorted quantified set-theoretic fragment $\mathsf{4LQS^R}$, combines the high scalability and efficiency of rule languages such as the Semantic Web Rule Language (SWRL) with the expressivity of description logics. Our algorithm is based on a variant of the KE-tableau system for sets of universally quantified clauses, where the KE-elimination rule is generalized in such a way as to incorporate the $γ$-rule. The novel system, called KE$^γ$-tableau, turns out to be an improvement of the system introduced in \cite{RR2017} and of standard first-order KE-tableau \cite{dagostino94}. Suitable benchmark test sets executed on C++ implementations of the three mentioned systems show that the performances of the KE$^γ$-tableau-based reasoner are often up to about 400% better than the ones of the other two systems. This a first step towards the construction of efficient reasoners for expressive OWL ontologies based on fragments of computable set-theory.

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

↑