Optimising Parallel ABox Reasoning of EL Ontologies*

Yuan Ren, Jeff Z Pan, Kevin Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution


The success of modern multi-core processors makes it possible to develop parallel ABox reasoning algorithms to facilitate efficient reasoning on large scale ontological data sets. In this paper, we extend a parallel TBox reasoning algorithm for ELHR+ to a parallel ABox reasoning algorithm for ELH⊥,R+, which also supports the bottom concept so as to model disjointness and inconsistency. In design of algorithms, we exploit the characteristic of ABox reasoning in ELH⊥,R+ to improve parallelisation and reduce unnecessary resource cost. Particularly, we separate the TBox reasoning, ABox reasoning on types and ABox reasoning on relations. Our evaluation shows that a naive implementation of our approach can compute all ABox entailments of a Not-Galen− ontology with about 1 million individuals and 9 million axioms in about 3 minutes.
Original languageEnglish
Title of host publicationProceedings of the 2012 International Workshop on Description Logics (DL2012)
EditorsYevgeny Kazakov, Domenico Lembo, Frank Wolter
Number of pages11
Publication statusPublished - 17 May 2012
EventThe 25th International Workshop on Description Logics - Rome, Italy
Duration: 7 Jun 201210 Jun 2012
Conference number: 25

Publication series

NameCEUR Workshop Proceedings
PublisherCEUR WS
ISSN (Electronic)1613-0073


ConferenceThe 25th International Workshop on Description Logics
Abbreviated titleDL 2012
Internet address


Dive into the research topics of 'Optimising Parallel ABox Reasoning of EL Ontologies*'. Together they form a unique fingerprint.

Cite this