LATPub362: 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: | ||
{{Article | {{Article | ||
|Referiert=1 | |Referiert=1 | ||
|Title=Computing the Least Common Subsumer w.r.t. | |Title=Computing the Least Common Subsumer w.r.t. a Background Terminology | ||
|Year=2007 | |Year=2007 | ||
|Month= | |Month= | ||
| Zeile 12: | Zeile 12: | ||
|Note= | |Note= | ||
|Number=3 | |Number=3 | ||
|Pages=392 | |Pages=392-420 | ||
|Publisher=Elsevier Science Publishers (North-Holland), Amsterdam | |Publisher=Elsevier Science Publishers (North-Holland), Amsterdam | ||
|Volume=5 | |Volume=5 | ||
| Zeile 18: | Zeile 18: | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=Methods for computing the least common subsumer (lcs) are usually | |Abstract=Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive Description Logics (DLs) whereas existing knowledge bases are written in very expressive DLs. In order to allow the user to re-use concepts defined in such terminologies and still support the definition of new concepts by computing the lcs, we extend the notion of the lcs of concept descriptions to the notion of the lcs w.r.t. a background terminology. We will show both theoretical results on the existence of the least common subsumer in this setting, and describe a practical approach—based on a method from formal concept analysis—for computing good common subsumers, which may, however, not be the least ones. We will also describe results obtained in a first evaluation of this practical approach. | ||
restricted to rather inexpressive Description Logics (DLs) whereas | |||
existing knowledge bases are written in very expressive DLs. In order | |||
to allow the user to re-use concepts defined in such terminologies and | |||
still support the definition of new concepts by computing the lcs, we | |||
extend the notion of the lcs of concept descriptions to the notion of | |||
the lcs w.r.t. a background terminology. We will show both theoretical | |||
results on the existence of the least common subsumer in this setting, | |||
and describe a practical approach—based on a method from formal | |||
concept analysis—for computing good common subsumers, which may, | |||
however, not be the least ones. We will also describe results obtained | |||
in a first evaluation of this practical approach. | |||
|ISBN= | |ISBN= | ||
|ISSN= | |ISSN= | ||
| Zeile 49: | Zeile 37: | ||
year = {2007}, | year = {2007}, | ||
} | } | ||
}} | }} | ||
Aktuelle Version vom 25. März 2015, 16:34 Uhr
Computing the Least Common Subsumer w.r.t. a Background Terminology
Franz BaaderFranz Baader, Barış SertkayaBarış Sertkaya, Anni-Yasmin TurhanAnni-Yasmin Turhan
Franz Baader, Barış Sertkaya, Anni-Yasmin Turhan
Computing the Least Common Subsumer w.r.t. a Background Terminology
Journal of Applied Logic, 5(3):392-420, 2007
Computing the Least Common Subsumer w.r.t. a Background Terminology
Journal of Applied Logic, 5(3):392-420, 2007
- KurzfassungAbstract
Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive Description Logics (DLs) whereas existing knowledge bases are written in very expressive DLs. In order to allow the user to re-use concepts defined in such terminologies and still support the definition of new concepts by computing the lcs, we extend the notion of the lcs of concept descriptions to the notion of the lcs w.r.t. a background terminology. We will show both theoretical results on the existence of the least common subsumer in this setting, and describe a practical approach—based on a method from formal concept analysis—for computing good common subsumers, which may, however, not be the least ones. We will also describe results obtained in a first evaluation of this practical approach. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@article{ BaaderSertkayaTurhan-JAL-07,
author = {Franz {Baader} and Bar\i{}\c{s} {Sertkaya} and Anni-Yasmin {Turhan}},
journal = {Journal of Applied Logic},
number = {3},
pages = {392--420},
publisher = {Elsevier Science Publishers (North-Holland), Amsterdam},
title = {Computing the Least Common Subsumer w.r.t.~a Background Terminology},
volume = {5},
year = {2007},
}
