Rough EL Classification

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

Toggle side column
Rafael Peñaloza, Tingting Zou
Rough EL Classification
In Thomas Eiter and Birte Glimm and Yevgeny Kazakov and Markus Krötzsch, eds., Proceedings of the 2013 International Workshop on Description Logics (DL'13), volume 1014 of CEUR-WS, 415-427, 2013
  • KurzfassungAbstract
    Rough Description Logics (DLs) have been studied as a means for representing and reasoning with imprecise knowledge. It has been shown that reasoning in rough DLs can be reduced to reasoning in a classical DL that allows value restrictions, and transitive and inverse roles. This shows that for propositionally closed DLs, the complexity of reasoning is not increased by the inclusion of rough constructors. However, applying such a reduction to rough EL yields an exponential time upper bound. We show that this blow-up in complexity can be avoided, providing a polynomial-time completion-based algorithm for classifying rough EL ontologies.
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ PeZo-DL13,
  address = {Ulm, Germany},
  author = {Rafael {Pe{\~n}aloza} and Tingting {Zou}},
  booktitle = {Proceedings of the 2013 International Workshop on Description Logics ({DL'13})},
  editor = {Thomas {Eiter} and Birte {Glimm} and Yevgeny {Kazakov} and Markus {Kr{\"o}tzsch}},
  pages = {415--427},
  series = {CEUR-WS},
  title = {Rough $\mathcal{EL}$ Classification},
  volume = {1014},
  year = {2013},