@conference {161, title = {A MapReduce Algorithm for EL+}, booktitle = {Proceedings of the 23rd International Workshop on Description Logics (DL 2010)}, volume = {573}, year = {2010}, pages = {464-474}, publisher = {CEUR-WS.org}, organization = {CEUR-WS.org}, address = {Waterloo, Ontario, Canada}, 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.

}, url = {http://ceur-ws.org/Vol-573/paper_35.pdf}, author = {Raghava Mutharaju and Frederick Maier and Pascal Hitzler}, editor = {Volker Haarslev and David Toman and Grant E. Weddell} }