- Titel
- Completion-based computation of most specific concepts with limited role-depth for EL and Prob-EL⁰¹
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-795187
- Schriftenreihe
- LTCS-Report
- Bandnummer
- 10-03
- Erstveröffentlichung
- 2010
- DOI
- https://doi.org/10.25368/2022.176
- Abstract (EN)
- In Description Logics the reasoning service most specific concept (msc) constructs a concept description that generalizes an ABox individual into a concept description. For the Description Logic EL the msc may not exist, if computed with respect to general EL-TBoxes or cyclic ABoxes. However, it is still possible to find a concept description that is the msc up to a fixed role-depth, i.e. with respect to a maximal nesting of quantifiers. In this report we present a practical approach for computing the roledepth bounded msc, based on the polynomial-time completion algorithm for EL. We extend these methods to Prob-EL⁰¹c , which is a probabilistic variant of EL. Together with the companion report [9] this report devises computation methods for the bottom-up construction of knowledge bases for EL and Prob-EL⁰¹c .
- Freie Schlagwörter (DE)
- Subsumtion, EL-TBox, Beschreibungslogik, Wissensdatenbank
- Freie Schlagwörter (EN)
- subsumption, EL-TBox, description logic, knowledge bases
- Klassifikation (DDC)
- 004
- Klassifikation (RVK)
- ST 136
- Publizierende Institution
- Technische Universität Dresden, Dresden
- Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa2-795187
- Veröffentlichungsdatum Qucosa
- 16.06.2022
- Dokumenttyp
- Bericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
CC BY 4.0