A MapReduce Algorithm for EL+

Authors

Raghava Mutharaju
Frederick Maier
Pascal HitzlerFollow

Document Type

Conference Proceeding

Publication Date

5-1-2010

Abstract

Recently, the use of the MapReduce framework for distributed RDF Schema reasoning has shown that it is possible to compute the deductive closure of sets of over a billion RDF triples within a reasonable time span [22], and that it is also possible to carry the approach over to OWL Horst [21]. Following this lead, in this paper we provide a MapReduce algorithm for the description logic EL+, more precisely for the classification of EL+ ontologies. To do this, we first modify the algorithm usually used for EL+ classification. The modified algorithm can then be converted into a MapReduce algorithm along the same key ideas as used for RDF schema.

Comments

Presented at the International Workshop on Description Logics, Waterloo, Canada, May 4-7, 2010.

Repository Citation

Mutharaju, R., Maier, F., & Hitzler, P. (2010). A MapReduce Algorithm for EL+. CEUR Workshop Proceedings, 573, 464-474.
https://corescholar.libraries.wright.edu/cse/125