Practical Reasoning with Nominals in the EL Family of Description Logics
From korrekt.org
Yevgeny Kazakov, Markus Krötzsch, František Simančík
Practical Reasoning with Nominals in the EL Family of Description Logics
Abstract. 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.
Published at KR2012 (Conference paper)
Download PDF (last update: Feb 4 2012)
Citation details
- Yevgeny Kazakov, Markus Krötzsch, František Simančík. Practical Reasoning with Nominals in the EL Family of Description Logics. In Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR 2012). 2012.
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 = {Proceedings of the 13th International Conference
on Principles of Knowledge Representation and
Reasoning (KR'12)},
year = {2012}
note = {to appear, available from
\url{http://code.google.com/p/elk-reasoner/wiki/Publications}}
}
Remarks
The above link points to the extended technical report that includes all proofs.
More information about the software used in this paper and pointers to further publications can be found on the page about ELK Reasoner.
