Inductive representations of RDF Graphs

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

doi:10.1016/j.scico.2013.12.011

Inductive representations of RDF Graphs

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

^*Corresponding author for this work

Research Line Learning (part of LIRS program)

Research output: Contribution to journal › Article › Academic › peer-review

1 Citation (Web of Science)

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 language	English
Pages (from-to)	135-146
Number of pages	12
Journal	Science of computer programming
Volume	95
Issue number	special issue part 1
DOIs	https://doi.org/10.1016/j.scico.2013.12.011
Publication status	Published - Dec 2014

Access to Document

10.1016/j.scico.2013.12.011

Cite this

@article{2af40394fd6b4dbc9ab166efbf980a4d,

title = "Inductive representations of RDF Graphs",

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.",

author = "J.E. Labra-Gayo and J.T. Jeuring and {{\'A}lvarez Rodriguez}, J.M.",

year = "2014",

month = dec,

doi = "10.1016/j.scico.2013.12.011",

language = "English",

volume = "95",

pages = "135--146",

journal = "Science of computer programming",

issn = "0167-6423",

publisher = "ELSEVIER SCIENCE BV",

number = "special issue part 1",

}

TY - JOUR

T1 - Inductive representations of RDF Graphs

AU - Labra-Gayo, J.E.

AU - Jeuring, J.T.

AU - Álvarez Rodriguez, J.M.

PY - 2014/12

Y1 - 2014/12

N2 - 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.

AB - 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.

U2 - 10.1016/j.scico.2013.12.011

DO - 10.1016/j.scico.2013.12.011

M3 - Article

SN - 0167-6423

VL - 95

SP - 135

EP - 146

JO - Science of computer programming

JF - Science of computer programming

IS - special issue part 1

ER -

Inductive representations of RDF Graphs

Abstract

Access to Document

Fingerprint

Cite this