Building and Structuring Description Logic Knowledge Bases Using Least Common Subsumers and Concept Analysis

Franz BaaderFranz Baader, R. MolitorR. Molitor

Datei:BaaderMolitor-ICCS2000.ps.gz

Download

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

Details
Bibtex

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

The final publication is available at Springer.

@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},
}