-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathindex.html
1888 lines (1611 loc) · 94.4 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="utf-8">
<title>RDF 1.2 Concepts and Abstract Syntax</title>
<script src="https://www.w3.org/Tools/respec/respec-w3c" class="remove"></script>
<script src="./common/local-biblio.js" class="remove"></script>
<script src="./common/fixup.js" class="remove"></script>
<script class='remove'>
var respecConfig = {
localBiblio: localBibliography,
specStatus: "ED",
edDraftURI: "https://w3c.github.io/rdf-concepts/spec/",
shortName: "rdf12-concepts",
copyrightStart: "2004",
previousPublishDate: "2014-02-25",
previousMaturity: "REC",
prevRecShortname: "rdf11-concepts",
editors: [
{ name: "Olaf Hartig", w3cid: "112469"},
{ name: "Pierre-Antoine Champin", w3cid: "129656"},
{ name: "Gregg Kellogg", w3cid: "44770" },
{ name: "Andy Seaborne", w3cid: "29909" }
],
formerEditors: [
{ name: "Richard Cyganiak" },
{ name: "David Wood", note: "Chair" },
{ name: "Markus Lanthaler" },
{ name: "Graham Klyne" },
{ name: "Jeremy J. Carroll" },
{ name: "Brian McBride" }
],
xref: ["I18N-GLOSSARY", "INFRA"],
github: "https://github.com/w3c/rdf-concepts/",
group: "rdf-star",
doJsonLd: true,
wgPublicList: "public-rdf-star-wg"
};
</script>
<style>
figure { text-align: center; }
table.simple td, table th { border: 1px solid #ddd; padding: 0.2em 0.5em; }
ol ol { list-style-type: lower-latin; }
.grammar td { font-family: monospace;}
.grammar-literal { color: gray;}
code {color: #ff4500;} /* Old W3C Style */
div.abnf {margin-left: 1em;}
</style>
</head>
<body>
<section id="abstract">
<p>The Resource Description Framework (RDF) is a framework for
representing information in the Web.
This document defines an abstract syntax (a data model)
which serves to link all RDF-based languages and specifications.
The abstract syntax has two key data structures:</p>
<ul>
<li>RDF graphs are sets of subject-predicate-object triples,
where the elements may be IRIs, blank nodes, or datatyped literals.
They are used to express descriptions of resources.</li>
<li>RDF datasets are used to organize collections of RDF graphs,
are comprised of a default graph and zero or more named graphs.</li>
</ul>
<p>RDF 1.2 introduces <a>triple terms</a> as another kind of <a>RDF term</a>
which can be used as the <a>object</a> of another <a>triple</a>.
RDF 1.2 also introduces <a>directional language-tagged strings</a>,
which contain a <a>base direction</a> element that allows the
initial text direction to be specified for presentation by a user agent.</p>
<p>RDF 1.2 Concepts introduces key concepts and terminology for RDF 1.2, discusses
datatyping, and the handling of <a>fragment identifiers</a> in IRIs within
RDF graphs.</p>
</section>
<section id="sotd">
<p>This document is part of the RDF 1.2 document suite.
It is the central RDF 1.2 specification and defines the core RDF concepts.
Test suites and implementation reports of a number of RDF 1.2
specifications that build on this document are available through the
[[[RDF11-TESTCASES]]] document [[RDF11-TESTCASES]].</p>
<p>RDF 1.2 Concepts is an update to [[RDF11-CONCEPTS]],
which was itself, an update to [[RDF-CONCEPTS-20040210]].</p>
<p class="ednote">Determine how to reference 1.2 test cases.</p>
<section id="related" data-include="./common/related.html"></section>
</section>
<section id="section-Introduction" class="informative">
<h2>Introduction</h2>
<p>The <em>Resource Description Framework</em> (RDF) is a framework
for representing information in the Web.</p>
<p>This document defines an abstract syntax (a data model)
which serves to link all RDF-based languages and specifications,
including:</p>
<ul>
<li>the formal model-theoretic semantics for RDF [[RDF12-SEMANTICS]];</li>
<li>serialization syntaxes for storing and exchanging RDF such as [[[RDF12-TURTLE]]] [[RDF12-TURTLE]]
and [[[JSON-LD11]]] [[JSON-LD11]];</li>
<li>the [[[SPARQL12-QUERY]]] [[SPARQL12-QUERY]];</li>
<li>the [[[RDF12-SCHEMA]]] [[RDF12-SCHEMA]].</li>
</ul>
<section id="data-model">
<h3>Graph-based Data Model</h3>
<p>The core structure of the abstract syntax is a set of
<a data-lt="RDF triple">triples</a>, each consisting of a <a>subject</a>,
a <a>predicate</a> and an <a>object</a>. A set of such triples is called
an <a>RDF graph</a>. An RDF graph can be visualized as a node and
directed-arc diagram, in which each triple is represented as a
node-arc-node link.</p>
<figure id="fig-rdf-graph">
<a href="rdf-graph.svg"><img src="rdf-graph.svg" alt="An RDF graph with two nodes (Subject and Object) and a triple connecting them (Predicate)" /></a>
<figcaption>An RDF graph with two nodes (Subject and Object) and a triple connecting them (Predicate)</figcaption>
</figure>
<p>There can be four kinds of <a>nodes</a> in an
<a>RDF graph</a>: <a>IRIs</a>, <a>literals</a>,
<a>blank nodes</a>, and <a>triple terms</a>.</p>
</section>
<section id="resources-and-statements">
<h3>Resources and Statements</h3>
<p>Any <a>IRI</a> or <a>literal</a> <dfn data-lt="denote" data-local-lt="denoted">denotes</dfn>
something in the world (the "universe of discourse").
These things are called
<span id="dfn-resources"><!-- obsolete term --></span>
<dfn data-lt="resource">resources</dfn>. Anything can be a resource,
including physical things, documents, abstract concepts, numbers
and strings; the term is synonymous with "entity" as it is used in
[[[RDF12-SEMANTICS]]] [[RDF12-SEMANTICS]].
The resource denoted by an IRI is called its <a>referent</a>, and the
resource denoted by a literal is called its
<a>literal value</a>. Literals have
<a>datatypes</a> that define the range of possible
values, such as strings, numbers, and dates. Special kinds of literals —
<a>language-tagged strings</a> and <a>directional language-tagged strings</a> —
respectively denote plain-text strings in a natural language, and plain-text
strings in a natural language including an initial text direction.</p>
<p>Asserting an <a>RDF triple</a> says that <em>some relationship,
indicated by the <a>predicate</a>, holds between the
<a>resources</a> <a>denoted</a> by
the <a>subject</a> and <a>object</a></em>. This statement corresponding
to an RDF triple is known as an <dfn data-local-lt="statement">RDF statement</dfn>.
The predicate itself is an <a>IRI</a> and denotes a <dfn class="export">property</dfn>,
that is, a <a>resource</a> that can be thought of as a binary relation.
(Relations that involve more than two entities can only be
<a data-cite="SWBP-N-ARYRELATIONS#">indirectly
expressed in RDF</a> [[SWBP-N-ARYRELATIONS]].)</p>
<p>Unlike <a>IRIs</a> and <a>literals</a>,
<a>blank nodes</a> do not identify specific
<a>resources</a>. <a>Statements</a>
involving blank nodes say that something with the given relationships
exists, without explicitly naming it.</p>
</section>
<section id="section-quoted-triples">
<h3>Quoted Triples</h3>
<p class="issue" data-number="81">
As the WG has moved away from the notion of quoted triples, this section needs to be changed such that it does not mention quoted triples anymore but, instead, describes whatever new concept the WG settles on (e.g., <a>triple terms</a>).
</p>
<p>A <dfn>quoted triple</dfn> is an <a>RDF term</a> with the components of
an <a>RDF triple</a>, which can be used as the <a>subject</a> or <a>object</a>
of another triple.</p>
<p>A <a>quoted triple</a> is not necessarily asserted, allowing
statements to be made about other statements that may not be
asserted within an <a>RDF graph</a>.
This allows statements to be made about relationships that may be contradictory.
For a <a>quoted triple</a> to be asserted,
it must also appear in a graph as an <a>asserted triple</a>.</p>
<p>The following diagram represents a statement with an unasserted <a>quoted triple</a>
as the subject.</p>
<figure id="fig-quoted-triple">
<a href="quoted-triple.svg">
<!-- Source for this file is at https://docs.google.com/drawings/d/1I_QxbUgnQXumXzb8c0WNJHIQ-mtRs2S80dDG6i9aOD8 -->
<img src="quoted-triple.svg"
alt="An RDF graph containing a triple that references an unasserted quoted triple (with grey background) as the subject"
style="width:70%"
aria-describedby="fig-quoted-triple-alt"/>
</a>
<figcaption id="fig-quoted-triple-alt">
An RDF graph containing a triple that references an unasserted quoted triple (with grey background) as the subject.
</figcaption>
</figure>
<p>A variation on the graph shown in <a href="#fig-quoted-triple"></a> can be described
where the <a>quoted triple</a> is also <a data-lt="asserted triple">asserted</a>.</p>
<figure id="fig-quoted-asserted-triple">
<a href="quoted-asserted-triple.svg">
<!-- Source for this file is at https://docs.google.com/drawings/d/1aoUEsb07P-nu5rvPRob7O07CRKgnf7tBw2CmRJNuaQ0 -->
<img src="quoted-asserted-triple.svg"
alt="An RDF graph containing two triples where one of them contains the other as the subject; hence, that other triple is both quoted and asserted"
style="width:70%"
aria-describedby="fig-quoted-asserted-triple-alt"/>
</a>
<figcaption id="fig-quoted-asserted-triple-alt">
An RDF graph containing two triples where one of them contains the other as the subject;
hence, that other triple is both quoted and asserted.
</figcaption>
</figure>
<p>Note that a <a>quoted triple</a> may also have a quoted triple as its subject or object.</p>
<p class="issue" data-number="34">
This issue considers the potential for additional terminology related to <a>quoted triples</a>.
</p>
</section>
<section id="referents">
<h3>The Referent of an IRI</h3>
<p>The <a>resource</a> <a>denoted</a> by an <a>IRI</a>
is also called its <dfn>referent</dfn>. For some IRIs with particular
meanings, such as those identifying XSD datatypes, the referent is
fixed by this specification. For all other IRIs, what exactly is
<a>denoted</a> by any given IRI is not defined by this specification. Other
specifications may fix IRI referents, or apply other constraints on
what may be the referent of any IRI.</p>
<p>Guidelines for determining the <a>referent</a> of an <a>IRI</a> are
provided in other documents, like
[[[WEBARCH]]] [[WEBARCH]]
and [[[COOLURIS]]] [[COOLURIS]].
A very brief, informal, and partial account follows:</p>
<ul>
<li>By design, IRIs have global scope. Thus, two different appearances of an IRI
<a>denote</a> the same <a>resource</a>. Violating this principle constitutes
an <a data-cite="WEBARCH#URI-collision">IRI collision</a> [[WEBARCH]].</li>
<li>By social convention, the
<a data-cite="WEBARCH#uri-ownership">IRI owner</a>
[[WEBARCH]] gets to say what the intended (or usual)
referent of an <a>IRI</a> is. Applications and users need not
abide by this intended denotation, but there may be a loss of
interoperability with other applications and users if they do
not do so.</li>
<li>The IRI owner can establish the intended <a>referent</a>
by means of a specification or other document that explains
what is denoted. For example, the
[[[VOCAB-ORG]]] [[VOCAB-ORG]]
specifies the intended referents of various IRIs that start with
<code>http://www.w3.org/ns/org#</code>.</li>
<li>A good way of communicating the intended referent
is to set up the IRI so that it
<a data-cite="WEBARCH#uri-dereference">dereferences</a> [[WEBARCH]]
to such a document.</li>
<li>Such a document can, in fact, be an <a>RDF document</a>
that describes the denoted resource by means of
<a>RDF statements</a>.</li>
</ul>
<p>Perhaps the most important characteristic of <a>IRIs</a>
in web architecture is that they can be
<a data-cite="WEBARCH#uri-dereference">dereferenced</a>,
and hence serve as starting points for interactions with a remote server.
This specification is not concerned with such interactions.
It does not define an interaction model. It only treats IRIs as globally
unique identifiers in a graph data model that describes resources.
However, those interactions are critical to the concept of
[[[LINKED-DATA]]], [[LINKED-DATA]],
which makes use of the RDF data model and serialization formats.</p>
</section>
<section id="vocabularies">
<h3>RDF Vocabularies and Namespace IRIs</h3>
<p>An <dfn data-local-lt="vocabulary">RDF vocabulary</dfn> is a collection of <a>IRIs</a>
intended for use in <a>RDF graphs</a>. For example,
the IRIs documented in [[RDF12-SCHEMA]] are the RDF Schema vocabulary.
RDF Schema can itself be used to define and document additional
RDF vocabularies. Some such vocabularies are mentioned in the
Primer [[RDF12-PRIMER]].</p>
<p>The <a>IRIs</a> in an <a>RDF vocabulary</a> often begin with
a common substring known as a <dfn>namespace IRI</dfn>.
Some namespace IRIs are associated by convention with a short name
known as a <dfn>namespace prefix</dfn>. Some examples:
<table id="tab-vocab-ns" class="simple">
<caption>Some example namespace prefixes and IRIs</caption>
<tr>
<th>Namespace prefix</th>
<th>Namespace IRI</th>
<th>RDF vocabulary</th>
</tr>
<tr>
<td>rdf</td>
<td><a href="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><code>http://www.w3.org/1999/02/22-rdf-syntax-ns#</code></a></td>
<td>The RDF built-in vocabulary [[RDF12-SCHEMA]]</td>
</tr>
<tr><td>rdfs</td>
<td><a href="http://www.w3.org/2000/01/rdf-schema#"><code>http://www.w3.org/2000/01/rdf-schema#</code></a></td>
<td>The RDF Schema vocabulary [[RDF12-SCHEMA]]</td>
</tr>
<tr><td>xsd</td>
<td><a href="http://www.w3.org/2001/XMLSchema#"><code>http://www.w3.org/2001/XMLSchema#</code></a></td>
<td>The <a>RDF-compatible XSD types</a></td>
</tr>
</table>
<p>In some serialization formats it is common to abbreviate <a>IRIs</a>
that start with <a>namespace IRIs</a> by using a
<a>namespace prefix</a> in order to assist readability. For example, the IRI
<code>http://www.w3.org/1999/02/22-rdf-syntax-ns#XMLLiteral</code>
would be abbreviated as <code>rdf:XMLLiteral</code>.
Note however that these abbreviations are <em>not</em> valid IRIs,
and must not be used in contexts where IRIs are expected.
Namespace IRIs and namespace prefixes are <em>not</em> a formal part of the
RDF data model. They are merely a syntactic convenience for
abbreviating IRIs.</p>
<p>The term “<dfn class="lint-ignore">namespace</dfn>” on its own does not have a
well-defined meaning in the context of RDF, but is sometimes informally
used to mean “<a>namespace IRI</a>” or “<a>RDF vocabulary</a>”.</p>
</section>
<section id="change-over-time">
<h2>RDF and Change over Time</h2>
<p>The RDF data model is <em>atemporal</em>: <a>RDF graphs</a>
are static snapshots of information.</p>
<p>However, <a>RDF graphs</a> can express information
about events and about temporal aspects of other entities,
given appropriate <a>vocabulary</a> terms.</p>
<p>Since <a>RDF graphs</a> are defined as mathematical
sets, adding or removing <a>triples</a> from an
RDF graph yields a different RDF graph.</p>
<p>We informally use the term <dfn>RDF source</dfn> to refer to a
persistent yet mutable source or container of
<a>RDF graphs</a>. An RDF source is a <a>resource</a>
that may be said to have a state that can change over time.
A snapshot of the state can be expressed as an RDF graph.
For example, any web document that has an RDF-bearing representation
may be considered an RDF source. Like all resources, RDF sources may
be named with <a>IRIs</a> and therefore described in
other RDF graphs.</p>
<p>Intuitively speaking, changes in the universe of discourse
can be reflected in the following ways:</p>
<ul>
<li>An <a>IRI</a>, once minted, should never
change its intended <a>referent</a>. (See
<a data-cite="WEBARCH#URI-persistence">URI persistence</a>
[[WEBARCH]].)</li>
<li><a>Literals</a>, by design, are constants and
never change their <a data-lt="literal value">value</a>.</li>
<li>A relationship that holds between two <a>resources</a>
at one time may not hold at another time.</li>
<li><a>RDF sources</a> may change their state over time.
That is, they may provide different <a>RDF graphs</a>
at different times.</li>
<li>Some <a>RDF sources</a> may, however, be immutable
snapshots of another RDF source, archiving its state at some
point in time.</li>
</ul>
</section>
<section id="managing-graphs">
<h3>Working with Multiple RDF Graphs</h3>
<p>As RDF graphs are sets of triples, they can be
combined easily, supporting the use of data from
multiple sources. Nevertheless, it is sometimes desirable to work
with multiple RDF graphs while keeping their contents separate.
<a>RDF datasets</a> support this requirement.</p>
<p>An <a>RDF dataset</a> is a collection of
<a>RDF graphs</a>. All but one of these graphs have
an associated <a>IRI</a> or blank node. They are called
<a>named graphs</a>, and the IRI or blank node
is called the <a>graph name</a>.
The remaining graph does not have an associated IRI, and is called
the <a>default graph</a> of the RDF dataset.</p>
<p>There are many possible uses for <a>RDF datasets</a>.
One such use is to hold snapshots of multiple
<a>RDF sources</a>.</p>
</section>
<section id="entailment">
<h3>Equivalence, Entailment and Inconsistency</h3>
<p>An <a>RDF triple</a> encodes a <a>statement</a>—a
simple <dfn class="export">logical expression</dfn>, or claim about the world.
An <a>RDF graph</a> is the conjunction (logical <em>AND</em>) of
its triples. The precise details of this meaning of RDF triples and graphs are
the subject of [[[RDF12-SEMANTICS]]] [[RDF12-SEMANTICS]], which yields the
following relationships between <a>RDF graph</a>s:</p>
<dl>
<dt><dfn>Entailment</dfn></dt>
<dd>An <a>RDF graph</a> <em>A</em> entails another RDF graph <em>B</em>
if every possible arrangement of the world
that makes <em>A</em> true also makes <em>B</em> true. When <em>A</em>
entails <em>B</em>, if the truth of <em>A</em> is presumed or demonstrated
then the truth of <em>B</em> is established.
</dd>
<dt><dfn data-local-lt="equivalent">Equivalence</dfn></dt>
<dd>Two <a>RDF graphs</a> <em>A</em> and <em>B</em>
are equivalent if they make the same claim about the world.
<em>A</em> is equivalent to <em>B</em> if and only if
<em>A</em> <a data-lt="entailment">entails</a> <em>B</em> and
<em>B</em> entails <em>A</em>.
</dd>
<dt><dfn data-lt="inconsistent">Inconsistency</dfn><span id="dfn-inconsistency"><!-- obsolete term --></span></dt>
<dd>An <a>RDF graph</a> is inconsistent if it contains
an internal contradiction. There is no possible arrangement
of the world that would make the expression true.</dd>
</dl>
<p>An <span id="dfn-entailment-regime"><!-- obsolete term --></span><dfn data-cite="RDF12-SEMANTICS#dfn-entailment-regime">entailment regime</dfn> [[RDF12-SEMANTICS]] is a specification that
defines precise conditions that make these relationships hold.
RDF itself recognizes only some basic cases of entailment, <a>equivalence</a>
and inconsistency. Other specifications, such as
[[[RDF12-SCHEMA]]] [[RDF12-SCHEMA]]
and <a data-cite="owl2-overview#">OWL 2</a>
[[OWL2-OVERVIEW]], add more powerful entailment regimes,
as do some domain-specific <a>vocabularies</a>.</p>
<p>This specification does not constrain how implementations
use the logical relationships defined by
<a>entailment regimes</a>.
Implementations may or may not detect
<a>inconsistencies</a>, and may make all,
some or no <a data-lt="entailment">entailed</a> information
available to users.</p>
</section>
<section id="rdf-documents">
<h2>RDF Documents and Syntaxes</h2>
<p>An <dfn>RDF document</dfn> is a document that encodes an
<a>RDF graph</a> or <a>RDF dataset</a> in a <dfn>concrete RDF syntax</dfn>,
such as Turtle [[RDF12-TURTLE]], RDFa [[RDFA-CORE]], JSON-LD [[JSON-LD11]], or
TriG [[RDF12-TRIG]]. RDF documents enable the exchange of RDF graphs and RDF
datasets between systems.</p>
<p>A <a>concrete RDF syntax</a> may offer
many different ways to encode the same <a>RDF graph</a> or
<a>RDF dataset</a>, for example through the use of
<a>namespace prefixes</a>,
<a>IRI references</a>, <a>blank node identifiers</a>,
and different ordering of triples. While these aspects can have great
effect on the convenience of working with the <a>RDF document</a>,
they are not significant for its meaning.</p>
</section>
</section>
<section id="conformance">
<p>This specification, <em>RDF 1.2 Concepts and Abstract Syntax</em>,
defines a data model and related terminology for use in
other specifications, such as
<a>concrete RDF syntaxes</a>,
API specifications, and query languages.
Implementations cannot directly conform to
<em>RDF 1.2 Concepts and Abstract Syntax</em>,
but can conform to such other specifications that normatively
reference terms defined here.</p>
<p>This specification establishes two conformance levels:</p>
<ul>
<li><dfn class="no-export lint-ignore">Full</dfn> conformance
supports <a data-lt="RDF graph">graphs</a> and <a data-lt="RDF dataset">datasets</a>
with <a>triples</a> that contain <a>triple terms</a>.
Concrete syntaxes in which such graphs and datasets can be expressed include
[[RDF12-N-TRIPLES]], [[RDF12-N-QUADS]], [[RDF12-TURTLE]], and [[RDF12-TRIG]].</li>
<li><dfn class="no-export lint-ignore">Classic</dfn> conformance
only supports <a data-lt="RDF graph">graphs</a> or <a data-lt="RDF dataset">datasets</a>
with <a>triples</a> that do not contain <a>triple terms</a>.</li>
</ul>
<p class="ednote">The conformance levels described above are tentative,
and still the subject of group discussion. An alternative to conformance
levels, "profiles", may be adopted instead, abandoned, or described in
another specification.</p>
<section id="rdf-strings">
<h2>Strings in RDF</h2>
<p>RDF uses Unicode [[Unicode]] as the fundamental representation for string values.
Within this, and related specifications, the term <dfn id="dfn-rdf-string">string</dfn>,
or <a data-lt="string">RDF string</a>,
is used to describe an ordered sequence of zero or more
<a data-cite="I18N-GLOSSARY#dfn-code-point" class="lint-ignore">Unicode code points</a>
which are <a data-cite="I18N-GLOSSARY#dfn-scalar-value" class="lint-ignore">Unicode scalar values</a>.
Unicode scalar values do not include the
<a data-cite="I18N-GLOSSARY#dfn-surrogate" class="lint-ignore">surrogate code points</a>.
Note that most <a>concrete RDF syntaxes</a> require the use
of the UTF-8 character encoding [[!RFC3629]],
and use the `\u0000` or `\U00000000` forms to express certain non-character values.
</p>
<p>A string is identical to another string if it consists of the same sequence of code points.
An implementation MAY determine string equality by comparing the
<a data-cite="I18N-GLOSSARY#dfn-code-unit">code units</a> of two strings
that use the same <a data-cite="I18N-GLOSSARY#dfn-character-encoding">Unicode character encoding</a>
(UTF-8 or UTF-16) without decoding the string into a
<a data-cite="I18N-GLOSSARY#dfn-code-point" class="lint-ignore">Unicode code point</a> sequence.</p>
</section>
</section>
<section id="section-rdf-graph">
<h2>RDF Graphs</h2>
<p>An <dfn>RDF graph</dfn> is a set of <a>RDF triples</a>.</p>
<p class=issue>
Do we still need to define <dfn>asserted triple</dfn>?.
</p>
<section id="section-triples">
<h3>Triples</h3>
<p>An <dfn data-local-lt="triple">RDF triple</dfn> (usually called "triple")
is a 3-tuple (|s|, |p|, |o|) where:</p>
<ul>
<li>|s| is an <a>IRI</a> or a <a>blank node</a>,</li>
<li>|p| is an <a>IRI</a>, and</li>
<li>|o| is an <a>IRI</a>, a <a>blank node</a>, a <a>literal</a>,
or a <a>triple term</a>.</li>
</ul>
<p>A <dfn>triple term</dfn> is a 3-tuple that is defined recursively as follows:</p>
<ul>
<li>
If |s| is an <a>IRI</a> or a <a>blank node</a>,
|p| is an <a>IRI</a>, and
|o| is an <a>IRI</a>, a <a>blank node</a>, or a <a>literal</a>,
then (|s|, |p|, |o|) is a triple term.
</li>
<li>
If |s| is an <a>IRI</a> or a <a>blank node</a>,
|p| is an <a>IRI</a>, and
|o| is a <a>triple term</a>,
then (|s|, |p|, |o|) is a triple term.
</li>
</ul>
<p>Given a <a>triple</a> (|s|, |p|, |o|),
|s| is called the <dfn>subject</dfn> of the triple,
|p| is called the <dfn>predicate</dfn> of the triple, and
|o| is called the <dfn>object</dfn> of the triple.
Similarly, given a <a>triple term</a> (|s|, |p|, |o|),
|s| is called the <em>subject</em> of the triple term,
|p| is called the <em>predicate</em> of the triple term, and
|o| is called the <em>object</em> of the triple term.</p>
<p class="note">While, syntactically, the notion of an <a>RDF triple</a>
and the notion of a <a>triple term</a> are the same, they represent
different concepts. RDF triples are the members of <a>RDF graphs</a>,
whereas triple terms can be used as components of RDF triples.</p>
<p class="note">The definition of <a>triple term</a> is recursive.
That is, a <a>triple term</a> can itself have an
<a>object</a> component which is another <a>triple term</a>.
However, by this definition, cycles of <a>triple terms</a> cannot be created.</p>
<p><a>IRIs</a>, <a>literals</a>,
<a>blank nodes</a>, and <a>triple terms</a> are collectively known as
<span id="dfn-rdf-terms"><!-- obsolete term--></span><dfn data-lt="rdf term">RDF terms</dfn>.</p>
<p><a>IRIs</a>, <a>literals</a>,
<a>blank nodes</a>, and <a>triple terms</a> are distinct and distinguishable.
For example, a literal with the string <code>http://example.org/</code> as
its <a>lexical form</a>
is not equal to the IRI <code>http://example.org/</code>,
nor to a blank node with the <a>blank node identifier</a>
<code>http://example.org/</code>.</p>
<p>The set of <span id="dfn-nodes"><!-- obsolete term--></span><dfn data-lt="node">nodes</dfn> of an <a>RDF graph</a>
is the set of <a>subjects</a> and <a>objects</a> of the <a>triples</a> in the graph.
It is possible for a predicate IRI to also occur as a node in
the same graph.</p>
</section>
<section id="section-IRIs">
<h3>IRIs</h3>
<p>An <dfn data-lt="iri"><abbr title="Internationalized Resource Identifier">IRI</abbr></dfn>
(Internationalized Resource Identifier) within an RDF graph
is a <a>string</a> that conforms to the syntax
defined in RFC 3987 [[!RFC3987]].</p>
<p class="note">For convenience, a complete [[ABNF]] grammar
from [[RFC3987]] is provided in <a href="#iri-abnf" class="sectionRef"></a>.</p>
<p>IRIs in the RDF abstract syntax MUST be <a data-cite="RFC3986#section-5">resolved</a>
per [[RFC3986]],
and MAY contain a fragment identifier.</p>
<p><dfn>IRI equality</dfn>:
Two IRIs are the same if and only if they consist of the same sequence of
<a data-cite="I18N-GLOSSARY#dfn-code-point" class="lint-ignore">Unicode code points</a>,
as in Simple String Comparison in
<a data-cite="rfc3987#section-5.3.1">section 5.3.1</a> of [[!RFC3987]].
(This is done in the abstract syntax, so the IRIs are resolved
IRIs with no escaping or encoding.)
Further normalization MUST NOT be performed before this comparison. </p>
<div class="note" id="note-iris">
<p><strong>URIs and IRIs:</strong>
IRIs are a generalization of
<dfn data-lt="URI" data-lt-noDefault><abbr title="Uniform Resource Identifier">URI</abbr>s</dfn>
[[RFC3986]] that permits a wider range of Unicode characters [[UNICODE]].
Every URI and URL is an IRI, but not every IRI is an URI.
In RDF, IRIs are used as <dfn data-lt="iri reference">IRI references</dfn>, as defined in [[RFC3987]]
<a data-cite="RFC3987#section-1.3">section 1.3</a>.
An IRI reference is common usage of an Internationalized Resource Identifier.
An IRI reference refers to either a resolved <a>IRI</a> or <a>relative IRI reference</a>,
as described by the <em>IRI-reference</em> production in <a href="#iri-abnf" class="sectionRef"></a>.
The abstract syntax uses only fully resolved <a>IRIs</a>.
When IRIs are used in operations that are only
defined for URIs, they must first be converted according to
the mapping defined in
<a data-cite="rfc3987#section-3.1">section 3.1</a>
of [[!RFC3987]]. A notable example is retrieval over the HTTP
protocol. The mapping involves UTF-8 encoding of non-ASCII
characters, %-encoding of octets not allowed in URIs, and
Punycode-encoding of domain names.</p>
<p><strong>URLs:</strong>
The [[[URL]]] is largely compatible with [[RFC3987]] IRIs,
but is based on a processing model important for implementation
within web browsers and are not described using an [[ABNF]] grammar.
</p>
<p><strong>Relative IRI references:</strong>
Some <a>concrete RDF syntaxes</a> permit
<span id="dfn-relative-iris"><!-- obsolete term--></span>
<dfn id="dfn-relative-iri" data-lt="relative iri reference">relative IRI references</dfn> as a convenient shorthand
that allows authoring of documents independently from their final
publishing location.
Relative IRI references must be
<a data-cite="rfc3986#section-5.2">resolved against</a> a
<dfn class="export">base IRI</dfn>.
Therefore, the RDF graph serialized in such syntaxes is well-defined only
if a <a data-cite="rfc3986#section-5.1">base IRI
can be established</a> [[RFC3986]].</p>
<p><strong>IRI normalization:</strong>
Interoperability problems can be avoided by minting
only IRIs that are normalized according to
<a data-cite="rfc3987#section-5">Section 5</a>
of [[!RFC3987]]. Non-normalized forms that are best avoided
include:</p>
<ul>
<li>Uppercase characters in scheme names and domain names</li>
<li>Percent-encoding of characters where it is not
required by IRI syntax</li>
<li>Explicitly stated HTTP default port
(<code>http://example.com:80/</code>);
<code>http://example.com/</code> is preferable</li>
<li>Completely empty path in HTTP IRIs
(<code>http://example.com</code>);
<code>http://example.com/</code> is preferable</li>
<li>“<code>/./</code>” or “<code>/../</code>” in the path
component of an IRI</li>
<li>Lowercase hexadecimal letters within percent-encoding
triplets (“<code>%3F</code>” is preferable over
“<code>%3f</code>”)</li>
<li>Punycode-encoding of Internationalized Domain Names
in IRIs [[RFC3492]]</li>
<li>IRIs that are not in Unicode <a class="lint-ignore">Normalization Form C</a> [[UAX15]]</li>
</ul>
</div>
</section>
<section id="section-Graph-Literal">
<h2>Literals</h2>
<p>Literals are used for values such as strings, numbers, and dates.</p>
<p>A <dfn data-local-lt="RDF literal">literal</dfn> in an <a>RDF graph</a> consists of
two, three, or four elements:</p>
<ul>
<li>a <dfn>lexical form</dfn> consisting of a sequence of
<a data-cite="I18N-GLOSSARY#dfn-code-point" class="lint-ignore">Unicode code points</a> [[!UNICODE]]
which are <a data-cite="I18N-GLOSSARY#dfn-scalar-value">Unicode scalar values</a>,
and therefore do not contain
<a data-cite="I18N-GLOSSARY#dfn-surrogate" class="lint-ignore">Unicode surrogate code points</a>.</li>
<li>a <dfn>datatype IRI</dfn>, being an <a>IRI</a>
identifying a datatype that determines how the lexical form maps
to a <a>literal value</a>, and</li>
<li>if and only if the <a>datatype IRI</a> is
<code>http://www.w3.org/1999/02/22-rdf-syntax-ns#langString</code>, a
non-empty <dfn>language tag</dfn> as defined by [[!BCP47]]. The
language tag MUST be well-formed according to
<a data-cite="bcp47#section-2.2.9">section 2.2.9</a>
of [[!BCP47]],
and MUST be treated consistently, that is, in a case insensitive manner.
Two language tags are the same if they only differ by case.</li>
<li>if and only if the <a>datatype IRI</a> is
<code>http://www.w3.org/1999/02/22-rdf-syntax-ns#dirLangString</code>,
a non-empty <a>language tag</a>
that MUST be well-formed according to <a data-cite="bcp47#section-2.2.9">section 2.2.9</a>
of [[!BCP47]].
and a <dfn>base direction</dfn> that MUST be either `ltr` or `rtl`.</li>
</ul>
<p>A literal is a <dfn>language-tagged string</dfn> if the third element
is present and the fourth element is not present.
Lexical representations of language tags
MAY be case normalized,
(for example, by converting to lower case).
</p>
<p>A literal is a <dfn id="dfn-dir-lang-string">directional language-tagged string</dfn>
if both the third element and fourth elements are present.
The third element, the language tag, is treated identically as in a <a>language-tagged string</a>,
and the fourth element, <a>base direction</a>, MUST be either `ltr` or `rtl`, which MUST be in lower case.</p>
<p>Please note that concrete syntaxes MAY support
<dfn data-lt="simple literal" class="export">simple literals</dfn> consisting of only a
<a>lexical form</a> without any <a>datatype IRI</a>, <a>language tag</a>, or <a>base direction</a>.
Simple literals are syntactic sugar for abstract syntax
<a>literals</a>
with the <a>datatype IRI</a>
<code>http://www.w3.org/2001/XMLSchema#string</code>
(which is commonly abbreviated as <code>xsd:string</code>).
Similarly, most concrete syntaxes represent
<a>language-tagged strings</a> and <a>directional language-tagged strings</a> without
the <a>datatype IRI</a> because it always equals either
<code>http://www.w3.org/1999/02/22-rdf-syntax-ns#langString</code> (<code>rdf:langString</code>)
or <code>http://www.w3.org/1999/02/22-rdf-syntax-ns#dirLangString</code> (<code>rdf:dirLangString</code>), respectively.</p>
<p>The <dfn>literal value</dfn> associated with a <a>literal</a> is:</p>
<ol>
<li>If the literal is a <a>language-tagged string</a>,
then the literal value is a pair consisting of its <a>lexical form</a>
and its <a>language tag</a>, in that order.</li>
<li>if the literal is a <a>directional language-tagged string</a>, then the literal value is
a tuple of its <a>lexical form</a>, its <a>language tag</a>, and its <a>base direction</a>,
likewise in that order.</li>
<li>If the literal's <a>datatype IRI</a> is in the set of
<a>recognized datatype IRIs</a>, let <var>d</var> be the
<a>referent</a> of the datatype IRI.
<ol>
<li>If the literal's <a>lexical form</a> is in the <a>lexical space</a>
of <var>d</var>, then the literal value is the result of applying
the <a>lexical-to-value mapping</a> of <var>d</var> to the
<a>lexical form</a>.</li>
<li>Otherwise, the literal is ill-typed and no literal value can be
associated with the literal. Such a case produces a semantic
inconsistency but is not <em>syntactically</em> ill-formed.
Implementations MUST accept ill-typed literals and produce RDF
graphs from them. Implementations MAY produce warnings when
encountering ill-typed literals.</li>
</ol>
</li>
<li>If the literal's <a>datatype IRI</a> is <em>not</em> in the set of
<a>recognized datatype IRIs</a>, then the literal value is
not defined by this specification.</li>
</ol>
<p><dfn data-local-lt="term-equal">Literal term equality</dfn>:
Two literals are term-equal (the same <a>RDF literal</a>)
if and only if the two <a>lexical forms</a>,
the two <a>datatype IRIs</a>,
the two <a>language tags</a> (if any), and
the two <a>base directions</a> (if any) compare equal,
using <a data-cite="I18N-GLOSSARY#dfn-case-sensitive">case sensitive matching</a>
(see description of string comparison in <a href="#rdf-strings" class="sectionRef"></a>).
Thus, two literals can have the same value
without being the same <a>RDF term</a>.
For example:</p>
<pre>
"1"^^xs:integer
"01"^^xs:integer
</pre>
<p>denote the same <a data-lt="literal value">value</a>, but are not the
same literal <a>RDF terms</a> and are not
<a>term-equal</a> because their
<a>lexical forms</a> differ.</p>
<section id="section-text-direction" class="informative">
<h3>Initial Text Direction</h3>
<p>The <a>base direction</a> of a <a>directional language-tagged string</a>
provides a means of establishing the initial direction of text,
including text which is a mixture of right-to-left and left-to-right scripts.
The [[[?UAX9]]] [[?UAX9]] provides support for automatically rendering
a sequence of characters in logical order,
so that they are visually ordered as expected,
but this is not sufficient to correctly render bidirectional text.</p>
<p>For example, some text with a language tag "`he`" might be displayed
in a left-to-right context (such as an English web page) as
<bdi dir="ltr">פעילות הבינאום, W3C</bdi>, which is incorrect. When provided
to a user agent including base direction information (such as using
HTML's `dir` attribute) it can then be correctly presented as:
</p>
<div lang="he" dir="rtl">פעילות הבינאום, W3C</div>
</section>
</section>
<section id="section-blank-nodes">
<h2>Blank Nodes</h2>
<p><dfn data-lt="blank node">Blank nodes</dfn> are disjoint from
<a>IRIs</a> and <a>literals</a>. Otherwise,
the set of possible blank nodes is arbitrary. RDF makes no reference to
any internal structure of blank nodes.</p>
<div class="note" id="note-bnode-id">
<p><span id="dfn-blank-node-identifiers"><!-- obsolete term--></span><dfn data-lt="blank node identifier">Blank node identifiers</dfn>
are local identifiers that are used in some
<a>concrete RDF syntaxes</a>
or RDF store implementations.
They are always locally scoped to the file or RDF store,
and are <em>not</em> persistent or portable identifiers
for blank nodes. Blank node identifiers are <em>not</em>
part of the RDF abstract syntax, but are entirely dependent
on the concrete syntax or implementation. The syntactic restrictions
on blank node identifiers, if any, therefore also depend on
the concrete RDF syntax or implementation. Implementations that handle blank node
identifiers in concrete syntaxes need to be careful not to create the
same blank node from multiple occurrences of the same blank node identifier
except in situations where this is supported by the syntax.</p>
<p>The term "blank node label" is sometimes used informally
as an alternative to the term <a>blank node identifier</a>.
This alternative was also used in earlier versions of
some RDF-related specifications such as [[SPARQL11-QUERY]].
In the interest of consistency, the use of this alternative
term is discouraged now.</p>
</div>
</section>
<section id="section-skolemization">
<h3>Replacing Blank Nodes with IRIs</h3>
<p>Blank nodes do not have identifiers in the RDF abstract syntax. The
<a>blank node identifiers</a> introduced
by some concrete syntaxes have only
local scope and are purely an artifact of the serialization.</p>
<p>In situations where stronger identification is needed, systems MAY
systematically replace some or all of the blank nodes in an RDF graph
with <a>IRIs</a>. Systems wishing to do this SHOULD
mint a new, globally
unique IRI (a <dfn class="export">Skolem IRI</dfn>) for each blank node so replaced.</p>
<p>This transformation does not appreciably change the meaning of an
RDF graph, provided that the Skolem IRIs do not occur anywhere else.
It does however permit the possibility of other graphs
subsequently using the Skolem IRIs, which is not possible
for blank nodes.</p>
<p>Systems may wish to mint Skolem IRIs in such a way that they can
recognize the IRIs as having been introduced solely to replace blank
nodes. This allows a system to map IRIs back to blank nodes
if needed.</p>
<p>Systems that want Skolem IRIs to be recognizable outside of the system
boundaries SHOULD use a well-known IRI [[RFC8615]] with the registered
name <code>genid</code>. This is an IRI that uses the HTTP or HTTPS scheme,
or another scheme that has been specified to use well-known IRIs; and whose
path component starts with <code>/.well-known/genid/</code>.
<p>For example, the authority responsible for the domain
<code>example.com</code> could mint the following recognizable Skolem IRI:</p>
<pre>http://example.com/.well-known/genid/d26a2d0e98334696f4ad70a677abc1f6</pre>
<p class="note">RFC 8615 [[RFC8615]] only specifies well-known URIs,
not IRIs. For the purpose of this document, a well-known IRI is any
IRI that results in a well-known <a>URI</a> after IRI-to-URI mapping [[!RFC3987]].</p>
</section>
<section id="graph-isomorphism">
<h3>Graph Comparison</h3>
<p id="section-graph-equality">Two
<a>RDF graphs</a> <var>G</var> and <var>G'</var> are
<dfn data-lt="graph isomorphism|isomorphic" data-lt-noDefault class="export">isomorphic</dfn>
(that is, they have an identical form)
if there is a bijection <var>M</var> between the sets of nodes of the two
graphs, such that:</p>
<ol>
<li><var>M</var> maps blank nodes to blank nodes.</li>
<li><var>M(lit)=lit</var> for all <a>RDF literals</a> <var>lit</var> which
are nodes of <var>G</var>.</li>
<li><var>M(iri)=iri</var> for all <a>IRIs</a> <var>iri</var>
which are nodes of <var>G</var>.</li>
<li>The triple <var>( s, p, o )</var> is in <var>G</var> if and
only if the triple <var>( M(s), p, M(o) )</var> is in
<var>G'</var></li>
</ol>
<p>See also: <a>IRI equality</a>, <a>literal term equality</a>.</p>
<p>With this definition, <var>M</var> shows how each blank node
in <var>G</var> can be replaced with
a new blank node to give <var>G'</var>. Graph isomorphism
is needed to support the RDF Test Cases [[RDF11-TESTCASES]] specification.</p>
</section>
</section>
<section id="section-dataset">
<h2>RDF Datasets</h2>
<p>An <dfn>RDF dataset</dfn> is a collection of
<a>RDF graphs</a>, and comprises:</p>
<ul>
<li>Exactly one <dfn>default graph</dfn>, being an <a>RDF graph</a>.
The default graph does not have a name and MAY be empty.</li>
<li>Zero or more <span id="dfn-named-graphs"><!-- obsolete term--></span><dfn data-lt="named graph">named graphs</dfn>.
Each named graph is a pair consisting of an <a>IRI</a> or a blank node
(the <dfn>graph name</dfn>), and an <a>RDF graph</a>.
Graph names are unique within an RDF dataset.</li>
</ul>
<p><a>Blank nodes</a> can be shared between graphs
in an <a>RDF dataset</a>.</p>
<div class="note" id="note-datasets">
<p>Despite the use of the word “name” in “<a>named graph</a>”, the
<a>graph name</a> is not required to <a>denote</a> the graph. It is
merely syntactically paired with the graph. RDF does not place any
formal restrictions on what <a>resource</a> the graph name may denote,
nor on the relationship between that resource and the graph.
A discussion of different RDF dataset semantics can be found in
[[RDF11-DATASETS]].</p>
<p>Some <a>RDF dataset</a> implementations do not
track empty <a>named graphs</a>. Applications
can avoid interoperability issues by not ascribing importance to
the presence or absence of empty named graphs.</p>
<p>SPARQL 1.2 [[SPARQL12-CONCEPTS]] also defines the concept of an RDF
Dataset. The definition of an RDF Dataset in SPARQL 1.1 and this
specification differ slightly in that this specification allows RDF
Graphs to be identified using either an IRI or a blank node. SPARQL 1.1
Query Language only allows RDF Graphs to be identified using an IRI.
Existing SPARQL implementations might not allow blank nodes to be used
to identify RDF Graphs for some time, so their use can cause
interoperability problems.
<a href="#section-skolemization">Skolemizing</a> blank nodes used as
graph names can be used to overcome these interoperability problems.</p>
</div>
<section id="section-dataset-isomorphism">
<h3>RDF Dataset Comparison</h3>
<p id="section-dataset-equality">Two <a>RDF datasets</a>
(the RDF dataset <var>D1</var> with default graph <var>DG1</var> and any named
graph <var>NG1</var> and the RDF dataset <var>D2</var> with default graph
<var>DG2</var> and any named graph <var>NG2</var>)
are <dfn data-lt="dataset isomorphism" class="export">dataset-isomorphic</dfn> if and only if
there is a bijection <var>M</var> between the nodes, triples and graphs in
<var>D1</var> and those in <var>D2</var> such that:</p>
<ol>