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

描述逻辑${\cal ALC}$的有限基定理

A finite basis theorem for the description logic ${\cal ALC}$

Marc Aiguier, Jamal Atif, Isabelle Bloch, Céline Hudelot

摘要:

本文的主要结果是证明了描述逻辑${\cal ALC}$中有限基的存在性。我们证明了在有限模型中成立的广义概念包含(GCI)的集合总是有一个有限基,即这些GCI可以从多个GCI中导出。这一结果推广了Baader和Distel的一个结果,该结果表明,对于非表达描述逻辑${\cal EL}$和${\cal EL}_{gfp}$,GCI在有限模型中存在有限基。我们还提供了一个算法来计算这个有限基,并证明其正确性。作为一个副产品,我们扩展我们的有限基定理,以任何非线性生成的完全余种(即任何类的模型关闭下态射域,余积和商,并从有限的一组有限模型)。

英文摘要:

The main result of this paper is to prove the existence of a finite basis in the description logic ${\cal ALC}$. We show that the set of General Concept Inclusions (GCIs) holding in a finite model has always a finite basis, i.e. these GCIs can be derived from finitely many of the GCIs. This result extends a previous result from Baader and Distel, which showed the existence of a finite basis for GCIs holding in a finite model but for the inexpressive description logics ${\cal EL}$ and ${\cal EL}_{gfp}$. We also provide an algorithm for computing this finite basis, and prove its correctness. As a byproduct, we extend our finite basis theorem to any finitely generated complete covariety (i.e. any class of models closed under morphism domain, coproduct and quotient, and generated from a finite set of finite models).

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

↑