--- a/glossary/index.html Tue Mar 19 17:25:08 2013 -0400
+++ b/glossary/index.html Wed Mar 20 10:31:41 2013 +0100
@@ -130,7 +130,7 @@
<section >
<h4>Data Hub, The</h4>
-<a href="http://thedatahub.org/" target="_blank">The Data Hub</a> is a specific site offering a community-run catalogue of data sets of data on the Internet, powered by the open-source data portal platform CKAN. href="http://thedatahub.org/" target="_blank">The Data Hub</a> is an openly editable open data catalogue in the style of Wikipedia.
+<a href="http://thedatahub.org/" target="_blank">The Data Hub</a> is a specific site offering a community-run catalogue of data sets of data on the Internet, powered by the open-source data portal platform CKAN. <a href="http://thedatahub.org/" target="_blank">The Data Hub</a> is an openly editable open data catalogue in the style of Wikipedia.
</section >
<section>
@@ -171,7 +171,7 @@
<section>
<h4>DCMI</h4>
-See <a href="#dublin-core-metadata-initiative">Dublin Core Metdata Initiative</a>
+See <a href="#dublin-core-metadata-initiative">Dublin Core Metadata Initiative</a>
</section>
<section>
@@ -220,6 +220,13 @@
</section>
<section>
+<h4>Hash URI Pattern</h4>
+<p class='todo'>To Discuss and adopt by the Group (cf. Dave proposition)</p>
+In creating and publishing Linked Data a key design decision is the pattern of URIs to use for the resources in the data. One aspect of that decision is whether to use "hash" URIs (URIs which end in a '#fragid' fragment identifier) or "slash" URIs (no fragment identifier). Hash URIs offer a simple way to separate the URI for the thing from the URL for a data document describing the thing. They are convenient when publishing small files
+of resources (e.g. small vocabularies) but limit implementation options and extensibility (because the fragment identifier is never seen by the data server). See also [<a href="#slash-uri-pattern">Slash URI Pattern</a>]
+</section>
+
+<section>
<h4>HyperText Markup Language (HTML)</h4>
HyperText Markup Language (HTML) is the predominant markup language for hypertext pages on the Web. HTML defines the structure of Web pages and it is a family of W3C standards.
</section>
@@ -241,12 +248,12 @@
<section>
<h4>Internet Engineering Task Force (IETF)</h4>
- Internet Engineering Task Force (IETF) is an open international community concerned with the evolution of Internet architecture and the operation of the Internet. It had defined standards such as HTTP and DNS.
+ Internet Engineering Task Force (IETF) is an open international community concerned with the evolution of Internet architecture and the operation of the Internet. It has defined standards such as HTTP and DNS.
</section>
<section>
<h4>Inference</h4>
-To infer something is to create a new relationship. Using Linked Data, existing relationships are modeled as a set of (named) relationships between resources. Linked Data helps humans and machines to find new relationships through automatic procedures that generate new relationships based on the data and based on some additional information in the form of a vocabulary.
+Inference is the process of deriving logical conclusions from a set of starting assumptions. Using Linked Data, existing relationships are modeled as a set of (named) relationships between resources. Linked Data helps humans and machines to find new relationships through automatic procedures that generate new relationships based on the data and based on some additional information in the form of a vocabulary.
</section>
<section>
@@ -266,7 +273,8 @@
<section>
<h4>Linked Data</h4>
-Linked data refers to a set of best practices for creating, publishing and announcing structured data on the Web. Linked Data is intended for access by both humans and machines. Linked Data is <b>not</b> the same as <a href="rdf">RDF</a>, rather Linked Data uses the RDF family of standards (e.g., RDF/XML, N3, Turtle and N-Triples) to represent and query data. Linked Data can be published by an person or organization behind the firewall or on the public Web. If Linked Data is published on the public Web, it is generally called <em><a href="#linked-open-data">Linked Open Data</a></em>.
+Linked data refers to a set of best practices for creating, publishing and announcing structured data on the Web. See [<a href="#linked-data-principles">Linked Data Principles</a>] Linked Data is intended for access by both humans and machines. Linked Data is <b>not</b> the same as <a href="rdf">RDF</a>, rather Linked Data uses the RDF family of standards for data interchange ( RDF/XML, N3, Turtle and N-Triples) and query (SPARQL). Linked Data can be published by an person or organization behind the firewall or on the public Web. If Linked Data is published on the public Web, it is generally called <em><a href="#linked-open-data">Linked Open Data</a></em>.
+
</section>
<section>
@@ -293,7 +301,7 @@
<section>
<h4>Linked Open Data Cloud</h4>
-The Linked Data Cloud represents datasets that have been published as Linked Data on the public Web. See also: <a href="#data-cloud">Data Cloud</a>, <a href="#linked-open-data-cloud-diagram">Linked Open Data Cloud diagram</a>
+The Linked Data Cloud represents <b>interconnected</b> datasets that have been published as Linked Data on the public Web. See also: <a href="#data-cloud">Data Cloud</a>, <a href="#linked-open-data-cloud-diagram">Linked Open Data Cloud diagram</a>
</section>
<section>
@@ -306,7 +314,8 @@
Linking government data refers to the use of tools and techniques of the Semantic Web to connect, expose and use data from government systems.
</section>
-<section>Linking Open Data Project</h4>
+<section>
+<h4>Linking Open Data Project</h4>
The Linking Open Data project is a community activity started in 2007 by the W3C's <a href="http://www.w3.org/wiki/SweoIG/TaskForces/CommunityProjects/LinkingOpenData" target="_blank">Semantic Web Education and Outreach (SWEO) Interest Group</a>. The project's stated goal is to "make data freely available to everyone".
</section>
@@ -359,6 +368,7 @@
<section>
<h4 >Ontology</h4>
Ontology is a formal representation of relationships between items or concepts in a directed graph structure. An ontology defines the <a href="#predicate">predicates</a> themselves, but also defines the data type of each predicate and the relationship, if any, of one predicate to another. RDF/XML and Web Ontology Language (OWL) are popular markup languages for ontologies. See also [<a href="#taxonomy">taxonomy</a>].
+
</section>
<section>
@@ -374,7 +384,7 @@
<section>
<h4>Open World</h4>
- Open world is a concept from Artificial Intelligence (AI) and refers to a model of uncertainty that an agent assumes about the external work. In an open world, the agent presumes that what is not known to be true may yet be true if additional information is later obtained. It is the assumption underlying RDF and OWL Full, and often opposed to <a href="#closed-world">"Closed World".</a>
+ Open world is a concept from Artificial Intelligence (AI) and refers to a model of uncertainty that an agent assumes about the external world. In an open world, the agent presumes that what is not known to be true may yet be true if additional information is later obtained. It is the assumption underlying RDF and OWL Full, and often opposed to <a href="#closed-world">"Closed World".</a>
</section>
<section>
@@ -384,7 +394,7 @@
<section>
<h4>Persistent Identifier Scheme</h4>
-A persistent identifier scheme is a mechanmism for resolution of virtual resources. <a href="http://en.wikipedia.org/wiki/Persistent_uniform_resource_locator">Persistent Uniform Resource Locator (PURLs)</a> implement one form of persistent identifier for virtual resources. PURLs are valid URLs and their components must map to the URL specification. The scheme part tells a computer program, such as a Web browser, which protocol to use when resolving the address. The scheme used for PURLs is generally HTTP. Other persistent identifier schemes include <a href="http://en.wikipedia.org/wiki/Digital_object_identifier" target="_blank">Digital Object Identifiers (DOIs)</a>, <a href="http://en.wikipedia.org/wiki/LSID" target="_blank">Life Sciences Identifiers (LSIDs)</a> and <a href="http://en.wikipedia.org/wiki/Info:" target="_blank">INFO URIs</a>. All persistent identification schemes provide unique identifiers for (possibly changing) virtual resources, but not all schemes provide curation opportunities.
+A persistent identifier scheme is a mechanmism for resolution of virtual resources. <a href="#persistent-uniform-resource-locator">Persistent Uniform Resource Locator (PURLs)</a> implement one form of persistent identifier for virtual resources. PURLs are valid URLs and their components must map to the URL specification. The scheme part tells a computer program, such as a Web browser, which protocol to use when resolving the address. The scheme used for PURLs is generally HTTP. Other persistent identifier schemes include <a href="http://en.wikipedia.org/wiki/Digital_object_identifier" target="_blank">Digital Object Identifiers (DOIs)</a>, <a href="http://en.wikipedia.org/wiki/LSID" target="_blank">Life Sciences Identifiers (LSIDs)</a> and <a href="http://en.wikipedia.org/wiki/Info:" target="_blank">INFO URIs</a>. All persistent identification schemes provide unique identifiers for (possibly changing) virtual resources, but not all schemes provide curation opportunities.
</section>
<section>
@@ -394,7 +404,7 @@
<section>
<h4>Predicate</h4>
-The predicate is the second part of an <a href="#rdf">RDF</a> statement and defines the property for the subject of the statement. In the context of RDF, a predicate modifies the <a href="#subject">Subject</a> of an <a href="#rdf">RDF</a> Statement. Predicate refers to a piece of knowledge expressed formally in the field of AI. Inspired from work in predicate calculus, (also called predicate logic, first order logic), the predicate of a sentence can be thought of as the verb.
+The predicate is the second part of an <a href="#rdf">RDF</a> statement and gives the property which connects the subject of the statement to the object of the statement. Thus in the informal statement <em>"Alice knows Bob"</em> then <em>"knows"</em> is the predicate which connects "Alice" (the subject of the statement) to "Bob" (the object of the statement). The term predicate derives from predicate calculus. In RDF we use the terms predicate (for the role) and property (for the thing that plays that role) regardless of whether the value of the property is a simple literal or some other resource.
</section>
<section>
@@ -414,7 +424,7 @@
<section>
<h4>Quad Store</h4>
-Quad Store is a colloquial phrase for an RDF database that stores RDF triples plus an additional element of information, often used to collect statements into groups.
+Quad Store is a colloquial phrase for an RDF database that stores RDF triples plus an additional element of information, often used to collect statements into groups. This notion has been clarified and standardized in <a href="#sparql">SPARQL</a> in the form of <b>RDF Datasets</b>
</section>
<section>
@@ -449,7 +459,7 @@
<section>
<h4>Resource Description Framework</h4>
-Resource Description Framework (RDF), is a general-purpose language for representing information in the Web. RDF provides a common model for Linked Data and is well suited for the representation of data on the Web. RDF is <b>not</b> a data format, rather a model for expressing relationships between arbitrary data elements that may be represented in a variety of standard formats. RDF is based on the idea of identifying things using Web identifiers or <a href="#uris>HTTP URIs</a>, and describing resources in terms of simple properties and property values. A single RDF statement describes two things and a relationship between them. This enables RDF to represent simple statements about resources as a graph of nodes and arcs representing the resources, and their properties and values. Linked Data developers call the three elements in an RDF statement the <em>subject</em>, the <em>predicate</em> and the <em>object</em>. See also [<h ref="http://www.w3.org/TR/rdf-concepts/">Resource Description Framework (RDF): Concepts and Abstract Syntax</a>
+Resource Description Framework (RDF), is a general-purpose language for representing information in the Web. RDF provides a common model for Linked Data and is well suited for the representation of data on the Web. RDF is <b>not</b> a data format, rather a model for expressing relationships between arbitrary data elements that may be represented in a variety of standard formats. RDF is based on the idea of identifying things using Web identifiers or <a href="#uris>HTTP URIs"</a>, and describing resources in terms of simple properties and property values. A single RDF statement describes two things and a relationship between them. This enables RDF to represent simple statements about resources as a graph of nodes and arcs representing the resources, and their properties and values. Linked Data developers call the three elements in an RDF statement the <em>subject</em>, the <em>predicate</em> and the <em>object</em>. See also [<h ref="http://www.w3.org/TR/rdf-concepts/">Resource Description Framework (RDF): Concepts and Abstract Syntax</a>
</section>
<section>
@@ -462,8 +472,10 @@
</section>
<section>
+
<h4>RDF-JSON</h4>
-A concrete syntax in JavaScript Object Notation (JSON) ([[RFC4627]]) for RDF as defined in the RDF Concepts and Abstract Syntax ([[!RDF-CONCEPTS]]) W3C Recommendation. An RDF-JSON document serializes such a set of RDF triples as a series of nested data structures. See also [<a href="https://dvcs.w3.org/hg/rdf/raw-file/default/rdf-json/index.html"> RDF 1.1 JSON Serialization W3C Recommendation</a>]
+<p class='todo'>To vote: Remove this item (cf. Dave suggestion)</p>
+A concrete syntax in JavaScript Object Notation (JSON) ([[RFC4627]]) for RDF as defined in the RDF Concepts and Abstract Syntax ([[!RDF-CONCEPTS]]) W3C Recommendation. An RDF-JSON document serializes such a set of RDF triples as a series of nested data structures. See also [<a href="https://dvcs.w3.org/hg/rdf/raw-file/default/rdf-json/index.html"> RDF 1.1 JSON Serialization document draft</a>]
</section>
<section>
@@ -473,7 +485,7 @@
<section>
<h4>Request</h4>
-A request message from a client to a server includes, within the first line of that message, the method to be applied to the resource, the identifier of the resource, and the protocol version in use. See also RFC 2616bis for an<a ref="http://www.w3.org/Protocols/HTTP/1.1/rfc2616bis/draft-lafon-rfc2616bis-03.html#request" target="blank">HTTP Request</a>.
+A request message from a client to a server includes, within the first line of that message, the method to be applied to the resource, the identifier of the resource, and the protocol version in use. See also <a href="http://www.w3.org/Protocols/HTTP/1.1/rfc2616bis/draft-lafon-rfc2616bis-03.html#request" target="blank">RFC 2616bis</a> for an HTTP Request.
</section>
<section>
@@ -498,7 +510,7 @@
<section>
<h4>Schema</h4>
- A data model that represents the relationships between a set of concepts. Some types of schemas include relational database schemas (which define how data is stored and retrieved), taxonomies and ontologies.
+ A data model that represents the relationships between a set of concepts Some types of schemas include relational database schemas (which define how data is stored and retrieved), taxonomies and ontologies.
</section>
<section>
@@ -518,7 +530,7 @@
<section>
<h4>Semantic Web Standards</h4>
- Standards of the World Wide Web Consortium (W3C) relating to the Semantic Web, including RDF [[!RDF]], RDFa [[!RDFa-PRIMER]], SKOS [[!SKOS-REFERENCE]] and OWL [[!OWL2]].
+ Standards of the World Wide Web Consortium (W3C) relating to the Semantic Web, including RDF [[!RDF]], RDFa [[!RDFa-PRIMER]], SKOS [[!SKOS-REFERENCE]], OWL [[!OWL2]] and SPARQL [[!SPARQL]].
</section>
<section>
@@ -542,8 +554,14 @@
</section>
<section>
+<h4>Slash URI Pattern</h4>
+<p class='todo'>To vote by the Group (cf. Dave proposal)</p>
+In creating and publishing Linked Data a key design decision is the pattern of URIs to use for the resources in the data. One aspect of that decision is whether to use "hash" URIs (URIs which end in a '#fragid' fragment identifier) or "slash" URIs (no fragment identifier). Slash URIs provide maximum flexibility since the data server will see the full URI when it is dereferenced.
+</section>
+
+<section>
<h4>SPARQL</h4>
-Simple Protocol and RDF Query Language (SPARQL) defines a standard query language and data access protocol for use with the RDF [[!SPARQL]]. Just as SQL is used to query relational data, SPARQL is used to query an RDF database. SPARQL 1.1 [[!SPARQL-1.1]] specification allows more set of operations and queries on a RDF graph content on the Web or in a RDF store.
+Simple Protocol and RDF Query Language (SPARQL) defines a standard query language and data access protocol for use with the RDF [[!SPARQL]]. Just as SQL is used to query relational data, SPARQL is used to query an RDF database. SPARQL 1.1 [[!SPARQL-11]] specification allows more set of operations and queries on a RDF graph content on the Web or in a RDF store.
</section>
<section>
@@ -578,7 +596,7 @@
<section >
<h4>Triple</h4>
- A triple refers to a <a href="#rdf">RDF</a> statement, consisting of two things (a "Subject" and an "Object") and a relationship between them (a verb, or "Predicate"). This subject-predicate-object triple forms the smallest possible RDF graph (although most RDF graphs consist of many statements).
+ A triple refers to a <a href="#rdf">RDF</a> statement, consisting of two things (a "Subject" and an "Object") and a relationship between them ("Predicate"). This subject-predicate-object triple forms the smallest possible RDF graph (although most RDF graphs consist of many statements).
</section >
<section >
@@ -593,7 +611,7 @@
<section >
<h4>Turtle</h4>
-Turtle is an RDF serialization format designed to be easier to read than others such as RDF/XML. Turtle allows an RDF graph to be written in a compact and natural text form, with abbreviations for common usage patterns and datatypes. Turtle [[!TURTLE-TR]] provides levels of compatibility with the existing N-Triples format as well as, the triple pattern syntax of the SPARQL W3C Recommendation.
+Turtle is an RDF serialization format designed to be easier to read than others such as RDF/XML. Turtle allows an RDF graph to be written in a compact and natural text form, with abbreviations for common usage patterns and datatypes. Turtle [[!TURTLE-TR]] provides levels of compatibility with the existing N-Triples format as well as the triple pattern syntax of the SPARQL W3C Recommendation.
</section >
<section >
--- a/glossary/respec-ref.js Tue Mar 19 17:25:08 2013 -0400
+++ b/glossary/respec-ref.js Wed Mar 20 10:31:41 2013 +0100
@@ -17,7 +17,7 @@
berjon.biblio["RFC2396"] = "<cite><a href=\"http://tools.ietf.org/html/rfc2396\">Uniform Resource Identifiers (URI): Generic Syntax</a></cite>, Berners-Lee, T., Fielding, R.T., and L. Masinter, August 1998. Internet RFC 2396. URL: <a href=\"http://tools.ietf.org/html/rfc2396\">http://tools.ietf.org/html/rfc2396</a>";
berjon.biblio["TURTLE-TR"] = "<cite><a href=\"http://www.w3.org/TR/2013/CR-turtle-20130219/\">Turtle: Terse RDF Triple Language</a></cite>,Eric Prud'hommeaux, Gavin Carothers, 19 February 2013. W3C Candidate Recommendation. URL: <a href=\"http://www.w3.org/TR/2013/CR-turtle-20130219/\">http://www.w3.org/TR/2013/CR-turtle-20130219/</a>";
berjon.biblio["SPARQL"] = "<cite><a href=\"http://www.w3.org/TR/rdf-sparql-query/\">SPARQL Query Language for RDF</a></cite>,Eric Prud'hommeaux, Andy Seaborne, 15 January 2008. W3C Recommendation. URL: <a href=\"http://www.w3.org/TR/rdf-sparql-query/\">http://www.w3.org/TR/rdf-sparql-query/</a>";
- berjon.biblio["SPARQL-1.1"] = "<cite><a href=\"http://www.w3.org/TR/2012/PR-sparql11-overview-20121108/\">SPARQL 1.1 Overview</a></cite>,The W3C SPARQL Working Group, 8 November 2012. W3C Proposed Recommendation. URL: <a href=\"http://www.w3.org/TR/2012/PR-sparql11-overview-20121108/\">http://www.w3.org/TR/2012/PR-sparql11-overview-20121108/</a>";
+ berjon.biblio["SPARQL-11"] = "<cite><a href=\"http://www.w3.org/TR/2012/PR-sparql11-overview-20121108/\">SPARQL 1.1 Overview</a></cite>,The W3C SPARQL Working Group, 8 November 2012. W3C Proposed Recommendation. URL: <a href=\"http://www.w3.org/TR/2012/PR-sparql11-overview-20121108/\">http://www.w3.org/TR/2012/PR-sparql11-overview-20121108/</a>";
berjon.biblio["RDFS"] = "<cite><a href=\"http://www.w3.org/TR/rdf-schema/\">RDF Vocabulary Description Language 1.0: RDF Schema</a></cite>,ed. Dan Brickley, R.V. Guha, 10 February 2004. W3C Recommendation. URL: <a href=\"http://www.w3.org/TR/rdf-schema/\">http://www.w3.org/TR/rdf-schema/</a>";
berjon.biblio["OWL2"] = "<cite><a href=\"http://www.w3.org/TR/owl2-overview/\">OWL 2 Web Ontology Language Document Overview</a></cite>, W3C OWL Working Group, 27 October 2009. W3C Recommendation. URL: <a href=\"http://www.w3.org/TR/owl2-overview/\">http://www.w3.org/TR/owl2-overview/</a>";
berjon.biblio["XHTML1"] = "<cite><a href=\"http://www.w3.org/TR/xhtml1/\">XHTML 1.0 The Extensible HyperText Markup Language (Second Edition)</a></cite>, Steven Pemberton, Daniel Auster, et al., 26 January 2000. W3C Recommendation. URL: <a href=\"http://www.w3.org/TR/xhtml1/\">http://www.w3.org/TR/xhtml1/</a>";