Conservative Extensions in Expressive Description Logics

被引:0
|
作者
Lutz, Carsten [1 ]
Walther, Dirk [2 ]
Wolter, Frank [2 ]
机构
[1] Tech Univ Dresden, Inst Theoret Informat, Dresden, Germany
[2] Univ Liverpool, Dept Comp Sci, Liverpool, Merseyside, England
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The notion of a conservative extension plays a central role in ontology design and integration: it can be used to formalize ontology refinements, safe mergings of two ontologies, and independent modules inside an ontology. Regarding reasoning support, the most basic task is to decide whether one ontology is a conservative extension of another. It has recently been proved that this problem is decidable and 2ExpTime-complete if ontologies are formulated in the basic description logic ALC. We consider more expressive description logics and begin to map out the boundary between logics for which conservativity is decidable and those for which it is not. We prove that conservative extensions are 2ExpTime-complete in ALCQI, but undecidable in ALCQIO. We also show that if conservative extensions are defined model-theoretically rather than in terms of the consequence relation, they are undecidable already in ALC.
引用
收藏
页码:453 / 458
页数:6
相关论文
共 50 条
  • [1] Conservative extensions in horn description logics with inverse roles
    Jung J.C.
    Lutz C.
    Martel M.
    Schneider T.
    [J]. 1600, AI Access Foundation (68): : 365 - 411
  • [2] Conservative Extensions in Horn Description Logics with Inverse Roles
    Jung, Jean Christoph
    Lutz, Carsten
    Martel, Mauricio
    Schneider, Thomas
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2020, 68 : 365 - 411
  • [3] Query Conservative Extensions in Horn Description Logics with Inverse Roles
    Jung, Jean Christoph
    Lutz, Carsten
    Martel, Mauricio
    Schneider, Thomas
    [J]. PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 1116 - 1122
  • [4] Expressive probabilistic description logics
    Lukasiewicz, Thomas
    [J]. ARTIFICIAL INTELLIGENCE, 2008, 172 (6-7) : 852 - 883
  • [5] On conservative extensions in logics with infinitary predicates
    Ferenczi M.
    [J]. Studia Logica, 2009, 92 (1) : 121 - 135
  • [6] Beth definability in expressive description logics
    [J]. 1600, AI Access Foundation (48):
  • [7] Datalog and description logics: Expressive power
    Cadoli, M
    Palopoli, L
    Lenzerini, M
    [J]. DATABASE PROGRAMMING LANGUAGES, 1998, 1369 : 281 - 298
  • [8] Semantic Forgetting in Expressive Description Logics
    Sakr, Mostafa
    Schmidt, Renate A.
    [J]. FRONTIERS OF COMBINING SYSTEMS (FROCOS 2021), 2021, 12941 : 118 - 136
  • [9] Role Conjunctions in Expressive Description Logics
    Glimm, Birte
    Kazakov, Yevgeny
    [J]. LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS, 2008, 5330 : 391 - 405
  • [10] Expressive number restrictions in description logics
    Baader, F
    Sattler, U
    [J]. JOURNAL OF LOGIC AND COMPUTATION, 1999, 9 (03) : 319 - 350