LATPub193: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
||
| Zeile 1: | Zeile 1: | ||
{{Publikation Erster Autor | {{Publikation Erster Autor | ||
|ErsterAutorVorname= | |ErsterAutorVorname=Franz | ||
|ErsterAutorNachname=Baader | |ErsterAutorNachname=Baader | ||
|FurtherAuthors=R. Molitor | |FurtherAuthors=R. Molitor | ||
| Zeile 9: | Zeile 9: | ||
|Year=2000 | |Year=2000 | ||
|Month= | |Month= | ||
|Booktitle=Conceptual Structures: Logical, Linguistic, and Computational Issues | |Booktitle=Conceptual Structures: Logical, Linguistic, and Computational Issues – Proceedings of the 8th International Conference on Conceptual Structures (ICCS2000) | ||
|Editor=B. Ganter and G. Mineau | |Editor=B. Ganter and G. Mineau | ||
|Note= | |Note= | ||
| Zeile 20: | Zeile 20: | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=Given a finite set C:={c_1, ... , c_n} of description logic concepts, we are | |Abstract=Given a finite set C:={c_1, ... , c_n} of description logic concepts, we are interested in computing the subsumption hierarchy of all least common subsumers of subsets of C. This hierarchy can be used to support the bottom-up construction and the structuring of description logic knowledge bases. The point is to compute this hierarchy without having to compute the least common subsumer for all subsets of C. In this paper, we show that methods from formal concept analysis developed for computing concept lattices can be employed for this purpose. | ||
interested in computing the subsumption hierarchy of all least common subsumers | |||
of subsets of C. This hierarchy can be used to support the bottom-up | |||
construction and the structuring of description logic knowledge bases. | |||
point is to compute this hierarchy without having to compute the least common | |||
subsumer for all subsets of C. In this paper, we show that methods from formal | |||
concept analysis developed for computing concept lattices can be employed for | |||
this purpose. | |||
|ISBN= | |ISBN= | ||
|ISSN= | |ISSN= | ||
| Zeile 48: | Zeile 40: | ||
year = {2000}, | year = {2000}, | ||
} | } | ||
}} | }} | ||
Version vom 23. März 2015, 13:24 Uhr
Building and Structuring Description Logic Knowledge Bases Using Least Common Subsumers and Concept Analysis
Franz BaaderFranz Baader, R. MolitorR. Molitor
Franz Baader, R. Molitor
Building and Structuring Description Logic Knowledge Bases Using Least Common Subsumers and Concept Analysis
In B. Ganter and G. Mineau, eds., Conceptual Structures: Logical, Linguistic, and Computational Issues – Proceedings of the 8th International Conference on Conceptual Structures (ICCS2000), volume 1867 of Lecture Notes in Artificial Intelligence, 290-303, 2000. Springer
Building and Structuring Description Logic Knowledge Bases Using Least Common Subsumers and Concept Analysis
In B. Ganter and G. Mineau, eds., Conceptual Structures: Logical, Linguistic, and Computational Issues – Proceedings of the 8th International Conference on Conceptual Structures (ICCS2000), volume 1867 of Lecture Notes in Artificial Intelligence, 290-303, 2000. Springer
- KurzfassungAbstract
Given a finite set C:={c_1, ... , c_n} of description logic concepts, we are interested in computing the subsumption hierarchy of all least common subsumers of subsets of C. This hierarchy can be used to support the bottom-up construction and the structuring of description logic knowledge bases. The point is to compute this hierarchy without having to compute the least common subsumer for all subsets of C. In this paper, we show that methods from formal concept analysis developed for computing concept lattices can be employed for this purpose. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ BaaderMolitor-ICCS-2000,
author = {F. {Baader} and R. {Molitor}},
booktitle = {Conceptual Structures: Logical, Linguistic, and Computational Issues -- Proceedings of the 8th International Conference on Conceptual Structures (ICCS2000)},
editor = {B. {Ganter} and G. {Mineau}},
pages = {290--303},
publisher = {Springer Verlag},
series = {Lecture Notes in Artificial Intelligence},
title = {Building and Structuring Description Logic Knowledge Bases Using Least Common Subsumers and Concept Analysis},
volume = {1867},
year = {2000},
}
