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 条
  • [41] Usability of expressive description logics - A case study in UMLS
    Cornet, R
    Abu-Hanna, A
    AMIA 2002 SYMPOSIUM, PROCEEDINGS: BIOMEDICAL INFORMATICS: ONE DISCIPLINE, 2002, : 180 - 184
  • [42] Signature-Based Abduction for Expressive Description Logics
    Koopmann, Patrick
    Del-Pinto, Warren
    Tourret, Sophie
    Schmidt, Renate A.
    KR2020: PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2020, : 592 - 602
  • [43] Expressive reasoning with horn rules and fuzzy description logics
    Mailis, Theofilos
    Stoilos, Giorgos
    Stamou, Giorgos
    WEB REASONING AND RULE SYSTEMS, PROCEEDINGS, 2007, 4524 : 43 - +
  • [44] Beth definability, interpolation and language splitting
    Parikh, Rohit
    SYNTHESE, 2011, 179 (02) : 211 - 221
  • [45] Beth definability, interpolation and language splitting
    Rohit Parikh
    Synthese, 2011, 179 : 211 - 221
  • [46] Abox satisfiability reduced to terminological reasoning in expressive description logics
    Tessaris, S
    Horrocks, I
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, 2002, 2514 : 435 - 449
  • [47] On Partitioning-Based Optimisations in Expressive Fuzzy Description Logics
    Bobillo, Fernando
    Straccia, Umberto
    2015 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS (FUZZ-IEEE 2015), 2015,
  • [48] Absorption-Based Query Answering for Expressive Description Logics
    Steigmiller, Andreas
    Glimm, Birte
    SEMANTIC WEB - ISWC 2019, PT I, 2019, 11778 : 593 - 611
  • [49] Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics
    Bourhis, Pierre
    Lutz, Carsten
    FIFTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2016, : 207 - 216
  • [50] Towards a Rational Closure for Expressive Description Logics: the Case of SHIQ
    Giordano, Laura
    Gliozzi, Valentina
    Olivetti, Nicola
    FUNDAMENTA INFORMATICAE, 2018, 159 (1-2) : 95 - 122
12345