Very large scale OWL reasoning through distributed computation

13Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Due to recent developments in reasoning algorithms of the various OWL profiles, the classification time for an ontology has come down drastically. For all of the popular reasoners, in order to process an ontology, an implicit assumption is that the ontology should fit in primary memory. The memory requirements for a reasoner are already quite high, and considering the ever increasing size of the data to be processed and the goal of making reasoning Web scale, this assumption becomes overly restrictive. In our work, we study several distributed classification approaches for the description logic EL+ (a fragment of OWL 2 EL profile). We present the lessons learned from each approach, our current results, and plans for future work. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Mutharaju, R. (2012). Very large scale OWL reasoning through distributed computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7650 LNCS, pp. 407–414). Springer Verlag. https://doi.org/10.1007/978-3-642-35173-0_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free