An Approach for Optimizing ALE-Approximation of ALC-Concepts
Theoretical Computer Science, TU Dresden, Sebastian Brandt, Anni-Yasmin Turhan, Theoretical Computer Science, TU Dresden · 2002
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.