LATPub292: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
||
| (2 dazwischenliegende Versionen desselben Benutzers werden nicht angezeigt) | |||
| Zeile 6: | Zeile 6: | ||
{{Inproceedings | {{Inproceedings | ||
|Referiert=1 | |Referiert=1 | ||
|Title=Implementing Matching in | |Title=Implementing Matching in ALN | ||
|Year=2004 | |Year=2004 | ||
|Month=September | |Month=September | ||
|Booktitle=Proceedings of the KI-2004 Workshop on Applications of Description Logics | |Booktitle=Proceedings of the KI-2004 Workshop on Applications of Description Logics (KI-ADL'04) | ||
|Editor= | |Editor= | ||
|Note= | |Note= | ||
| Zeile 20: | Zeile 20: | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract= | |Abstract= 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. | ||
|ISBN= | |ISBN= | ||
|ISSN= | |ISSN= | ||
| Zeile 46: | Zeile 38: | ||
year = {2004}, | year = {2004}, | ||
} | } | ||
}} | }} | ||
Aktuelle Version vom 25. März 2015, 16:34 Uhr
Implementing Matching in ALN
Sebastian BrandtSebastian Brandt, Hongkai LiuHongkai Liu
Sebastian Brandt, Hongkai Liu
Implementing Matching in ALN
Proceedings of the KI-2004 Workshop on Applications of Description Logics (KI-ADL'04), CEUR-WS, September 2004
Implementing Matching in ALN
Proceedings of the KI-2004 Workshop on Applications of Description Logics (KI-ADL'04), CEUR-WS, September 2004
- 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},
}
