Abstract
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 language | English |
---|---|
Title of host publication | Proceedings of the 2012 International Workshop on Description Logics (DL2012) |
Editors | Yevgeny Kazakov, Domenico Lembo, Frank Wolter |
Publisher | CEUR-WS.org |
Number of pages | 11 |
Publication status | Published - 17 May 2012 |
Event | The 25th International Workshop on Description Logics - Rome, Italy Duration: 7 Jun 2012 → 10 Jun 2012 Conference number: 25 http://dl.kr.org/dl2012/index.html |
Publication series
Name | CEUR Workshop Proceedings |
---|---|
Publisher | CEUR WS |
Volume | 846 |
ISSN (Electronic) | 1613-0073 |
Conference
Conference | The 25th International Workshop on Description Logics |
---|---|
Abbreviated title | DL 2012 |
Country/Territory | Italy |
City | Rome |
Period | 7/06/12 → 10/06/12 |
Internet address |