diff --git a/spec/index.html b/spec/index.html index ee4d284b..545c3aaa 100644 --- a/spec/index.html +++ b/spec/index.html @@ -149,14 +149,47 @@

Graph-based Abstract Data Model

-
An RDF graph with two nodes (Subject and Object) and an arc (Predicate) connecting them
+
An RDF graph with two nodes (Subject and Object) and an arc (Predicate) connecting them.
-

There can be four kinds of nodes in an +

There are four kinds of nodes that can be in an RDF graph: IRIs, literals, blank nodes, and triple terms.

- + +

From this definition, it follows that when one term appears in multiple + triples, these are simply multiple occurrences of that same term. For + example, in a graph containing two triples (here expressed in common + set and + tuple notation, and + using abstract names as distinct terms):

+
+    { (R1, P1, R3),
+      (R2, P2, R3) }
+    
+

the term R3 is the same single term used twice, and there are five terms + in total. This is more readily shown in two-dimensional graph diagrams, + where one single node can simply be connected from or to multiple other + nodes using labelled arcs.

+
+ + + +
An RDF graph with three nodes (R1, R2, and R3) and two arcs (P1 and P2), the arcs respectively connecting R1 and R2 to R3.
+
+ +

This abstract data model can be encoded in different ways while + preserving the same stucture, as described in [[[#rdf-documents]]].

+ +
@@ -255,7 +288,8 @@

The Referent of an IRI

unique identifiers in a graph data model that describes resources. However, those interactions are critical to the concept of [[[LINKED-DATA]]], [[LINKED-DATA]], - which uses the RDF abstract syntax and serialization formats.

+ which uses the RDF abstract syntax and concrete RDF syntaxes, + the latter also referred to as serialization formats.

@@ -536,6 +570,70 @@

RDF Documents and Syntaxes

and different ordering of triples. While these aspects can have great effect on the convenience of working with the RDF document, they are not significant for its meaning.

+ +

The basis for concrete RDF syntaxes is the structure of the + abstract data model, + called the abstract syntax; + summarized in the following two tables.

+ + + + + + + + + + + + + + + + + + + + + + + + + + +
The abstract syntax of RDF graphs
ProductionDefined as
RDF grapha set of zero or more triples
triplea 3-tuple of + a subject, a predicate, and an object
subjecteither an IRI + or a Blank node
predicatean IRI
objecteither an IRI + or a Blank node + or a Literal + or a triple
+
+ + + + + + + + + + + + + + + + + + + + + + +
The abstract syntax of RDF datasets
ProductionDefined as
RDF dataseta pair of a default graph + and a set of zero or more named graphs
default graphan RDF graph
named grapha pair of + a graph name and an RDF graph
graph nameeither an IRI + or a Blank node
@@ -847,8 +945,7 @@

IRIs

is a string that conforms to the syntax defined in RFC 3987 [[!RFC3987]].

-

An IRI in the RDF abstract syntax - +

An IRI in the RDF abstract syntax MUST be resolved per [[RFC3986]] and MUST NOT be a relative reference. An IRI MAY contain a fragment identifier. @@ -1006,10 +1103,10 @@

Literals

Representation of Literals

-

Some concrete syntaxes MAY support +

Some concrete syntaxes support simple literals consisting of only a lexical form without any datatype IRI, language tag, or base direction. - Simple literals are syntactic sugar for abstract syntax + Simple literals are syntactic sugar for abstract syntax literals with the datatype IRI http://www.w3.org/2001/XMLSchema#string diff --git a/spec/rdf-graph-arcs.svg b/spec/rdf-graph-arcs.svg new file mode 100644 index 00000000..144a906b --- /dev/null +++ b/spec/rdf-graph-arcs.svg @@ -0,0 +1,35 @@ + + + + + + + + + + + + + + R1 + + + P1 + + + + + R2 + + + P2 + + + + + R3 + + + + diff --git a/spec/rdf-graph.svg b/spec/rdf-graph.svg index 9d6f00eb..089bfd78 100644 --- a/spec/rdf-graph.svg +++ b/spec/rdf-graph.svg @@ -1,4 +1,4 @@ - +