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 条
  • [21] Reasoning and Explanation in EL and in Expressive Description Logics
    Turhan, Anni-Yasmin
    REASONING WEB: SEMANTIC TECHNOLOGIES FOR SOFTWARE ENGINEERING, 2010, 6325 : 1 - 27
  • [22] Deductive Module Extraction for Expressive Description Logics
    Koopmann, Patrick
    Chen, Jieying
    PROCEEDINGS OF THE TWENTY-NINTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, : 1636 - 1643
  • [23] Optimizing terminological reasoning for expressive description logics
    Tsarkov, Dmitry
    Horrocks, Ian
    Patel-Schneider, Peter F.
    JOURNAL OF AUTOMATED REASONING, 2007, 39 (03) : 277 - 316
  • [24] Combined Covers and Beth Definability
    Calvanese, Diego
    Ghilardi, Silvio
    Gianola, Alessandro
    Montali, Marco
    Rivkin, Andrey
    AUTOMATED REASONING, PT I, 2020, 12166 : 181 - 200
  • [25] Abstract Beth definability in institutions
    Petria, Marius
    Diaconescu, Razvan
    JOURNAL OF SYMBOLIC LOGIC, 2006, 71 (03) : 1002 - 1028
  • [26] BETH DEFINABILITY IN INFINITARY LANGUAGES
    GREGORY, J
    JOURNAL OF SYMBOLIC LOGIC, 1974, 39 (01) : 22 - 26
  • [27] A Rational Entailment for Expressive Description Logics via Description Logic Programs
    Casini, Giovanni
    Straccia, Umberto
    ARTIFICIAL INTELLIGENCE RESEARCH, SACAIR 2021, 2022, 1551 : 177 - 191
  • [28] Expressive reasoning with horn rules and fuzzy description logics
    Mailis, Theofilos
    Stoilos, Giorgos
    Stamou, Giorgos
    KNOWLEDGE AND INFORMATION SYSTEMS, 2010, 25 (01) : 105 - 136
  • [29] Revisiting the Hardness of Query Answering in Expressive Description Logics
    Ortiz, Magdalena
    Simkus, Mantas
    WEB REASONING AND RULE SYSTEMS, RR 2014, 2014, 8741 : 216 - 223
  • [30] Reasoning within expressive fuzzy rough description logics
    Jiang, Yuncheng
    Wang, Ju
    Deng, Peimin
    Tang, Suqin
    FUZZY SETS AND SYSTEMS, 2009, 160 (23) : 3403 - 3424
12345