We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent ab8c439 commit 41ae00dCopy full SHA for 41ae00d
spec/index.html
@@ -321,8 +321,8 @@ <h3>Triple Terms and Reification</h3>
321
statements to be made about other statements that may not be
322
asserted within an <a>RDF graph</a>.
323
This allows statements to be made about relationships that may be contradictory.
324
- For a <a>triple term</a> to be asserted,
325
- it must also appear in a graph as an <a>asserted triple</a>.</p>
+ For a <a>triple term</a> to be asserted in a graph,
+ it must appear as an <a>asserted triple</a> in that same graph.</p>
326
327
<p>RDF terms that appear in a triple term have the same denotation as when they appear in an asserted triple in the graph.
328
For this reason, we say that triple terms are <i>transparent</i>.</p>
0 commit comments