$} |Year=2011 |Month= |Booktitle=Proceedings of the 8th European Semantic Web Conference ({ESWC'11}) |Editor=Marko {Grobelnik} and Elena {Simperl} |Note= |Organization= |Pages= |Publisher=Springer |Series=Lecture Notes in Computer Science |Volume= |To appear=0 }}

A Practical Approach for Computing Generalization Inferences in {${\mathcal{EL

R. PeñalozaR. Peñaloza, A.-Y. TurhanA.-Y. Turhan

$A Practical Approach for Computing Generalization Inferences in {${\mathcal{EL$

Download

R. Peñaloza, A.-Y. Turhan
A Practical Approach for Computing Generalization Inferences in {${\mathcal{EL

Details
Bibtex

KurzfassungAbstract
We present methods that compute generalizations of concepts or

 individuals described in ontologies written in the Description Logic
 EL. These generalizations are the basis of methods for ontology
 design and are the core of concept similarity measures.  The
 reasoning service least common subsumer (lcs) generalizes a set of
 concepts. Similarly, the most specific concept (msc) generalizes an
 individual into a concept description.  For EL the lcs and the msc
 do not need to exist, if computed w.r.t. general EL-TBoxes.
 However, it is possible to find a concept description that is the
 lcs (msc) up to a certain role-depth.

 In this paper we present a practical approach for computing the
 role-depth bounded lcs and msc, based on the polynomial-time

completion algorithm for EL and describe its implementation.

Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@inproceedings{ PeTu-ESWC11,
  author = {R. {Pe{\~n}aloza} and A.-Y. {Turhan}},
  booktitle = {Proceedings of the 8th European Semantic Web Conference ({ESWC'11})},
  editor = {Marko {Grobelnik} and Elena {Simperl}},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science},
  title = {A Practical Approach for Computing Generalization Inferences in {${\mathcal{EL}}$}},
  year = {2011},
}