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 条
  • [1] Beth Definability in Expressive Description Logics
    ten Cate, Balder
    Franconi, Enrico
    Seylan, Inanc
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2013, 48 : 347 - 414
  • [2] Interpolation and Beth Definability in Default Logics
    Cassano, Valentin
    Fervari, Raul
    Areces, Carlos
    Castro, Pablo F.
    LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2019, 2019, 11468 : 675 - 691
  • [3] Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents
    Lyon, Tim S.
    Karge, Jonas
    PROCEEDINGS OF THE THIRTY-THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2024, 2024, : 3484 - 3492
  • [4] Interpolation Properties, Beth Definability Properties and Amalgamation Properties for Substructural Logics
    Kihara, Hitoshi
    Ono, Hiroakira
    JOURNAL OF LOGIC AND COMPUTATION, 2010, 20 (04) : 823 - 875
  • [5] Expressive probabilistic description logics
    Lukasiewicz, Thomas
    ARTIFICIAL INTELLIGENCE, 2008, 172 (6-7) : 852 - 883
  • [6] Datalog and description logics: Expressive power
    Cadoli, M
    Palopoli, L
    Lenzerini, M
    DATABASE PROGRAMMING LANGUAGES, 1998, 1369 : 281 - 298
  • [7] Semantic Forgetting in Expressive Description Logics
    Sakr, Mostafa
    Schmidt, Renate A.
    FRONTIERS OF COMBINING SYSTEMS (FROCOS 2021), 2021, 12941 : 118 - 136
  • [8] Role Conjunctions in Expressive Description Logics
    Glimm, Birte
    Kazakov, Yevgeny
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS, 2008, 5330 : 391 - 405
  • [9] Expressive number restrictions in description logics
    Baader, F
    Sattler, U
    JOURNAL OF LOGIC AND COMPUTATION, 1999, 9 (03) : 319 - 350
  • [10] Conservative Extensions in Expressive Description Logics
    Lutz, Carsten
    Walther, Dirk
    Wolter, Frank
    20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2007, : 453 - 458
12345