arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0106031cs.LOcs.AI
收藏

逻辑在知识表示中的复杂性结果及实用算法

Complexity Results and Practical Algorithms for Logics in Knowledge Representation

Stephan Tobies

摘要:

描述逻辑(DL)用于基于知识的系统中,以语义定义良好的方式表示和推理应用领域的术语知识。在这篇论文中,我们建立了一些新的复杂性结果,并给出了实用的算法,表达DL提供不同形式的计数量词。我们发现,在许多情况下,添加本地计数的形式,合格的数量限制DL不增加推理问题的复杂性,即使假设输入中的数字的二进制编码。另一方面,我们表明,添加不同形式的全球计数限制的逻辑可能会增加推理问题的复杂性显着。我们提供了精确的复杂性结果和一个实用的,基于表格的算法的DL SHIQ,这形成了高度优化的DL系统iFaCT的基础。最后,我们描述了一个表格算法的集团保护片段(CGF),我们希望将作为一个有效的实现CGF推理的基础。

英文摘要:

Description Logics (DLs) are used in knowledge-based systems to represent and reason about terminological knowledge of the application domain in a semantically well-defined manner. In this thesis, we establish a number of novel complexity results and give practical algorithms for expressive DLs that provide different forms of counting quantifiers. We show that, in many cases, adding local counting in the form of qualifying number restrictions to DLs does not increase the complexity of the inference problems, even if binary coding of numbers in the input is assumed. On the other hand, we show that adding different forms of global counting restrictions to a logic may increase the complexity of the inference problems dramatically. We provide exact complexity results and a practical, tableau based algorithm for the DL SHIQ, which forms the basis of the highly optimized DL system iFaCT. Finally, we describe a tableau algorithm for the clique guarded fragment (CGF), which we hope will serve as the basis for an efficient implementation of a CGF reasoner.

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

↑