Towards Approximative Most Specific Concepts by Completion for EL with Subjective Probabilities

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column

Towards Approximative Most Specific Concepts by Completion for EL with Subjective Probabilities

Rafael PeñalozaRafael Peñaloza,  Anni-Yasmin TurhanAnni-Yasmin Turhan
Rafael Peñaloza, Anni-Yasmin Turhan
Towards Approximative Most Specific Concepts by Completion for EL with Subjective Probabilities
In Thomas Lukasiewicz and Rafael Peñaloza and Anni-Yasmin Turhan, eds., Proceedings of the First International Workshop on Uncertainty in Description Logics (UniDL'10), volume 613 of CEUR-WS, 2010
  • KurzfassungAbstract
    The most specific concept (msc) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this paper we present an algorithm for computing role-depth bounded EL-msc based on the completion algorithm for el. We extend this computation algorithm to a recently introduced probabilistic variant of EL: Prob-EL^01.
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ PenTur-unidl10,
  author = {Rafael {Pe{\~n}aloza} and Anni-Yasmin {Turhan}},
  booktitle = {Proceedings of the First International Workshop on Uncertainty in Description Logics (UniDL'10)},
  editor = {Thomas {Lukasiewicz} and Rafael {Pe{\~n}aloza} and Anni-Yasmin {Turhan}},
  series = {CEUR-WS},
  title = {Towards Approximative Most Specific Concepts by Completion for EL with Subjective Probabilities},
  volume = {613},
  year = {2010},
}