On foundational aspects of RDF and SPARQL

10/16/2019
by   Dominique Duval, et al.
0

We consider the recommendations of the World Wide Web Consortium (W3C) about the Resource Description Framework (RDF) and the associated query language SPARQL. We propose a new formal framework based on category theory which provides clear and concise formal definitions of the main basic features of RDF and SPARQL. We propose to define the notions of RDF graphs as well as SPARQL basic graph patterns as objects of some nested categories. This allows one to clarify, in particular, the role of blank nodes. Furthermore, we consider basic SPARQL CONSTRUCT and SELECT queries and formalize their operational semantics following a novel algebraic graph transformation approach called POIM.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/03/2020

An Algebraic Graph Transformation Approach for RDF and SPARQL

We consider the recommendations of the World Wide Web Consortium (W3C) a...
research
02/21/2022

A Rule-based Operational Semantics of Graph Query Languages

We consider a core language of graph queries. These queries are seen as ...
research
10/02/2020

All You Need Is CONSTRUCT

In SPARQL, the query forms SELECT and CONSTRUCT have been the subject of...
research
06/23/2021

Querying RDF Databases with Sub-CONSTRUCTs

Graph query languages feature mainly two kinds of queries when applied t...
research
12/16/2022

The Formal Theory of Monads, Univalently

We study the formal theory of monads, as developed by Street, in univale...
research
06/09/2011

Extensions of Simple Conceptual Graphs: the Complexity of Rules and Constraints

Simple conceptual graphs are considered as the kernel of most knowledge ...
research
01/02/2020

RDF 1.1: Knowledge Representation and Data Integration Language for the Web

Resource Description Framework (RDF) can seen as a solution in today's l...

Please sign up or login with your details

Forgot password? Click here to reset