<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Raghava Mutharaju</style></author><author><style face="normal" font="default" size="100%">Frederick Maier</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Volker Haarslev</style></author><author><style face="normal" font="default" size="100%">David Toman</style></author><author><style face="normal" font="default" size="100%">Grant E. Weddell</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A MapReduce Algorithm for EL+</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 23rd International Workshop on Description Logics (DL 2010)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ceur-ws.org/Vol-573/paper_35.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">CEUR-WS.org</style></publisher><pub-location><style face="normal" font="default" size="100%">Waterloo, Ontario, Canada</style></pub-location><volume><style face="normal" font="default" size="100%">573</style></volume><pages><style face="normal" font="default" size="100%">464-474</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;
</style></abstract></record></records></xml>