Prototypical Reasoning with Low Complexity Description Logics: Preliminary Results

被引:10
|
作者
Giordano, Laura
Gliozzi, Valentina
Olivetti, Nicola
Pozzato, Gian Luca
机构
关键词
DEFAULTS;
D O I
10.1007/978-3-642-04238-6_38
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present an extension epsilon L+perpendicular to T of the description logic epsilon L+perpendicular to for reasoning about prototypical properties and inheritance with exceptions. epsilon L+perpendicular to T is obtained by adding to epsilon L+perpendicular to a typicality operator T, which is intended to select the "typical" instances of a concept. In epsilon L+perpendicular to T knowledge bases may contain inclusions of the form "T(C) is subsumed by P", expressing that typical C-members have the property P. We show that the problem of entailment in epsilon L+perpendicular to T is in CO-NP.
引用
收藏
页码:430 / 436
页数:7
相关论文
共 50 条
  • [1] Complexity Results of Description Logics
    Gong, Wei
    Zhang, Dongdong
    Zhao, Jie
    HIGH PERFORMANCE NETWORKING, COMPUTING, AND COMMUNICATION SYSTEMS, 2011, 163 : 66 - 72
  • [2] The complexity of finite model reasoning in description logics
    Lutz, C
    Sattler, U
    Tendera, L
    INFORMATION AND COMPUTATION, 2005, 199 (1-2) : 132 - 171
  • [3] The complexity of finite model reasoning in description logics
    Lutz, C
    Sattler, U
    Tendera, L
    AUTOMATED DEDUCTION - CADE-19, PROCEEDINGS, 2003, 2741 : 60 - 74
  • [4] Data Complexity of Reasoning in Very Expressive Description Logics
    Hustadt, Ullrich
    Motik, Boris
    Sattler, Ulrike
    19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 466 - 471
  • [5] Reasoning about Typicality with Low Complexity Description Logics: The Logic εL+⊥T
    Giordano, Laura
    Gliozzi, Valentina
    Olivetti, Nicola
    Pozzato, Gian Luca
    AI (ASTERISK) IA 2009: EMERGENT PERSPECTIVES IN ARTIFICIAL INTELLIGENCE, 2009, 5883 : 62 - 71
  • [6] Some complexity results on fuzzy description logics
    Bonatti, PA
    Tettamanzi, AGB
    FUZZY LOGIC AND APPLICATIONS, 2006, 2955 : 19 - 24
  • [7] The complexity of reasoning with cardinality restrictions and nominals in expressive description logics
    Tobies, S
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2000, 12 : 199 - 217
  • [8] Closed Predicates in Description Logics: Results on Combined Complexity
    Nhung Ngo
    Ortiz, Magdalena
    Simkus, Mantas
    FIFTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2016, : 237 - 246
  • [9] Modal logics, description logics and arithmetic reasoning
    Ohlbach, HJ
    Koehler, J
    ARTIFICIAL INTELLIGENCE, 1999, 109 (1-2) : 1 - 31
  • [10] Analogical Reasoning in Description Logics
    d'Amato, Claudia
    Fanizzi, Nicola
    Esposito, Floriana
    UNCERTAINTY REASONING FOR THE SEMANTIC WEB I, 2008, 5327 : 330 - 347