- Titel
- Completion-based computation of least common subsumers with limited role-depth for EL and Prob-EL⁰¹
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-795167
- Schriftenreihe
- LTCS-Report
- Bandnummer
- 10-02
- Erstveröffentlichung
- 2010
- DOI
- https://doi.org/10.25368/2022.175
- Abstract (EN)
- The least common subsumer (lcs) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this report we present an algorithm for computing role-depth bounded EL-lcs based on the completion algorithm for EL. We extend this computation algorithm to a recently introduced probabilistic variant of EL: Prob-EL⁰¹.
- Freie Schlagwörter (DE)
- Subsumtion, EL-TBox, Beschreibungslogik, zyklisches Axiom
- Freie Schlagwörter (EN)
- subsumption, EL-TBox, description logic, cyclic axiom
- 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-795167
- Veröffentlichungsdatum Qucosa
- 16.06.2022
- Dokumenttyp
- Bericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
CC BY 4.0