%0 Conference Paper %B Proceedings of the 23rd International Workshop on Description Logics (DL 2010) %D 2010 %T A MapReduce Algorithm for EL+ %A Raghava Mutharaju %A Frederick Maier %A Pascal Hitzler %E Volker Haarslev %E David Toman %E Grant E. Weddell %X

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.

%B Proceedings of the 23rd International Workshop on Description Logics (DL 2010) %I CEUR-WS.org %C Waterloo, Ontario, Canada %V 573 %P 464-474 %G eng %U http://ceur-ws.org/Vol-573/paper_35.pdf