diff --git a/spec/index.html b/spec/index.html index 9b380fa..df2eb5f 100644 --- a/spec/index.html +++ b/spec/index.html @@ -577,6 +577,16 @@

Triples

The three components (|s|, |p|, |o|) of an [=RDF triple=] are respectively called the subject, predicate and object of the triple.

+

Triple equality: + Two triples (|s|, |p|, |o|) and (s', p', o') + are equal (the same [=RDF triple=]) if and only if all of the following three conditions hold.

+ + +

The definition of triple is recursive. That is, a triple can itself have an @@ -599,6 +609,17 @@

RDF Terms

nor to a blank node with the blank node identifier http://example.org/.

+

RDF term equality: + Two [=RDF terms=] |t| and t' are equal (the same [=RDF term=]) if and only if + one of the following four conditions holds:

+ + +

The set of nodes of an RDF graph is the set of subjects and objects of the asserted triples of the graph. It is possible for a [=predicate=] [=IRI=] to also occur as a [=node=] in @@ -848,6 +869,9 @@

Blank Nodes

the set of possible blank nodes is arbitrary. RDF makes no reference to any internal structure of blank nodes.

+

Blank node equality: + Two blank nodes are equal if and only if they are the same blank node.

+

Blank node identifiers are local identifiers that are used in some @@ -889,6 +913,9 @@

Triple Terms

By extension, an [=RDF term=] is said to [=appear=] in an [=RDF graph=] if it appears in an [=asserted triple=] of that graph. An [=RDF triple=] is said to [=appear=] in an [=RDF graph=] if it is either an [=asserted triple=] of that graph or a [=triple term=] [=appearing=] in that graph.

+

Triple term equality: + Since triple terms are [=triples=], equality of triple terms is the same as [=triple equality=].

+

Every triple with a triple term as its [=object=] SHOULD use http://www.w3.org/1999/02/22-rdf-syntax-ns#reifies (rdf:reifies) as its predicate. @@ -913,8 +940,8 @@

Graph Comparison

@@ -925,8 +952,6 @@

Graph Comparison

the triple (|s|, |p|, |o|) is in |G| if and only if the triple ( |M|(|s|), |M|(|p|), |M|(|o|) ) is in G'.

-

See also: IRI equality, literal term equality.

-

With this definition, M shows how each blank node in G can be replaced with a new blank node to give G'. Graph isomorphism @@ -1064,9 +1089,13 @@

RDF Dataset Comparison

the triple ( |M|(|s|), |M|(|p|), |M|(|o|) ) is in |DG2|.
  • The [=named graph=] (|n|, |G|) is in |NG1| if and only if there is a [=named graph=] (n', G') in |NG2| such that - |M|(|n|) = n' and - the triple (|s|, |p|, |o|) is in |G| if and only if - the triple ( |M|(|s|), |M|(|p|), |M|(|o|) ) is in G'.
  • + the following are true: + + @@ -1989,11 +2018,12 @@

    Changes between RDF 1.1 and RDF 1.2

    Implementations can either follow the advice to normalize to lower case, use the recommended BCP47 format, or do something else, as long it is performed consistently. +
  • Added explicit definitions of [=blank node equality=], [=RDF term equality=], and [=triple equality=].
  • Removed the section on the canonical mapping for the rdf:XMLLiteral datatype.
  • Refer to the definition and discussion of RDF Semantics, "recognizing" datatype IRIs, instead of Recognized datatype IRIs.
  • -
  • The informal terminolgy "RDF processor" has been removed.
  • +
  • The informal terminology "RDF processor" has been removed.
  • A detailed overview of the differences between RDF versions 1.1