--- a/spec/identity-respec.html Thu May 16 10:18:42 2013 +0200
+++ b/spec/identity-respec.html Fri Jun 14 10:10:38 2013 +0200
@@ -62,7 +62,7 @@
berjon.biblio["SWBP-VOCAB-PU"] = "Diego Berrueta, Jon Phipps <a href='http://www.w3.org/TR/swbp-vocab-pub/'><cite>Best Practice Recipes for Publishing RDF Vocabularies</cite></a> W3C Working Group Note 28 August 2008";
berjon.biblio["TURTLE-TR"] = "David Beckett, Tim Berners-Lee. <a href='http://www.w3.org/TR/turtle/'><cite>Turtle: Terse RDF Triple Language.</cite></a> W3C Working Draft 09 August 2011 URL: <a href='http://www.w3.org/TR/turtle/'>http://www.w3.org/TR/turtle/</a> ";
berjon.biblio["FOAF"] = "Dan Brickley, Libby Miller. <a href='http://xmlns.com/foaf/0.1/'><cite>FOAF: Vocabulary Specification 0.98.</cite></a>";
- berjon.biblio["RFC5988"] = "M. Nottingham. <a href=\"http://tools.ietf.org/html/rfc5988\"><cite>Web Linking</cite></a> October 2010. Internet RFC 5988. URL: <a href=\"http://tools.ietf.org/html/rfc5988\">http://tools.ietf.org/html/rfc5988</a> ";
+ berjon.biblio["RDF-XML"] = "Beckett D. (Editor), W3C Recommendation, 10 February 2004. <a href='http://www.w3.org/TR/rdf-syntax-grammar/'><cite>RDF/XML Syntax Specification (Revised)</cite></a>";
// process the document before anything else is done
var refs = document.querySelectorAll('adef') ;
for (var i = 0; i < refs.length; i++) {
@@ -354,7 +354,7 @@
<p>
A WebID is an HTTP URI which refers to an Agent (Person, Organization, Group, Device, etc.). A description of the WebID can be found in the <tref>Profile Document</tref>, a type of web page that any Social Network user is familiar with.</p>
<p>
-A WebID <tref>Profile Document</tref> is a Web resource that MUST be available as Turtle [[!TURTLE-TR]], but MAY be available in other RDF serialization formats (e.g. [[!RDFA-CORE]]) if requested through content negotiation.
+A WebID <tref>Profile Document</tref> is a Web resource that MUST be available as <code>text/turtle</code> [[!TURTLE-TR]], but MAY be available in other RDF serialization formats (e.g. [[!RDFA-CORE]]) if requested through content negotiation.
</p>
<p>
WebIDs can be used to build a Web of trust using vocabularies such as FOAF [[!FOAF]] by allowing people to link together their profiles in a public or protected manner.
@@ -392,9 +392,7 @@
<dt><tdef>WebID Profile</tdef> or <tdef>Profile Document</tdef></dt>
<dd>
-A WebID Profile is an RDF document which MUST uniquely describe the Agent denoted by the WebID in relation to that WebID. This document MUST be available as Turtle [[!TURTLE-TR]]. This document MAY be available in other RDF serialization formats, such as RDFa [[!RDFA-CORE]], or RDF-XML [[!RFC5988]] if so requested through content negotiation.
-
-Any other serializations MUST be transformable automatically and in a standard manner to an RDF Graph, using technologies such as GRDDL [[!GRDDL-PRIMER]].
+A WebID Profile is an RDF document which uniquely describes the Agent denoted by the WebID in relation to that WebID. The server MUST provide a <code>text/turtle</code> [[!TURTLE-TR]] representation of the requested profile. This document MAY be available in other RDF serialization formats, such as RDFa [[!RDFA-CORE]], or [[!RDF-XML]] if so requested through content negotiation.
</dd>
</dl>
@@ -450,7 +448,6 @@
<p>
WebID requires that servers MUST at least be able to provide Turtle representation of profile documents, but other serialization formats of the graph are allowed, provided that agents are able to parse that serialization and obtain the graph automatically.
-Technologies such as GRDDL [[!GRDDL-PRIMER]] for example permit any XML format to be transformed automatically to a graph of relations.
HTTP Content Negotiation can be employed to aid in publication and discovery of multiple distinct serializations of the same graph at the same URL, as explained by the working group note <a href="http://www.w3.org/TR/2008/NOTE-swbp-vocab-pub-20080828/">Best Practice Recipes for Publishing RDF Vocabularies</a> [[!SWBP-VOCAB-PUB]]</p>
<p>It is particularly useful to have one of the representations be in HTML