Inductive representations of RDF Graphs

J.E. Labra-Gayo*, J.T. Jeuring, J.M. Álvarez Rodriguez

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

RDF forms the basis of the semantic web technology stack. It is based on a directed graph model where nodes and edges are identified by URIs. Occasionally, such graphs contain literals or blank nodes. The existential nature of blank nodes complicates the graph representation.

In this paper we propose a purely functional representation of RDF graphs using a special form of inductive graphs called inductive triple graphs. We employ logical variables to represent blank nodes. This approach can be implemented in any functional programming language such as Haskell and Scala.
Original languageEnglish
Pages (from-to)135-146
Number of pages12
JournalScience of computer programming
Volume95
Issue numberspecial issue part 1
DOIs
Publication statusPublished - Dec 2014

Fingerprint Dive into the research topics of 'Inductive representations of RDF Graphs'. Together they form a unique fingerprint.

Cite this