Practical Reasoning with Nominals in the EL Family of Description Logics

From International Center for Computational Logic

Toggle side column

Practical Reasoning with Nominals in the EL Family of Description Logics

Yevgeny KazakovYevgeny Kazakov,  Markus KrötzschMarkus Krötzsch,  František SimančíkFrantišek Simančík
Yevgeny Kazakov, Markus Krötzsch, František Simančík
Practical Reasoning with Nominals in the EL Family of Description Logics
Proc. 13th International Conference on Principles of Knowledge Representation and Reasoning (KR'12), 264–274, June 2012. AAAI Press
  • KurzfassungAbstract
    The EL family of description logics (DLs) has been designed to provide a restricted syntax for commonly used DL constructors with the goal to guarantee polynomial complexity of reasoning. Yet, polynomial complexity does not always mean that the underlying reasoning procedure is efficient in practice. In this paper we consider a simple DL ELO from the EL family that admits nominals, and argue that existing polynomial reasoning procedures for ELO can be impractical for many realistic ontologies. To solve the problem, we describe an optimization strategy in which the inference rules required for reasoning with nominals are avoided as much as possible. The optimized procedure is evaluated within the reasoner ELK and demonstrated to perform well in practice.
  • Weitere Informationen unter:Other info: Link
  • Forschungsgruppe:Research Group: Wissensbasierte Systeme
@inproceedings{KKS2012,
  author    = {Yevgeny Kazakov and Markus Kr{\"{o}}tzsch and Franti{\v{s}}ek
               Siman{\v{c}}{\'{\i}}k},
  title     = {Practical Reasoning with Nominals in the {EL} Family of
               Description Logics},
  booktitle = {Proc. 13th International Conference on Principles of Knowledge
               Representation and Reasoning (KR'12)},
  publisher = {AAAI Press},
  year      = {2012},
  month     = {June},
  pages     = {264{\textendash}274}
}