Computing the least common subsumer w.r.t. a background terminology

被引：5

作者：

Baader, F ^{[1
]}

Sertkaya, B ^{[1
]}

Turhan, AY ^{[1
]}

机构：

[1] TU Dresden, Dresden, Germany

来源：

LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS | 2004年 / 3229卷

关键词：

D O I：

10.1007/978-3-540-30227-8_34

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive Description Logics (DLs) whereas existing knowledge bases are written in very expressive Us. In order to allow the user to re-use concepts defined in such terminologies and still support the definition of new concepts by computing the lcs, we extend the notion of the lcs of concept descriptions to the notion of the Ics w.r.t. a background terminology. We will both show a theoretical result on the existence of the least common subsumer in this setting, and describe a practical approach (based on a method from formal concept analysis) for computing good common subsumers, which may, however, not be the least ones.

引用

页码：400 / 412

页数：13