diff --git a/spec/index.html b/spec/index.html index 01c935e..58d939c 100644 --- a/spec/index.html +++ b/spec/index.html @@ -909,13 +909,6 @@
http://www.w3.org/1999/02/22-rdf-syntax-ns#reifies
(rdf:reifies
)
as its predicate.
-
- The constituent terms (or simply constituents) - of a [=triple term=] or an [=RDF triple=] are its [=subject=], its [=predicate=], its [=object=], - and all the [=constituent terms=] of its [=object=] if it is itself a [=triple term=]. - By extension, the [=constituent terms=] of an [=RDF graph=] are all the constituent terms of its triples. -
-Encoding an [=RDF graph=] to ensure that it is consumable by an RDF [=Classic=] implementation is called classicizing it. - [=Classicizing=] consists of repeating the following steps until no [=constituent=] of the graph is a [=triple term=], and the graph is therefore compliant with RDF [=Classic=]: picking a [=triple term=] tt that is a [=constituent terms=] of the graph; minting a fresh [=blank node=] b - (i.e., a blank node not yet in use in the graph); replacing tt with b in all the triples of the graph having tt in their [=constituents=]; + [=Classicizing=] consists of repeating the following steps until no [=triple term=] [=appears=] in the graph, and the graph is therefore compliant with RDF [=Classic=]: picking a [=triple term=] tt that [=appears=] in the graph; minting a fresh [=blank node=] b + (i.e., a blank node not yet in use in the graph); replacing all occurrences of tt [=appearing=] in the graph with b; and then adding the following triples to the graph (where s, p, and o are respectively the [=subject=], [=predicate=] and [=object=] of tt):
Note that this transformation is information preserving only when the input graph either has no [=triple term=] in its [=constituents=], +
Note that this transformation is information preserving only when the input graph either has no [=triple term=] [=appearing=] in it, or contains no [=asserted=] triple (b, `rdf:type`, `rdf:TripleTerm`) where b is a [=blank node=]. Implementations encountering this situation MUST report an error. This limitation is discussed in Section . @@ -1607,15 +1600,14 @@
Reverting a [=classicized=] graph to its original form consists of locating each [=asserted=] triple (b, `rdf:type`, `rdf:TripleTerm`) - that has a [=blank node=] b as its subject, - along with the three associated [=asserted=] triples + that has a [=blank node=] b as its subject, + along with the three associated [=asserted=] triples that have the same [=blank node=] b as their subjects, i.e., (b, `rdf:ttSubject`, s), (b, `rdf:ttPredicate`, p), and (b, `rdf:ttObject`, o); removing these four triples from the graph; - and replacing all remaining occurrences of b - as a [=constituent term=] of the graph + and replacing all remaining occurrences of b [=appearing=] in the graph with the triple term (s, p, o).
@@ -1626,7 +1618,7 @@The two transformations above explicitly do not support graphs or datasets containing at the same time a [=triple term=] and an [=asserted triple=] - (b, `rdf:type`, `rdf:TripleTerm`) + (b, `rdf:type`, `rdf:TripleTerm`) where b is a [=blank node=]. This means that the [=classicize=] transformation is not strictly universal.