Inductive Triple Graphs: A Purely Functional Approach to Represent RDF

  • Jose Emilio Labra Gayo
  • Johan Jeuring
  • Jose María Álvarez Rodríguez
Conference paper

DOI: 10.1007/978-3-319-04534-4_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8323)
Cite this paper as:
Labra Gayo J.E., Jeuring J., Álvarez Rodríguez J.M. (2014) Inductive Triple Graphs: A Purely Functional Approach to Represent RDF. In: Croitoru M., Rudolph S., Woltran S., Gonzales C. (eds) Graph Structures for Knowledge Representation and Reasoning. Lecture Notes in Computer Science, vol 8323. Springer, Cham

Abstract

RDF is one of the cornerstones of the Semantic Web. It can be considered as a knowledge representation common language based on a graph model. In the functional programming community, inductive graphs have been proposed as a purely functional representation of graphs, which makes reasoning and concurrent programming simpler. In this paper, we propose a simplified representation of inductive graphs, called Inductive Triple Graphs, which can be used to represent RDF in a purely functional way. We show how to encode blank nodes using existential variables, and we describe two implementations of our approach in Haskell and Scala.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Jose Emilio Labra Gayo
    • 1
  • Johan Jeuring
    • 2
  • Jose María Álvarez Rodríguez
    • 3
  1. 1.University of OviedoSpain
  2. 2.Utrecht University, Open University of the NetherlandsThe Netherlands
  3. 3.South East European Research CenterGreece

Personalised recommendations