Skip to main content

MapResolve

  • Conference paper
Book cover Web Reasoning and Rule Systems (RR 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6902))

Included in the following conference series:

Abstract

We propose an approach to scalable reasoning on description logic ontologies that is based on MapReduce. Our work is inspired by previous work that provided fast materialization of RDFS ontologies and proposed MapReduce for more expressive logics. We explain challenges imposed by higher expressivity that were not addressed before and describe how they can be solved.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baader, F., Lutz, C., Suntisrivaraporn, B.: Efficient reasoning in \(\mathcal{EL}^+\). In: Proceedings of the 2006 International Workshop on Description Logics (DL 2006). CEUR-WS (2006)

    Google Scholar 

  2. Dean, J., Ghemawat, S.: MapReduce: Simplified data processing on large clusters. Communications of the ACM 51(1), 107–113 (2008)

    Article  Google Scholar 

  3. Mutharaju, R., Maier, F., Hitzler, P.: A MapReduce Algorithm for EL +. In: Workshop on Description Logics (DL 2010), pp. 464–474 (2010)

    Google Scholar 

  4. Schlicht, A., Stuckenschmidt, H.: Distributed resolution for expressive ontology networks. In: Polleres, A., Swift, T. (eds.) RR 2009. LNCS, vol. 5837, pp. 87–101. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Schlicht, A., Stuckenschmidt, H.: Peer-to-peer reasoning for interlinked ontologies. International Journal of Semantic Computing, Special Issue on Web Scale Reasoning 4(1) (March 2010)

    Google Scholar 

  6. ter Horst, H.J.: Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary. Web Semantics: Science, Services and Agents on the World Wide Web 3(2-3), 79–115 (2005)

    Article  Google Scholar 

  7. Urbani, J., Kotoulas, S., Maassen, J.: OWL reasoning with WebPIE: calculating the closure of 100 billion triples. In: The Semantic Web, vol. 213–227 (2010)

    Google Scholar 

  8. Urbani, J., Kotoulas, S., Oren, E., van Harmelen, F.: Scalable distributed reasoning using mapreduce. In: Bernstein, A., Karger, D.R., Heath, T., Feigenbaum, L., Maynard, D., Motta, E., Thirunarayan, K. (eds.) ISWC 2009. LNCS, vol. 5823, pp. 634–649. Springer, Heidelberg (2009), http://www.springerlink.com/index/M44432748XT110PJ.pdf

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schlicht, A., Stuckenschmidt, H. (2011). MapResolve. In: Rudolph, S., Gutierrez, C. (eds) Web Reasoning and Rule Systems. RR 2011. Lecture Notes in Computer Science, vol 6902. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23580-1_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23580-1_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23579-5

  • Online ISBN: 978-3-642-23580-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics