Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

add in RDF dataset definitions from SPARQL query #50

Open
wants to merge 6 commits into
base: main
Choose a base branch
from
Open
Changes from 3 commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
46 changes: 46 additions & 0 deletions spec/index.html
Original file line number Diff line number Diff line change
Expand Up @@ -1498,6 +1498,52 @@ <h2>RDF Datasets</h2>
between datasets would require RDF graph entailments between the graphs with the same name
(adding in empty graphs as required).</p>

<table>
<caption>Definition of an RDF dataset</caption>
<tr>
<td class="semantictable">
<p>An <dfn data-cite="RDF12-CONCEPTS#dfn-rdf-dataset" data-lt="dataset">RDF dataset</dfn>
is a set:</p>
{ G, (&lt;u<sub>1</sub>&gt;, G<sub>1</sub>), (&lt;u<sub>2</sub>&gt;, G<sub>2</sub>), . .
. (&lt;u<sub>n</sub>&gt;, G<sub>n</sub>) }<br>
where n&ge;0 and G and each G<sub>i</sub> are graphs, and each &lt;u<sub>i</sub>&gt; is an IRI. Each
&lt;u<sub>i</sub>&gt; is distinct.</p>
<p>G is called the default graph. (&lt;u<sub>i</sub>&gt;, G<sub>i</sub>) are called named
graphs.</p>
</td>
</tr>
</table>

<table>
<caption>Definition of RDF dataset merge</caption>
<tr>
<td class="semantictable">
<p>Let DS1 = { G1, (&lt;u1<sub>1</sub>&gt;, G1<sub>1</sub>), (&lt;u1<sub>2</sub>&gt;,
G1<sub>2</sub>), . . . (&lt;u1<sub>n</sub>&gt;, G1<sub>n</sub>) },<br>
and DS2 = { G2, (&lt;u2<sub>1</sub>&gt;, G2<sub>1</sub>), (&lt;u2<sub>2</sub>&gt;,
G2<sub>2</sub>), . . . (&lt;u2<sub>m</sub>&gt;, G2<sub>m</sub>) }</p>
<p>The <dfn data-lt="RDF dataset merge">RDF dataset merge</dfn> of DS1 and DS2 is:<br>
pfps marked this conversation as resolved.
Show resolved Hide resolved
DS={ G, (&lt;u<sub>1</sub>&gt;, G<sub>1</sub>), (&lt;u<sub>2</sub>&gt;, G<sub>2</sub>), .
. . (&lt;u<sub>k</sub>&gt;, G<sub>k</sub>) }<br>
where:</p>
<p>Write N1 for { &lt;u1<sub>j</sub>&gt; j = 1 to n }<br>
Write N2 for { &lt;u2<sub>j</sub>&gt; j = 1 to m }<br></p>
<ul>
<li>G is the <a data-cite="RDF12-SEMANTICS#dfn-merge">merge</a> of G1 and G2
</li>
<li>(&lt;u<sub>i</sub>&gt;, G<sub>i</sub>) where &lt;u<sub>i</sub>&gt; is in N1 but not
in N2</li>
<li>(&lt;u<sub>i</sub>&gt;, G<sub>i</sub>) where &lt;u<sub>i</sub>&gt; is in N2 but not
in N1</li>
<li>(&lt;u<sub>i</sub>&gt;, G<sub>i</sub>) where &lt;u<sub>i</sub>&gt; is equal to
&lt;u<sub>j</sub>&gt; in N1 and equal to &lt;u<sub>k</sub>&gt; in N2 and G<sub>i</sub>
is the <a data-cite="RDF12-SEMANTICS#dfn-merge">merge</a> of G1<sub>j</sub> and G2<sub>k</sub>
</li>
</ul>
</td>
</tr>
</table>

</section>

<h2 id="appendices">Appendices</h2>
Expand Down
Loading