SROIQ Syntax Approximation by Using Nominal Schemas

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

Toggle side column

SROIQ Syntax Approximation by Using Nominal Schemas

Cong WangCong Wang,  David CarralDavid Carral,  Pascal HitzlerPascal Hitzler
Cong Wang, David Carral, Pascal Hitzler
SROIQ Syntax Approximation by Using Nominal Schemas
In Thomas Eiter, Birte Glimm, Yevgeny Kazakov, Markus Krötzsch, eds., Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany., volume 1014 of {CEUR} Workshop Proceedings, 988--999, July 2013. CEUR-WS.org
  • KurzfassungAbstract
    Nominal schemas is a recently introduced extension of description logics which makes it possible to express rules which generalize DL-safe ones. A tractable description logic, ELROVn, has been identified. This leads us to the question: can we improve approximate reasoning results by employing nominal schemas? In this paper, we investigate how to approximately cast SROIQ into ELROVn. Using a datalog-based tractable algorithm, a preliminary evaluation shows that our approach can indeed do approximate SROIQ-reasoning with a high recall.
  • Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems
@inproceedings{WCH2013,
  author    = {Cong Wang and David Carral and Pascal Hitzler},
  title     = {SROIQ Syntax Approximation by Using Nominal Schemas},
  editor    = {Thomas Eiter and Birte Glimm and Yevgeny Kazakov and Markus
               Kr{\"{o}}tzsch},
  booktitle = {Informal Proceedings of the 26th International Workshop on
               Description Logics, Ulm, Germany.},
  series    = {{CEUR} Workshop Proceedings},
  volume    = {1014},
  publisher = {CEUR-WS.org},
  year      = {2013},
  month     = {July},
  pages     = {988--999}
}