Beth definability in expressive description logics

被引：0
|
作者：
机构：
[1] Cate, Balder Ten
[2] Franconi, Enrico
[3] Seylan, Inanç
来源：
| 1600年 / AI Access Foundation卷 / 48期
关键词：
The Beth definability property; a well-known property from classical logic; is investigated in the context of description logics: if a general L-TBox implicitly defines an L-concept in terms of a given signature; where L is a description logic; then does there always exist over this signature an explicit definition in L for the concept? This property has been studied before and used to optimize reasoning in description logics. In this paper a complete classification of Beth definability is provided for extensions of the basic description logic ALC with transitive roles; inverse roles; role hierarchies; and/or functionality restrictions; both on arbitrary and on finite structures. Moreover; we present a tableau- based algorithm which computes explicit definitions of at most double exponential size. This algorithm is optimal because it is also shown that the smallest explicit definition of an implicitly defined concept may be double exponentially long in the size of the input TBox. Finally; if explicit definitions are allowed to be expressed in first-order logic; then we show how to compute them in single exponential time. © 2013 AI Access Foundation;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Journal article (JA)
引用
收藏
相关论文
共 50 条
  • [31] Foundations of instance level updates in expressive description logics
    Liu, Hongkai
    Lutz, Carsten
    Milicic, Maja
    Wolter, Frank
    ARTIFICIAL INTELLIGENCE, 2011, 175 (18) : 2170 - 2197
  • [32] On expressive description logics with composition of roles in number restrictions
    Grandi, F
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, 2002, 2514 : 202 - 215
  • [33] Expressive reasoning with horn rules and fuzzy description logics
    Theofilos Mailis
    Giorgos Stoilos
    Giorgos Stamou
    Knowledge and Information Systems, 2010, 25 : 105 - 136
  • [34] 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
  • [35] LETHE: Forgetting and Uniform Interpolation for Expressive Description Logics
    Koopmann, Patrick
    KUNSTLICHE INTELLIGENZ, 2020, 34 (03): : 381 - 387
  • [36] A Comparision and Characterizing Theorems for the Expressive Power in the Description Logics ℰℒ¬ and ℰℒ𝒰¬
    Shen Y.-M.
    Hao T.-Y.
    Zhang Q.-S.
    Jisuanji Xuebao/Chinese Journal of Computers, 2018, 41 (04): : 898 - 914
  • [37] Computing least common subsumers in expressive description logics
    Mantay, T
    ADVANCED TOPICS IN ARTIFICIAL INTELLIGENCE, 1999, 1747 : 218 - 230
  • [38] Regular Path Queries in Expressive Description Logics with Nominals
    Calvanese, Diego
    Eiter, Thomas
    Ortiz, Magdalena
    21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, 2009, : 714 - 720
  • [39] LETHE: Forgetting and Uniform Interpolation for Expressive Description Logics
    Patrick Koopmann
    KI - Künstliche Intelligenz, 2020, 34 : 381 - 387
  • [40] The complexity of conjunctive query answering in expressive description logics
    Lutz, Carsten
    AUTOMATED REASONING, PROCEEDINGS, 2008, 5195 : 179 - 193
12345