An Approach for Optimized Approximation
From International Center for Computational Logic
An Approach for Optimized Approximation
S. BrandtS. Brandt, Anni-Yasmin TurhanAnni-Yasmin Turhan
S. Brandt, Anni-Yasmin Turhan
An Approach for Optimized Approximation
Proceedings of the KI-2002 Workshop on Applications of Description Logics (KIDLWS'01), CEUR-WS, September 2002. RWTH Aachen
An Approach for Optimized Approximation
Proceedings of the KI-2002 Workshop on Applications of Description Logics (KIDLWS'01), CEUR-WS, September 2002. RWTH Aachen
- KurzfassungAbstract
Approximation is a new inference service investigated in [BKT-KR-02]. An approximation of an ALC-concept by an ALE-concept can be computed in double exponential time. Consequently, one needs powerful optimization techniques for approximating an entire unfoldable TBox. Addressing this issue we identify a special form of ALC-concepts that can be divided into parts s.t. each part can be approximated independently. - Bemerkung: Note: Proceedings online available from http://SunSITE.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/
- Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ BrTu-KIDLWS-02,
address = {Aachen, Germany},
author = {S. {Brandt} and A.-Y.\ {Turhan}},
booktitle = {Proceedings of the KI-2002 Workshop on Applications of Description Logics {(KIDLWS'01)}},
month = {September},
note = {Proceedings online available from {http://SunSITE.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/}},
publisher = {RWTH Aachen},
series = {CEUR-WS},
title = {An Approach for Optimized Approximation},
year = {2002},
}
