From 8b344fa07d873c71a415bbd93fbb839ed9ddf95f Mon Sep 17 00:00:00 2001 From: Andy Seaborne Date: Sun, 19 Jan 2025 22:04:20 +0000 Subject: [PATCH] GH-134: Move Graph Comparison section to after 3.5 Triple Terms --- spec/index.html | 71 +++++++++++++++++++++++-------------------------- 1 file changed, 33 insertions(+), 38 deletions(-) diff --git a/spec/index.html b/spec/index.html index 485f942..004185e 100644 --- a/spec/index.html +++ b/spec/index.html @@ -879,6 +879,39 @@

Triple Terms

as its predicate.

+
+

Graph Comparison

+ +

Two + RDF graphs G and G' are + isomorphic + (that is, they have an identical form) + if there is a bijection M + from the set of all RDF terms into that same set, + such that all of the following properties hold:

+ + + +

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 + is needed to support the RDF Test Cases [[RDF11-TESTCASES]] specification.

+ +
+

Initial Text Direction

@@ -953,44 +986,6 @@

Replacing Blank Nodes with IRIs

IRI that results in a well-known URI after IRI-to-URI mapping [[!RFC3987]].

-
-

Graph Comparison

- -

Two - RDF graphs G and G' are - isomorphic - (that is, they have an identical form) - if there is a bijection M - from the set of all RDF terms into that same set, - such that all of the following properties hold:

- - - -

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 - is needed to support the RDF Test Cases [[RDF11-TESTCASES]] specification.

- -
- Graph isomorphism needs the following extra clause: -
    -
  • M(tt) is the triple term ( M(s), M(p), M(o) ) for tt a triple term of the form (s, p, o)
  • -
-
-