A MapReduce Algorithm for EL+

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.

• Type: Journal
• Year: 2010
• Where: DLOG
• Authors: Raghava Mutharaju, Frederick Maier, Pascal Hitzler
• Keywords: Automated Reasoning, DLOG 2010, MapReduce Algorithm, RDF Schema, RDF Schema Reasoning