Implementing Matching in ALE—First Results

Sebastian BrandtSebastian Brandt

Download

Sebastian Brandt
Implementing Matching in ALE—First Results
Proceedings of the 2003 International Workshop on Description Logics (DL2003), CEUR-WS, 2003

Details
Bibtex

KurzfassungAbstract
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a general matching algorithm exists. The present paper presents an implementation of an existing matching algorithm for the DL ALE and shows first results on benchmarks w.r.t. randomly generated matching problems. The observed computation times show that the implementation performs well even on relatively large matching problems.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@inproceedings{ Brandt-DL2003,
  author = {Sebastian {Brandt}},
  booktitle = {Proceedings of the 2003 International Workshop on Description Logics ({DL2003})},
  series = {CEUR-WS},
  title = {Implementing Matching in $\mathcal{ALE}$---First Results},
  year = {2003},
}