| <http://www.w3.org/2000/01/rdf-schema#comment> |
A set of RDF statements, typically comprising a concise bounded description of a resource.
A concise bounded description can be expressed in terms of an RDF graph as follows:
Given a URI denoting some resource, a concise bounded description of that resource
is a set of RDF statements, explicitly asserted and/or inferred, comprised of the
following:
1. All statements where the subject of the statement denotes the resource in
question; and,
2. Recursively, for all statements included in the description thus far, for
all anonymous node objects, all statements where the subject of the statement
denotes anonymous resource in question; and,
3. Recursively, for all statements included in the description thus far, for all
reifications of each statement, the concise bounded description of each
reification.
This results in an RDF graph where the terminal nodes are either URIrefs, literals,
or anonymous nodes not serving as the subject of any statement, insofar as the
describing agent is aware; effectively constraining the description to only those
statements made explicitly about the resource in question or about other directly
related anonymous resources, and any associated reifications.
<http://www.w3.org/2001/XMLSchema#string>
|
|
