Computing the Stratified Semantics of Logic Programs over Big Data through Mass Parallelization

  • Ilias Tachmazidis
  • Grigoris Antoniou
Conference paper

DOI: 10.1007/978-3-642-39617-5_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8035)
Cite this paper as:
Tachmazidis I., Antoniou G. (2013) Computing the Stratified Semantics of Logic Programs over Big Data through Mass Parallelization. In: Morgenstern L., Stefaneas P., Lévy F., Wyner A., Paschke A. (eds) Theory, Practice, and Applications of Rules on the Web. RuleML 2013. Lecture Notes in Computer Science, vol 8035. Springer, Berlin, Heidelberg

Abstract

Increasingly huge amounts of data are published on the Web, and generated from sensors and social media. This Big Data challenge poses new scientific and technological challenges and creates new opportunities - thus the increasing attention in academia and industry. Traditionally, logic programming has focused on complex knowledge structures/programs, so the question arises whether and how it can work in the face of Big Data. In this paper, we examine how stratified semantics of logic programming, equivalent to the well-founded semantics for stratified programs, can process huge amounts of data through mass parallelization. In particular, we propose and evaluate a parallel approach using the MapReduce framework. Our experimental results indicate that our approach is scalable and that stratified semantics of logic programming can be applied to billions of facts.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Ilias Tachmazidis
    • 1
  • Grigoris Antoniou
    • 1
  1. 1.University of HuddersfieldUK

Personalised recommendations