受保护的混合知识库
Guarded Hybrid Knowledge Bases
摘要：
最近，有很多的兴趣在语义Web上的描述逻辑和规则的集成。我们定义了守护混合知识库（或g-混合知识库）的知识库，包括一个描述逻辑知识库和一个守护逻辑程序，类似于（Rosati 2006）的DL+日志知识库。G-hybrid知识库使描述逻辑和逻辑编程的集成成为可能，与其他方法不同，受保护程序规则中的变量不需要出现在主体的正非DL原子中，即DL原子也可以充当警卫。可满足性检查的g-混合知识库的可判定性显示为特定的DL DLRO，这是接近OWL DL，减少保护程序下的开放答案集语义。此外，我们证明了2-EXPTIME-完备性的可满足性检查这样的g-混合知识库。最后，我们讨论了我们的方法相比DL+日志知识库的优点和缺点。
英文摘要：
Recently, there has been a lot of interest in the integration of Description Logics and rules on the Semantic Web.We define guarded hybrid knowledge bases (or g-hybrid knowledge bases) as knowledge bases that consist of a Description Logic knowledge base and a guarded logic program, similar to the DL+log knowledge bases from (Rosati 2006). G-hybrid knowledge bases enable an integration of Description Logics and Logic Programming where, unlike in other approaches, variables in the rules of a guarded program do not need to appear in positive non-DL atoms of the body, i.e. DL atoms can act as guards as well. Decidability of satisfiability checking of g-hybrid knowledge bases is shown for the particular DL DLRO, which is close to OWL DL, by a reduction to guarded programs under the open answer set semantics. Moreover, we show 2-EXPTIME-completeness for satisfiability checking of such g-hybrid knowledge bases. Finally, we discuss advantages and disadvantages of our approach compared with DL+log knowledge bases.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
