Computing Least Common Subsumers in Description Logics with Existential Restrictions
Computing Least Common Subsumers in Description Logics with Existential Restrictions
复制标题
计算具有存在限制的描述逻辑中最不常见的子使用者
作者：
F. Baader;Ralf Küsters;R. Molitor
计算最小公共子集（les）是一个推理任务，可以用来支持，“自底向上”的知识库的KR系统的基础上的描述逻辑的建设。之前关于如何计算lcs的工作集中在允许普适值限制但不允许存在限制的描述逻辑上。本文的主要新贡献是描述逻辑与存在性限制的治疗。我们的方法计算的lcs是基于一个适当的表示的概念描述的某些树，和这些树之间的同态包容的表征。lcs操作对应于树上的乘积操作。
Computing the least common subsunier (les) is an inference task that can be used to support, the "bottom-up" construction of knowledge bases for KR systems based on description logics. Previous work on how to compute the lcs has concentrated on description logics that allow for universal value restrictions, but not for existential restrictions. The main new contribution of this paper is the treatment of description logics with existential restrictions. Our approach for computing the lcs is based on an appropriate representation of concept descriptions by certain trees, and a characterization of subsumption by homomorphisins between these trees. The lcs operation then corresponds to the product operation on trees.