Applying Formal Concept Analysis to Description Logics.
F. Baader, und B. Sertkaya.
Concept Lattices, Volume 2961 von Lecture Notes in Computer Science, Seite 261--286. Berlin/Heidelberg, Springer, (2004)

Given a finite set $C := \ C_1, łdots, C_n\$ of description logic concepts, we are interested in computing the subsumption hierarchy of all least common subsumers of subsets of $C$ as well as the hierarchy of all conjunctions of subsets of $C$. These hierarchies can be used to support the bottom-up construction of description logic knowledge bases. The point is to compute the first hierarchy without having to compute the least common subsumer for all subsets of $C$, and the second hierarchy without having to check all possible pairs of such conjunctions explicitly for subsumption. We will show that methods from formal concept analysis developed for computing concept lattices can be employed for this purpose.

URL

http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2961&spage=261

Suchen auf

Diese Publikation wurde noch nicht bewertet.

Bewertungsverteilung

Durchschnittliche Benutzerbewertung0,0 von 5.0 auf Grundlage von 0 Rezensionen

Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.

@inproceedings{baader2004applying,
  abstract = {Given a finite set $\mathcal{C} := \{ C_1, \ldots, C_n\}$ of description logic concepts, we are interested in computing the subsumption hierarchy of all least common subsumers of subsets of $\mathcal{C}$ as well as the hierarchy of all conjunctions of subsets of $\mathcal{C}$. These hierarchies can be used to support the bottom-up construction of description logic knowledge bases. The point is to compute the first hierarchy without having to compute the least common subsumer for all subsets of $\mathcal{C}$, and the second hierarchy without having to check all possible pairs of such conjunctions explicitly for subsumption. We will show that methods from formal concept analysis developed for computing concept lattices can be employed for this purpose.},
  added-at = {2010-06-30T10:40:21.000+0200},
  address = {Berlin/Heidelberg},
  author = {Baader, Franz and Sertkaya, Baris},
  biburl = {https://puma.uni-kassel.de/bibtex/2a61b258d2724c3cb17f5dfdd6db185cb/jaeschke},
  booktitle = {Concept Lattices},
  doi = {10.1007/978-3-540-24651-0_24},
  editor = {Eklund, Peter W.},
  interhash = {bf9599a95577070ddd4097d63d4b6cb8},
  intrahash = {a61b258d2724c3cb17f5dfdd6db185cb},
  isbn = {3-540-21043-1},
  keywords = {analysis concept description dl fca formal logic logics},
  pages = {261--286},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2010-06-30T10:40:21.000+0200},
  title = {Applying Formal Concept Analysis to Description Logics.},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2961&spage=261},
  volume = 2961,
  year = 2004
}

%0 Conference Paper
%1 baader2004applying
%A Baader, Franz
%A Sertkaya, Baris
%B Concept Lattices
%C Berlin/Heidelberg
%D 2004
%E Eklund, Peter W.
%I Springer
%K analysis concept description dl fca formal logic logics
%P 261--286
%R 10.1007/978-3-540-24651-0_24
%T Applying Formal Concept Analysis to Description Logics.
%U http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2961&spage=261
%V 2961
%X Given a finite set $C := \ C_1, łdots, C_n\$ of description logic concepts, we are interested in computing the subsumption hierarchy of all least common subsumers of subsets of $C$ as well as the hierarchy of all conjunctions of subsets of $C$. These hierarchies can be used to support the bottom-up construction of description logic knowledge bases. The point is to compute the first hierarchy without having to compute the least common subsumer for all subsets of $C$, and the second hierarchy without having to check all possible pairs of such conjunctions explicitly for subsumption. We will show that methods from formal concept analysis developed for computing concept lattices can be employed for this purpose.
%@ 3-540-21043-1

PUMA

Applying Formal Concept Analysis to Description Logics.
F. Baader, und B. Sertkaya.
Concept Lattices, Volume 2961 von Lecture Notes in Computer Science, Seite 261--286. Berlin/Heidelberg, Springer, (2004)

Tags

Nutzer

Kommentare und Rezensionen

Zitieren Sie diese Publikation

PUMA

Applying Formal Concept Analysis to Description Logics.F. Baader, und B. Sertkaya. Concept Lattices, Volume 2961 von Lecture Notes in Computer Science, Seite 261--286. Berlin/Heidelberg, Springer, (2004)

Tags

Nutzer

Kommentare und Rezensionen

Zitieren Sie diese Publikation

Applying Formal Concept Analysis to Description Logics.
F. Baader, und B. Sertkaya.
Concept Lattices, Volume 2961 von Lecture Notes in Computer Science, Seite 261--286. Berlin/Heidelberg, Springer, (2004)