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
关键词
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
相关论文
共 50 条
  • [1] Computing the least common subsumer in the description Logic εL w.r.t. terminological cycles with descriptive semantics
    Baader, F
    [J]. CONCEPTUAL STRUCTURES FOR KNOWLEDGE CREATION AND COMMUNICATION, 2003, 2746 : 117 - 130
  • [2] A Proof-Theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in EL w.r.t. Hybrid TBoxes
    Novakovic, Novak
    [J]. LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2008, 5293 : 311 - 323
  • [3] Computing the least common subsumer in description logic FLEN
    Zhang, Wei
    Hou, Jinhong
    Cao, Fasheng
    Wang, Ju
    Jiang, Yuncheng
    [J]. Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2010, 47 (06): : 1053 - 1059
  • [4] Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely
    Gawlitza, Thomas Martin
    Seidl, Helmut
    [J]. STATIC ANALYSIS, 2010, 6337 : 271 - +
  • [5] Computing Compliant Anonymisations of Quantified ABoxes w.r.t. EL Policies
    Baader, Franz
    Kriegel, Francesco
    Nuradiansyah, Adrian
    Penaloza, Rafael
    [J]. SEMANTIC WEB - ISWC 2020, PT I, 2020, 12506 : 3 - 20
  • [6] Computing Optimal Repairs of Quantified ABoxes w.r.t. Static EL TBoxes
    Baader, Franz
    Koopmann, Patrick
    Kriegel, Francesco
    Nuradiansyah, Adrian
    [J]. AUTOMATED DEDUCTION, CADE 28, 2021, 12699 : 309 - 326
  • [7] Deciding Subsumers of Least Fixpoint Concepts w.r.t. general εL-TBoxes
    Feng, Shasha
    Ludwig, Michel
    Walther, Dirk
    [J]. KI 2015: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2015, 9324 : 59 - 71
  • [8] Designing Distributed Systems w.r.t. Conformance
    Bhateja, Puneet
    [J]. 2015 22ND ASIA-PACIFIC SOFTWARE ENGINEERING CONFERENCE (APSEC 2015), 2015, : 104 - 110
  • [9] An inverse spectral problem w.r.t. domain
    Gasimov, Yusif S.
    [J]. JOURNAL OF MATHEMATICAL PHYSICS ANALYSIS GEOMETRY, 2008, 4 (03) : 358 - 370
  • [10] Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions
    Baader, F
    Küsters, R
    [J]. KI-98: ADVANCES IN ARTIFICIAL INTELLIGENCE, 1998, 1504 : 129 - 140