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
来源
20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE | 2007年
关键词
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
相关论文
共 12 条
  • [1] Antoniou G, 2000, INT J INTELL SYST, V15, P623, DOI 10.1002/(SICI)1098-111X(200007)15:7<623::AID-INT3>3.0.CO
  • [2] 2-C
  • [3] Baader R, 2005, LECT NOTES ARTIF INT, V2605, P228
  • [4] BOAS PV, 1997, COMPLEXITY LOGIC REC
  • [5] CUENCAGRAU B, 2006, P DL06
  • [6] Cuence Grau B., 2006, P KR 2006, P198
  • [7] Ghilardi Silvio, 2006, P 10 INT C PRINC KNO, P187
  • [8] Guarino N, 2004, HDB ONTOLOGIES
  • [9] Horrocks I., 1999, Logic for Programming and Automated Reasoning. 6th International Conference, LPAR'99. Proceedings (Lecture Notes in Artificial Intelligence Vol.1705), P161, DOI 10.1007/3-540-48242-3_11
  • [10] LUTZ C, 2006, CONSERVATIVE EXTENSI