Optimising parallel ABox reasoning of el ontologies

Yuan Ren*, Jeff Z. Pan, Kevin Lee

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

1 Citation (Scopus)


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
Pages (from-to)508-518
Number of pages11
JournalCEUR Workshop Proceedings
Publication statusPublished - 1 Dec 2012
Event25th International Workshop on Description Logics, DL 2012 - Rome, Italy
Duration: 7 Jun 201210 Jun 2012

Bibliographical note

Yuan Ren and Jeff Z. Pan are partially funded by the EU FP7 K-Drive project.


Dive into the research topics of 'Optimising parallel ABox reasoning of el ontologies'. Together they form a unique fingerprint.

Cite this