- AutorIn
- Sebastian Brandt Theoretical Computer Science, TU Dresden
- Anni-Yasmin TurhanTheoretical Computer Science, TU Dresden
- Titel
- An Approach for Optimizing ALE-Approximation of ALC-Concepts
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-790214
- Schriftenreihe
- LTCS-Report
- Bandnummer
- 02-03
- Erstveröffentlichung
- 2002
- DOI
- https://doi.org/10.25368/2022.121
- Abstract (EN)
- An approximation of an ALC-concept by an ALE-concept can be computed in double exponential time [4]. Consequently, one needs powerful optimization techniques for approximating an entire unfoldable TBox. Addressing this issue we identify a special form of ALC-concepts, which can be divided into parts s.t. each part can be approximated independently. This independent approximation in turn facilitates caching during the computation of approximation.
- Freie Schlagwörter (DE)
- ALE-Konzept, ALC-Konzept, TBox, Approximation
- Freie Schlagwörter (EN)
- ALE-concept, ALC-concept, TBox, approximation
- 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-790214
- Veröffentlichungsdatum Qucosa
- 30.05.2022
- Dokumenttyp
- Bericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
CC BY 4.0