Subset of RDF-star without recursion #277
Description
Specification of RDF-protostar
An RDF-protostar triple is a 3-tuple defined as follows:
- any RDF triple is an RDF-protostar triple;
- if t and t' are RDF triples, s is an IRI or a blank node, p is an IRI, o is an IRI, a blank node or a literal, then (t, p, o), (s, p, t) and (t, p, t') are RDF-protostar triples.
By definition, every RDF-protostar triple is a RDF-star triple as well.
An RDF-protostar graph is a set of RDF-protostar triples. Every RDF-protostar graph is a RDF-star graph.
Background and Motivation
Recursively nested quoted RDF-star triples are nice in theory but complex both in theory and practice. Data models should be comprehensible. Statements about statements are almost comprehensible but statements about statements about statements are not. Recursively quoted triples might have their use-case in theory but for the average data-wrangler they likely just add another pain point to nasty aspects of RDF such as blank nodes, collections, reification, inference, http-303-redirects, and an endless number of serialization forms.
RDF-protostar is enough for interoperability with labelled property graphs and in the end that's all what RDF-star is about, isn't it? Use cases of deeply nested quoted triples are surely as detached from practice as the famous Pizza and Wine ontologies. By the way all examples in the Final Community Group Report are non-recursive RDF-protostar triples. Nested quoted triples are only exemplified at one place.