An Approach for Optimizing ALE-Approximation of ALC-Concepts

S. BrandtS. Brandt, Anni-Yasmin TurhanAnni-Yasmin Turhan

Datei:BrandtTurhan-LTCS-02-03.ps.gz

Download

S. Brandt, Anni-Yasmin Turhan
An Approach for Optimizing ALE-Approximation of ALC-Concepts
Technical Report, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, volume 02-03, 2002. LTCS-Report

Details
Bibtex

KurzfassungAbstract
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, 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.
Bemerkung: Note: See http://lat.inf.tu-dresden.de/research/reports.html.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@techreport{ BrTu-LTCS-02,
  address = {Germany},
  author = {S. {Brandt} and A.-Y. {Turhan}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {02-03},
  title = {An Approach for Optimizing {ALE}-Approximation of {ALC}-Concepts},
  type = {LTCS-Report},
  year = {2002},
}