基于$\mathcal{FL}_{o}$ Wer推理机的带值约束的高效TBox推理
Efficient TBox Reasoning with Value Restrictions using the $\mathcal{FL}_{o}$wer reasoner
摘要:
描述逻辑(DL)$\mathcal{FL}_0$,其中有合取和值限制作为其唯一的概念构造器,已经陷入了声名狼借,当它被证明是推理$\mathcal{FL}_0$ w.r.t.一般的TBox是ExpTime完成的,即,和表达能力更强的逻辑$\mathcal{ALC}$一样难。在本文中,我们恢复$\mathcal{FL}_0$提出了一个专用的包容算法$\mathcal{FL}_0$,这是非常简单的基于表格的算法采用高度优化的DL推理。我们的实验表明,我们的新算法的性能,原型实现在我们的$\mathcal{FL}_o$ wer推理机,比较非常好的高度优化的推理机。$\mathcal{FL}_o$也可以处理在$\mathcal{FL}_0$的扩展$\mathcal{FL}_{\bot}$中编写的具有顶部和底部概念的本体,通过采用本文所示的多项式时间约简,消除了顶部和底部。我们还研究了与$\mathcal{FL}_0$和$\mathcal{FL}_{\bot}$的Horn片段相关的DL中推理的复杂性。
英文摘要:
The inexpressive Description Logic (DL) $\mathcal{FL}_0$, which has conjunction and value restriction as its only concept constructors, had fallen into disrepute when it turned out that reasoning in $\mathcal{FL}_0$ w.r.t. general TBoxes is ExpTime-complete, i.e., as hard as in the considerably more expressive logic $\mathcal{ALC}$. In this paper, we rehabilitate $\mathcal{FL}_0$ by presenting a dedicated subsumption algorithm for $\mathcal{FL}_0$, which is much simpler than the tableau-based algorithms employed by highly optimized DL reasoners. Our experiments show that the performance of our novel algorithm, as prototypically implemented in our $\mathcal{FL}_o$wer reasoner, compares very well with that of the highly optimized reasoners. $\mathcal{FL}_o$wer can also deal with ontologies written in the extension $\mathcal{FL}_{\bot}$ of $\mathcal{FL}_0$ with the top and the bottom concept by employing a polynomial-time reduction, shown in this paper, which eliminates top and bottom. We also investigate the complexity of reasoning in DLs related to the Horn-fragments of $\mathcal{FL}_0$ and $\mathcal{FL}_{\bot}$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。