Emphasized the Best Practice Recipes for Publishing RDF Vocabularies and added a more detailed note explaining the reasons for publishing in the formats given.
authorHenry Story <henry.story@bblfish.net>
Tue, 10 Jan 2012 12:28:29 +0100
changeset 274 6f80a7114ec6
parent 270 dc8abb0de027
child 275 f8cf29b49aaf
Emphasized the Best Practice Recipes for Publishing RDF Vocabularies and added a more detailed note explaining the reasons for publishing in the formats given.
spec/index-respec.html
--- a/spec/index-respec.html	Mon Jan 09 21:51:16 2012 +0100
+++ b/spec/index-respec.html	Tue Jan 10 12:28:29 2012 +0100
@@ -614,13 +614,16 @@
 The set of relations to be published at the <tref>WebID Profile</tref> document can be presented in a graphical notation as follows.</p>
 <img alt="Web ID graph" width="90%" src="img/WebIdGraph.jpg"/>
 <p>The document can publish many more relations than are of interest to the WebID protocol, as shown in the above graph by the grayed out relations. 
-For example Bob can publish a depiction or logo, so that sites he authenticates to can personalise the user experience. He can post links to people he knows, where those are have WebIDs published on other sites, in order to create a distributed Social Web. 
+For example Bob can publish a depiction or logo, so that sites he authenticates to can personalise the user experience. He can post links to people he knows, where those have WebIDs published on other sites, in order to create a distributed Social Web. 
 He can also publish relations to protected documents, where he keeps more information for people who authenticate, such as his friend Alois or his friends friends who may not yet know him personally, such as Alice.</p>
 <p>
 The protocol does not depend on any particular serialisation of the graph, provided that agents are able to parse that serialisation 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.
-Yet for reasons of interoperability the document MUST be published at least one of RDFa [XHTML-RDFA] or TURTLE [[!TURTLE]]. 
-HTTP Content Negotiation [[!SWBP-VOCAB-PUB]] can be employed to aid in publication and discovery of multiple distinct serialisations of the same graph at the same URL. </p>
+HTTP Content Negotiation can be employed to aid in publication and discovery of multiple distinct serialisations 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 class="note">
+For reasons of interoperability, in order not to overburden the implementation and testing work of <tref>WebID Verifier</tref>s, and in order to provide a seamless experience for end users, of the many formats that can be publish at one location, it is established that at present publishers  SHOULD  publish their documents in at least one of RDFa [[!XHTML-RDFA]] or TURTLE [[!TURTLE]] as these MUST be understood by <tref>Verification Agent</tref>s. 
+If other formats grow in popularity, are implemented by verifiers, and gain community acceptance, these can be added to the list.
+</p>
 <p>
 Irrespective of whether content negotiation can or cannot be employed, if an HTML representation of the WebID profile is published, it is suggested that the provider uses the HTML <code>&lt;link&gt;</code> element to allow discovery of the various alternate representations of the graph which may be available:
 </p>