this is for holding javascript data
Alberto Pepe deleted file A_dilated_triple_can.tex
about 11 years ago
Commit id: ed3805a63419bda551535eef08c90214a2705928
deletions | additions
diff --git a/A_dilated_triple_can.tex b/A_dilated_triple_can.tex
deleted file mode 100644
index 5709e76..0000000
--- a/A_dilated_triple_can.tex
+++ /dev/null
...
A dilated triple can be conveniently represented in RDF using a named graph \cite{named:carroll2005}. Statements using the named graph construct are not triples, but instead, are quads with the fourth component being denoted by a URI or blank node. Formally, $\tau = (s,p,o,g)$ and $g \in U \cup B$. The fourth component is considered the ``graph" in which the triple is contained. Thus, multiple quads with the same fourth element are considered different triples in the same graph. Named graphs were developed as a more compact (in terms of space) way to reify a triple. The reification of a triple was originally presented in the specification of RDF with the \ttt{rdf:Statement} construct \cite{rdfcon:klyne2004}. RDF reification has historically been used to add specific metadata to a triple, such as provenance, pedigree, privacy, and copyright information. In this article, the purpose of reifying a triple is to supplement its meaning with those of additional triples. While it is possible to make additional statements about the dilated triple (i.e.~the named graph component $g$), the motivation behind the dilated triple is to encapsulate many triples within a single graph, not to make statements about the graph \textit{per se}.
