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

有理数闭包下名义安全$\mathcal{ELO}_\bot$的多项式时间包容算法

A Polynomial Time Subsumption Algorithm for Nominal Safe $\mathcal{ELO}_\bot$ under Rational Closure

University of Luxembourg(卢森堡大学);ISTI - CNR(意大利国家研究委员会信息科学与技术研究所);University of Cape Town(开普敦大学);CAIR(开普敦人工智能研究所)

Giovanni Casini, Umberto Straccia, Thomas Meyer

摘要:

有理闭包下的描述逻辑是描述逻辑中非单调推理的一个著名框架。在本文中,我们解决的概念包容决策问题下RC标称安全$\mathcal{ELO}_\bot$,一个显着的和实际上重要的DL代表的OWL 2配置文件OWL 2 EL。我们在这里的贡献是定义一个多项式时间包容程序标称安全$\mathcal{ELO}_\bot$ RC下,完全依赖于一系列的经典,单调的$\mathcal{EL}_\bot$包容测试。因此,任何现有的经典单调$\mathcal{EL}_\bot$推理机可以作为一个黑盒来实现我们的方法。然后,我们还适应的方法,以RC的DL的已知扩展之一,即基于可废止继承的DL,而不会失去计算的易处理性。

英文摘要:

Description Logics (DLs) under Rational Closure (RC) is a well-known framework for non-monotonic reasoning in DLs. In this paper, we address the concept subsumption decision problem under RC for nominal safe $\mathcal{ELO}_\bot$, a notable and practically important DL representative of the OWL 2 profile OWL 2 EL. Our contribution here is to define a polynomial time subsumption procedure for nominal safe $\mathcal{ELO}_\bot$ under RC that relies entirely on a series of classical, monotonic $\mathcal{EL}_\bot$ subsumption tests. Therefore, any existing classical monotonic $\mathcal{EL}_\bot$ reasoner can be used as a black box to implement our method. We then also adapt the method to one of the known extensions of RC for DLs, namely Defeasible Inheritance-based DLs without losing the computational tractability.

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

↑