Implementing Matching in {${\mathcal ALN}$}

Sebastian BrandtSebastian Brandt, Hongkai LiuHongkai Liu

$Implementing Matching in {${\mathcal ALN}$}$

Download

Sebastian Brandt, Hongkai Liu
Implementing Matching in {${\mathcal ALN}$}
Proceedings of the KI-2004 Workshop on Applications of Description Logics {(KI-ADL'04)}, CEUR-WS, September 2004

Details
Bibtex

KurzfassungAbstract
Although matching in Description Logics (DLs) is theoretically

 well-investigated, an implementation of a matching algorithm exists only for
 the DL ALE. The present paper presents an implementation of an existing
 polynomial time matching algorithm for the DL ALN. Benchmarks using
 randomly generated matching problems indicate a relatively good performance
 even on large matching problems. Nevertheless, striking differences are
 revealed by direct comparison between the ALN- and the ALE-algorithm w.r.t.

FL(-)-matching problems.

Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@inproceedings{ BrandtLiu-KIADL-04,
  address = {Ulm, Germany},
  author = {Sebastian {Brandt} and Hongkai {Liu}},
  booktitle = {Proceedings of the KI-2004 Workshop on Applications of Description Logics {(KI-ADL'04)}},
  month = {September},
  series = {CEUR-WS},
  title = {Implementing Matching in {${\mathcal ALN}$}},
  year = {2004},
}