LATPub238: 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 2: | Zeile 2: | ||
|ErsterAutorVorname=S. | |ErsterAutorVorname=S. | ||
|ErsterAutorNachname=Brandt | |ErsterAutorNachname=Brandt | ||
|FurtherAuthors=R. Küsters; | |FurtherAuthors=R. Küsters; Anni-Yasmin Turhan | ||
}} | }} | ||
{{Inproceedings | {{Inproceedings | ||
| Zeile 10: | Zeile 10: | ||
|Month= | |Month= | ||
|Booktitle=Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR2002) | |Booktitle=Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR2002) | ||
|Editor=D. | |Editor=D. Fensel and F. Giunchiglia and D. McGuiness and M.-A. Williams | ||
|Note= | |Note= | ||
|Organization= | |Organization= | ||
|Pages=203 | |Pages=203-214 | ||
|Publisher=Morgan Kaufman | |Publisher=Morgan Kaufman | ||
|Series= | |Series= | ||
| Zeile 20: | Zeile 20: | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract= | |Abstract= Approximation is a new inference service in Description Logics first mentioned by Baader, Küsters, and Molitor. Approximating a concept, defined in one Description Logic, means to translate this concept to another concept, defined in a second typically less expressive Description Logic, such that both concepts are as closely related as possible with respect to subsumption. The present paper provides the first in-depth investigation of this inference task. We prove that approximations from the Description Logic ALC to ALE always exist and propose an algorithm computing them. As a measure for the accuracy of the approximation, we introduce a syntax-oriented difference operator, which yields a concept that contains all aspects of the approximated concept that are not present in the approximation. It is also argued that a purely semantical difference operator, as introduced by Teege, is less suited for this purpose. Finally, for the logics under consideration, we propose an algorithm computing the difference. | ||
|ISBN= | |ISBN= | ||
|ISSN= | |ISSN= | ||
| Zeile 53: | Zeile 39: | ||
year = {2002}, | year = {2002}, | ||
} | } | ||
}} | }} | ||
Aktuelle Version vom 25. März 2015, 16:34 Uhr
Approximation and Difference in Description Logics
S. BrandtS. Brandt, R. KüstersR. Küsters, Anni-Yasmin TurhanAnni-Yasmin Turhan
S. Brandt, R. Küsters, Anni-Yasmin Turhan
Approximation and Difference in Description Logics
In D. Fensel and F. Giunchiglia and D. McGuiness and M.-A. Williams, eds., Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR2002), 203-214, 2002. Morgan Kaufman
Approximation and Difference in Description Logics
In D. Fensel and F. Giunchiglia and D. McGuiness and M.-A. Williams, eds., Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR2002), 203-214, 2002. Morgan Kaufman
- KurzfassungAbstract
Approximation is a new inference service in Description Logics first mentioned by Baader, Küsters, and Molitor. Approximating a concept, defined in one Description Logic, means to translate this concept to another concept, defined in a second typically less expressive Description Logic, such that both concepts are as closely related as possible with respect to subsumption. The present paper provides the first in-depth investigation of this inference task. We prove that approximations from the Description Logic ALC to ALE always exist and propose an algorithm computing them. As a measure for the accuracy of the approximation, we introduce a syntax-oriented difference operator, which yields a concept that contains all aspects of the approximated concept that are not present in the approximation. It is also argued that a purely semantical difference operator, as introduced by Teege, is less suited for this purpose. Finally, for the logics under consideration, we propose an algorithm computing the difference. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ BrKuTu-KR-02,
address = {San Francisco, CA},
author = {S. {Brandt} and R. {K{\"u}sters} and A.-Y. {Turhan}},
booktitle = {Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR2002)},
editor = {D. {Fensel} and F. {Giunchiglia} and D. {McGuiness} and M.-A. {Williams}},
pages = {203--214},
publisher = {Morgan Kaufman},
title = {Approximation and Difference in Description Logics},
year = {2002},
}
