--- a/glossary/index.html~ Fri Mar 22 17:57:42 2013 -0400
+++ b/glossary/index.html~ Sun Mar 24 14:34:14 2013 +0100
@@ -49,15 +49,7 @@
<p class="highlight">☆☆☆☆☆ <b>All of the above and links to other Linked Open Data.</b>
</p>
<p>
-The Linked Data mug can be read with both green labels for <a href="#linked-open-data">Linked Open Data</a>, or neither label for <a href="#linked-data">Linked Data</a>. Proceeds of the <a href="http://www.cafepress.com/w3c_shop">Linked Open Data mug</a> benefit the W3C.
- <img alt="Get a 5* mug" border="none" src="http://www.w3.org/DesignIssues/diagrams/lod/597992118v2_350x350_Back.jpg" align="right"/>
-</a>
-</p>
-</section>
-
-<section>
-<h4>5 Star Linked Data Diagram</h4>
-<a href="http://5stardata.info/" target="_blank">5 Open Data diagram</a> is a graphical representation of each of the 5 Star techniques as described by Tim Berners-Lee.
+An easy to read graphic for explaining the 5 Star Linked Data model may be seen on the <a href="http://www.cafepress.com/w3c_shop">5 Star Linked Open Data mug</a>. One reads both green labels for <a href="#linked-open-data">Linked Open Data</a>, or neither green label for <a href="#linked-data">Linked Data</a>. The <a href="http://5stardata.info/" target="_blank">5 Open Data diagram</a> is a graphical representation of each of the 5 Star techniques as described by Tim Berners-Lee.
</section>
<section>
@@ -86,13 +78,8 @@
</section>
<section>
-<h4>CKAN</h4>
-<a href="http://datahub.io/" target="_blank">CKAN</a> is a widely used data cataloging site written and maintained by the <a href="http://okfn.org/" target="_blank"> Open Knowledge Foundation</a>. The Linking Open Data community collects metadata about Linked Data registered on CKAN.
-</section>
-
-<section>
<h4>Closed World</h4>
-Closed world is a concept from Artificial Intelligence and refers to a model of uncertainty that an agent assumes about the external work. In a closed world, the agent presumes that what is not known to be true must be false. This is a common assumption underlying relational databases, most forms of logical programming. See also [<a href="#open-world">Open World</a>].
+Closed world is a concept from Artificial Intelligence and refers to a model of uncertainty that an agent assumes about the external world. In a closed world, the agent presumes that what is not known to be true must be false. This is a common assumption underlying relational databases, most forms of logical programming. See also <a href="#open-world">Open World</a>.
</section>
<section >
@@ -102,17 +89,17 @@
<section>
<h4>Conneg</h4>
-Abbreviated term for content negotiation. See also [<a href="#content-negotiation">Content Negotiation</a>].
+Abbreviated term for content negotiation. See also <a href="#content-negotiation">Content Negotiation</a>.
</section>
<section>
<h4>Content Negotiation</h4>
-Content negotiation, often called "conneg", refers to a phase in establishing a network connection. It is a mechanism for selecting the appropriate representation when servicing a request. The representation of entities in any response can be negotiated (including error responses). See also [<a href="http://www.w3.org/Protocols/HTTP/1.1/rfc2616bis/draft-lafon-rfc2616bis-03.html#content.negotiation" target="blank">RFC 2616b</a>]. See also [<a href="#connection">Connection</a>].
+Content negotiation, often called "conneg", refers to a phase in establishing a network connection. It is a mechanism for selecting the appropriate representation when servicing a request. The representation of entities in any response can be negotiated (including error responses). See also [<a href="http://www.w3.org/Protocols/HTTP/1.1/rfc2616bis/draft-lafon-rfc2616bis-03.html#content.negotiation" target="blank">HTTP Protocol 1.1</a>]. See also <a href="#connection">Connection</a>.
</section>
<section >
-<h4>Controlled Vocabularies</h4>
-Controlled vocabularies refer to the practice of using carefully selected sets of terms that are used to describe specific units of information. They are used to create thesauri, <a href="#taxonomy">taxonomies</a> and <a href="#ontology">ontologies</a>.
+<h4>Controlled Vocabulary</h4>
+A controlled vocabulary is a selected set of terms that can be used to index, tag or describe units of information. By providing a restricted and managed set of terms they can be used to reduce ambiguity in information systems. Such vocabularies may be unstructured (e.g. code lists) or may be organized into increasingly complex knowledge organization schemes (<a href="#taxonomy">taxonomies</a>, thesauri, <a href="#ontology">ontologies</a>). In traditional settings the terms in the controlled vocabularies are words or phrases, in a linked data setting then they are normally assigned unique identifiers (URIs) which in turn link to descriptive phrases.
</section>
<section>
@@ -127,54 +114,37 @@
<section>
<h4>curl</h4>
-A command line client for retrieving machine readable content. To see exactly how human and machine readable content works, try this exercise. Wikipedia has an interesting page about the color <a href="http://wikipedia.org/wiki/Red" target="_blank">Red</a>. DBpedia allows you to get the structured content listed on the Wikipedia page for "Red" [<a href="http://wikipedia.org/wiki/Red">http://wikipedia.org/wiki/Red</a>] by changing "wiki" to "data" and appending the appropriate file extension.
-<pre>$ curl -L http://dbpedia.org/data/Red.ttl</pre>
-</section>
-
-<section>
-<h4>D2RQ</h4>
-The term D2RQ may be used to describe a mapping language definition or an Open Source platform project. See also [<a href="#d2rq-platform">D2RQ Platform</a>]
-</section>
-
-<section>
-<h4>D2RQ Platform</h4>
-Refers to a system for accessing relational databases as virtual, read-only RDF graphs. The <a href="http://d2rq.org/" target="_blank">D2RQ platform</a> offers RDF-based access to the content of relational databases without having to replicate it into an RDF store. The D2RQ Platform allows one to query a non-RDF database using SPARQL, access the content of the database as Linked Data over the Web, create custom dumps in RDF formats for loading into an RDF triplestore, and access information in a non-RDF database using the Apache Jena API. See the D2RQ Open Source Project and also the <a href="#d2rq-mapping-language-description">D2RQ Mapping Language description</a>.
-</section>
-
-<section>
-<h4>D2RQ Mapping Language</h4>
-D2RQ mapping language refers to a declarative language for mapping relational database schemas to RDF vocabularies and OWL ontologies. The language is implemented in the D2RQ Platform. See also [<a href="#d2rq-platform">D2RQ Platform</a>].
+A command line client to retrieve any data over a wide variety of protocols, including machine readable RDF.
</section>
<section >
-<h4>Database to RDF Queueing</h4>
-Database to RDF queueing refers to a mechanism to query information in traditional management systems such as relational databases via the SPARQL query language. See also [<a href="#d2rq">D2RQ</a>].
+<h4>Data Cloud</h4>
+Data cloud, also called the <a href="http://richard.cyganiak.de/2007/10/lod/" target="_blank">Linked Data Cloud</a>, is a visual representation of datasets published as Linked Data. Using metadata generated by directories, including CKAN, the project records datasets by domain. The Linked Data Cloud has doubled in size every 10 months since 2007 and as of late 2012 consists of more than 300 data sets from various domains, including geography, media, government and life sciences, according the [<a href="http://lod-cloud.net/state/">State of the LOD Cloud</a>], website and visualizations maintained by C. Bizer, A. Jentzsch, R. Cyganiak. The original data owners/stewards publish one third of the data contained in the Linked Open Data Cloud, while third parties publish 67%. Many academic institutions republish data from their respective governments as <a href="#linked-data">Linked Data</a>, often enhancing the representation in the process.
</section >
<section >
-<h4>Data Cloud</h4>
-Data cloud, also called the <a href="http://richard.cyganiak.de/2007/10/lod/" target="_blank">Linked Data Cloud</a>, is a visual representation of datasets published as Linked Data. Using metadata generated by directoies, including CKAN, the project records datasets by domain. The Linked Data Cloud has doubled in size every 10 months since 2007 and as of late 2012 consists of more than 300 data sets from various domains, including geography, media, government and life sciences, according the [<a href="http://lod-cloud.net/state/">State of the LOD Cloud</a>], website and visualizations maintained by C. Bizer, A. Jentzsch, R. Cyganiak. The original data owners/stewards publish one third of the data contained in the Linked Open Data Cloud, while third parties publish 67%. Many academic institutions republish data from their respective governments as <a href="#linked-data">Linked Data</a>, often enhancing the representation in the process.
-</section >
-
-<section >
-<h4>Data Hub</h4>
-The <a href="http://thedatahub.org/" target="_blank">Data Hub</a> is a community-run catalogue of useful sets of data on the Internet, powered using an open-source data cataloguing software called <a href="http://ckan.org/" target="_blank">CKAN</a>. It is an openly editable open data catalogue, in the style of Wikipedia.
+<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. <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>
<h4>Data Market</h4>
-Data warehouse refers to a storage and retrieval system for enterprise information designed to centralize information from other stores to facilitate cross-system querying and reporting. Linked Data is an alternative to data warehouses whereby data consumers (human and machine) assume a distributed information architecture and use HTTP URIs to describe and access resources.
+A data market, also called a Data Marketplace, is an online (broker) service to enable discovery and access to a large collection of datasets offered by a range of data providers. Examples include Infochimps, Azure Marketplace and Factual. Data Markets may include open as well as paid-for data, and may offer value added services such as <a href="#API">APIs</a> and visualizations and programmatic data access.
</section >
<section>
+<h4>Data Modeling</h4>
+Data modeling is a process used to define and analyze data requirements for an information system. In the context of Linked Data Modeling, it is a process that involves professional data modelers working closely with business stakeholders to define and document implicit and explicit relationships. Linked Data modeling applies formal Linked Data modeling techniques based on <a href="#linked-data-principles">Linked Data Principles</a>.
+</section>
+
+<section>
<h4>Data Warehouse</h4>
-A storage and retrieval system for enterprise information designed to centralize information from other stores to facilitate cross-system querying and reporting. Linked Data is an alternative to data warehouses whereby data consumers (human and machine) assume a distributed information architecture and use HTTP URIs to describe and access resources.
+A data warehouse is one approach to data integration in which data from various operational data systems is extracted, cleaned, transformed and copied to a centralized repository. The centralized repository can then be used for data mining or answering analytical queries. By contrast, Linked Data <em>assumes and accounts</em> for a <em>distributed approach</em> using HTTP URIs to describe and access information resources. A Linked Data approach is seen as an valid alternative to the centralized data warehouse approach especially when integrating open government datasets.
</section>
<section >
<h4>DBpedia</h4>
DBpedia is a community effort to extract structured information from Wikipedia and make it available on the Web. DBpedia is often depicted as a hub for the <a href="#data-cloud">Data Cloud</a>. An RDF representation of the metadata derived from Wikipedia is made available for SPARQL queries and linking to other datasets on the Web. DBpedia also provides a human readable version of the structured content. For example, the human readable version of Linked Data for the color "Red" is found on DBpedia at <a href="http://dbpedia.org/page/Red">http://dbpedia.org/page/Red</a>. See also [<a href="#curl">curl</a>].
-
</section >
<section>
@@ -184,22 +154,22 @@
<section>
<h4>Description Logic</h4>
-Description Logic (DL) is a family of knowledge representation languages with varying and adjustable expressivity. DL is used in artificial intelligence for formal reasoning on the concepts of an application domain. Two variants of the Web Ontology Language (OWL), specifically OWL Lite and OWL DL are based on Description Logic. Biomedical informatics applications often use DL for codification of healthcare and life sciences knowledge.
-</section>
-
-<section>
-<h4>Descriptor Resource</h4>
-Descriptor resource refers to a type of resource in the context of RDF that bears/carries the description of a Subject.
+Description Logic (DL) is a family of knowledge representation languages with varying and adjustable expressivity. DL is used in artificial intelligence for formal reasoning on the concepts of an application domain. The Web Ontology Language (OWL) provides a standards-based way to exchange ontologies and includes a Description Logic semantics as well as an RDF based semantics. Biomedical informatics applications often use DL for codification of healthcare and life sciences knowledge.
</section>
<section>
<h4>DCAT</h4>
-Data Catalog Vocabulary (DCAT) is an RDF vocabulary. It is designed to facilitate interoperability between data catalogs published on the Web. See also [<a href="http://www.w3.org/TR/vocab-dcat/" target="_blank">Data Catalog Vocabulary (DCAT)</a>].
+Data Catalog Vocabulary (DCAT) is an RDF vocabulary. It is designed to facilitate interoperability between data catalogs published on the Web. See also <a href="http://www.w3.org/TR/vocab-dcat/" target="_blank">Data Catalog Vocabulary (DCAT)</a>.
+</section>
+
+<section>
+<h4>DCMI</h4>
+See <a href="#dublin-core-metadata-initiative">Dublin Core Metadata Initiative</a>
</section>
<section>
<h4>Directed Graph</h4>
-A directed graph is a graph in which the links between nodes are directional, i.e., they only go from one node to another. RDF represents things (nouns) and the relationships between them (verbs) in a directed graph. In <a href="#rdf">RDF</a>, links are differentiated by being assigned unique <a href="#uri">URIs</a>.
+A directed graph is a graph in which the links between nodes are directional, i.e., they only go from one node to another. RDF represents things (nouns) and the relationships between them (verbs) in a directed graph. In <a href="#rdf">RDF</a>, links are labelled by being assigned unique <a href="#uri">URIs</a>.
</section>
<section>
@@ -213,13 +183,13 @@
</section>
<section>
-<h4>Dublin Core Element Set</h4>
- Dublin Core Element Set refers to a <a href="#vocabulary">vocabulary</a> of fifteen properties for use in resource descriptions, such as may be found in a library card catalog (creator, publisher, etc). The Dublin Core Element Set is the most commonly used vocabulary for Linked Data applications. See also [<a href="http://dublincore.org/documents/dcmi-terms/"> Dublin Core Element Set, Version 1.1 Specification.</a>]
+<h4>Dublin Core Metadata Element Set</h4>
+Dublin Core Metadata Element Set refers to a <a href="#vocabulary">vocabulary</a> of fifteen properties for use in resource descriptions, such as may be found in a library card catalog (creator, publisher, etc). The Dublin Core Metadata Element Set, also known as "DC Elements", is the most commonly used vocabulary for Linked Data applications. See also <a href="http://dublincore.org/documents/dces/"> Dublin Core Element Set, Version 1.1 Specification.</a> [<a href="#dublin-core-metadata-initiative" target="_blank">DCMI</a>]
</section>
<section>
-<h4>Dublin Core Metadata Initiative (DCMI)</h4>
-<a href="http://dublincore.org/about-us/">The Dublin Core Metadata Initiative (DCMI)</a> is an open international organization engaged in the development of interoperable metadata standards, including the Dublin Core Element Set. It supports metadata design and best practices across a broad range of purposes and business models.
+<h4>Dublin Core Metadata Initiative</h4>
+<a href="http://dublincore.org/about-us/" target="_blank">The Dublin Core Metadata Initiative (DCMI)</a> is an open international organization engaged in the development of interoperable metadata standards, including the Dublin Core Element Set. The DCMI manages long term curation and development of DCMI <a href="http://dublincore.org/specifications/" target="_blank"> specifications and metadata terms namespaces</a>
</section>
<section>
@@ -234,17 +204,12 @@
<section>
<h4>Free/Libre/Open Source Software</h4>
-Free, also known as Libre or Open Sour, is a generic and internationalized term for software released under an Open Source license. <a href="http://www.sourceforge.net/">Sourceforge</a> is a public repository of such software.
+Free, also known as Libre or Open Source, is a generic and internationalized term for software released under an Open Source license.
</section>
<section>
<h4>Graph</h4>
-Graph refers to a mathematical structure consisting of a collection of objects, represented by "nodes", and connected by “edges” (also called links), to denote inter-relationships between them. It is well established as the field of Graph Theory. See also [<a href="#directed-graph">Directed Graph</a>].
-</section>
-
-<section>
-<h4>Hash URI Strategy</h4>
-The hash URI strategy builds on the characteristic that URIs may contain a special part that is separated from the base part of the URI by a hash symbol (#). This special part is called the fragment identifier.
+Graph refers to a mathematical structure consisting of a collection of objects, represented by "nodes", and connected by “edges” (also called links), to denote inter-relationships between them. It is well established as the field of Graph Theory. See also <a href="#directed-graph">Directed Graph</a>.
</section>
<section>
@@ -269,12 +234,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>
@@ -294,7 +259,7 @@
<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 not the same as <a href="rdf">RDF</a>, rather Linked Data uses the RDF family of standards for data interchange ( RDF/XML, RDFa, Turtle) 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>
@@ -303,6 +268,11 @@
</section>
<section>
+<h4>Linked Data Platform 1.0</h4>
+A set of best practices and simple approach for a read-write Linked Data architecture, based on HTTP access to web resources that describe their state using the RDF data model. The Linked Data Platform describes the use of HTTP for accessing, updating, creating and deleting resources from servers that expose their resources as Linked Data. It provides some new rules as well as clarifications and extensions of the four rules of Linked Data [[LINKED-DATA]]. See also [[LDP-ONE]]
+</section>
+
+<section>
<h4>Linked Data Principles</h4>
Tim Berners-Lee, the inventor of the Web and initiator of the <a href="http://www.w3.org/DesignIssues/LinkedData.html" target="_blank"> Linked Data</a> project, proposed the following principles upon which Linked Data is based:
<ol>
@@ -316,12 +286,12 @@
<section>
<h4>Linked Open Data</h4>
-Linked Open Data refers to Linked Data published on the public Web. Abbreviated often as "LOD". Publishing Linked Open Data [[HOWTO-LODP]] enables distributed <a href="#sparql">SPARQL</a> queries of the data sets and a "browsing" or "discovery" approach to finding information, as compared to a search strategy.
+Linked Open Data refers to Linked Data published on the <em>public Web</em>, often abbreviated as "LOD". Publishing Linked Open Data enables distributed <a href="#sparql">SPARQL</a> queries of the data sets and a "browsing" or "discovery" approach to finding information, as compared to a search strategy. See also: [[LD-FOR-DEVELOPERS]], [[HOWTO-LODP]]
</section>
<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 interconnected 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>
@@ -334,13 +304,21 @@
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>
<section>
<h4>Machine Readable Data</h4>
-Machine readable gets 2-stars on the <a href="#5-star-linked-data">5-star Linked Data scale</a>. Many open data developers routinely use screen-scrapping techniques to parse machine readable content. Publishing and consuming 4-star and 5-star Linked Data is preferable in terms of access and re-use. Anything less gives Web developers more work modeling and transforming data. By creating and publishing 5-star Linked Data, you are increasing the ability of search engines, and thus humans, to find, access and re-use information.</section>
+<p>Machine readable gets 2-stars on the <a href="#5-star-linked-data">5-star Linked Data scale</a>. While some open data developers use screen-scrapping techniques to parse machine readable content, using 4-star or 5-star Linked Data is preferable in terms of provenance and ease of reuse. Anything less than 4-star data gives Web developers more work modeling and transforming data. By creating and publishing Linked Data, you are increasing the ability of search engines, and thus humans, to find, access and re-use information.
+</p>
+<p>
+To see how a Linked Data representation yields both a human and machine readable version simultaneously, try this exercise. Wikipedia has an interesting page about the color <a href="http://wikipedia.org/wiki/Red" target="_blank">Red</a>. DBpedia allows you to get the structured content listed on the Wikipedia page for "Red" [<a href="http://wikipedia.org/wiki/Red">http://wikipedia.org/wiki/Red</a>] by changing "wiki" to "data" and appending the appropriate file extension.
+<pre>$ curl -L http://dbpedia.org/data/Red.ttl</pre>
+Thus, you've seen how the same data can be viewed in human and machine readable format from the same page.
+</p>
+</section>
<section>
<h4>Message</h4>
@@ -379,7 +357,8 @@
<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>].
+An ontology is a formal model of a domain. It describes the types of things that exist (classes), the relationships between them (properties) and the logical ways those classes and properties can be used together (axioms). The OWL (Web Ontology Language) family of languages provide a standardized-means for expressing and exchanging ontologies. It builds upon, and is compatible with, <a href="#rdf">RDF</a>.
+
</section>
<section>
@@ -395,7 +374,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>
@@ -404,8 +383,18 @@
</section>
<section>
+<h4>Persistent Identifier Scheme</h4>
+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>
+<h4>Persistent Uniform Resource Locator</h4>
+A persistent uniform resource locator (PURL) is a <a href="uniform-resource=locator">uniform resource locator</a> (URL) that is intended to remain the same over the course of time, regardless of changes to the implementing technology, the ownership of the resource or the contents of the representation. There are several types of PURLs, which are differentiated by the HTTP status code they return. PURLs are used to curate the URL resolution process, thus solving the problem of transitory URIs in location-based URI schemes like HTTP. Thus, a user of a PURL always uses the same Web address, even though the resource in question may have moved or changed ownership. A PURL might redirect to the new location or return content proxied from the new location.
+</section>
+
+<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>
@@ -424,8 +413,13 @@
</section>
<section>
+<h4>PURL</h4>
+See <a href="#persistent-uniform-resource-locator">Persistent Uniform Resource Locator</a>
+</section>
+
+<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>
@@ -434,6 +428,11 @@
</section>
<section>
+<h4>R2RML</h4>
+<a href="http://www.w3.org/TR/r2rml/">R2RML</a> (RDB to RDF Mapping Language) is a language for expressing customized mappings from relational databases to RDF datasets. Such mappings provide the ability to view existing relational data in the RDF data model, expressed in a structure and target vocabulary of the mapping author's choice.
+</section>
+
+<section>
<h4>Raw Data</h4>
Raw data refers to machine-readable files from the wilderness released without any specific effort to make them applicable to a particular application. The advantage of "raw" data is that it can be reused in multiple applications created by multiple communities; but this requires some means of processing it.
</section>
@@ -455,7 +454,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/rdf11-concepts/">RDF 1.1 Concepts and Abstract Syntax</a>
</section>
<section>
@@ -468,18 +467,20 @@
</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'>In favor of removing this item: DaveR. In favor of keeping: Bhyland. To discuss</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>
<h4>RDF Schema</h4>
-RDF Schema (RDFS) [[!RDFS]] is the schema language for RDF; it describes constructs for types of objects (Classes), relating types to one another (subClasses), properties that describe objects (Properties), and relationships between them (subProperty).
+RDF Schema (RDFS) [[!RDFS]] is the vocabulary language for RDF; it describes constructs for types of objects (Classes), relating types to one another (subClasses), properties that describe objects (Properties), and relationships between them (subProperty).
</section>
<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>
@@ -504,7 +505,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>
@@ -524,7 +525,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>
@@ -549,7 +550,7 @@
<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>
@@ -574,7 +575,7 @@
<section >
<h4>Taxonomy</h4>
- Taxonomy is a formal representation of relationships between items in a hierarchical structure. Also see [<a href="#ontology">Ontology</a>].
+ Taxonomy is a formal representation of relationships between items in a hierarchical structure. Also see <a href="#ontology">Ontology</a>.
</section >
<section >
@@ -584,7 +585,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 >
@@ -599,12 +600,12 @@
<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 >
<h4>Uniform Resource Identifier</h4>
-<p>A Uniform Resource Identifier (URI) is a global identifier that uniquely identifies an abstract or physical resource. URIs were standardized by joint action of the W3C and IETF. URI’s provide a simple and extensible means for identifying a resource. URIs play a key role in enabling Linked Data. URIs can be used to uniquely identify virtually anything including a physical building or more abstract concepts like the color red. If you would like to see the URI for the color red for example, the DBpedia project has modified URLs from the Wikipedia entry to create http://dbpedia.org/page/red. URIs can also be used to refer to other data representatations such as a row in a CSV file or a specific table in a relational database.
+<p>A Uniform Resource Identifier (URI) is a global identifier that uniquely identifies an abstract or physical resource. URIs were standardized by joint action of the W3C and IETF. URI’s provide a simple and extensible means for identifying a resource. URIs play a key role in enabling Linked Data. URIs can be used to uniquely identify virtually anything including a physical building or more abstract concepts like the color red. If you would like to see the URI for the color red for example, the DBpedia project has modified URLs from the Wikipedia entry to create <a href="http://dbpedia.org/page/red">http://dbpedia.org/page/red</a>. URIs can also be used to refer to other data representatations such as a row in a CSV file or a specific table in a relational database.
</p>
</p>
As Linked Data builds directly on Web architecture, the term "resource" is used to refer to things of interest that are identified by HTTP URIs. An HTTP URI may or may not be resolvable on the Web. URIs have been known by many names: Web addresses, Universal Document Identifiers, Universal Resource Identifiers, and finally the combination of Uniform Resource Identifier. If you are interested in the history of the many names, read Tim Berners-Lee's design document <a href="http://www.w3.org/DesignIssues/Architecture.html">Web Architecture from 50,000 feet</a>. For definitive information on Uniform Resource Identifiers (URI), see "Uniform Resource Identifier (URI): Generic Syntax," [[!RFC3986]]
@@ -638,6 +639,11 @@
</section>
<section>
+<h4>VoID</h4>
+VoID is an <a href="#rdf-schema">RDF Schema</a> vocabulary for expressing metadata about RDF datasets. It is intended as a bridge between the publishers and users of RDF data, with applications ranging from data discovery to cataloging and archiving of datasets. VoID can be used to express general metadata based on Dublin Core, access metadata, structural metadata, and links between datasets. [VOID-GUIDE]
+</section>
+
+<section>
<h4>Web 2.0</h4>
A colloquial description of the part of the World Wide Web that implements social networking, blogs, user comments and ratings and related human-centered activities.
</section >
--- a/glossary/respec-ref.js~ Fri Mar 22 17:57:42 2013 -0400
+++ b/glossary/respec-ref.js~ Sun Mar 24 14:34:14 2013 +0100
@@ -1,22 +1,28 @@
var preProc = {
apply: function(c) {
// extend the bibliography entries
- berjon.biblio["PROV"] = "<cite><a href=\"http://www.w3.org/2005/Incubator/prov/XGR-prov-20101214/\">Provenance Final Report</a></cite> Yolanda Gil; et al. 08 December 2010. W3C Incubator Group Report. URL: http://www.w3.org/2005/Incubator/prov/XGR-prov-20101214/ ";
- berjon.biblio["RDF-Primer"] = "<cite><a href=\"http://www.w3.org/TR/rdf-primer/\">RDF-Primer</a></cite>, Frank Manola, Eric Miller (Editors), 10 February 2004. W3C Recommendation. URL: <a href=\"http://www.w3.org/TR/rdf-primer/\">http://www.w3.org/TR/rdf-primer/</a>";
- berjon.biblio["MICRODATA"] = "<cite><a href=\"http://www.w3.org/TR/microdata/\">Microdata</a></cite> Ian Hickson; et al. 04 March 2010. W3C Working Draft. URL: http://www.w3.org/TR/microdata/ ";
- berjon.biblio["XHTML-RDFA"] = "<cite><a href=\"http://www.w3.org/TR/xhtml-rdfa/\">XHTML+RDFa</a></cite> Manu Sporny; et al. 31 March 2011. W3C Working Draft. URL: http://www.w3.org/TR/xhtml-rdfa/ ";
- berjon.biblio["HTML-RDFA"] = "<cite><a href=\"http://dev.w3.org/html5/rdfa/\">HTML+RDFa</a></cite> Manu Sporny; et al. 24 May 2011. W3C Working Draft. URL: http://dev.w3.org/html5/rdfa/ ";
- berjon.biblio["HOWTO-LODP"] = "<cite><a href=\"http://linkeddata.org/docs/how-to-publish\">How to Publish Linked Data on the Web</a></cite>, C. Bizer, R. Cyganiak, and Tom Heath, Community Tutorial 17 July 2008. URL: http://linkeddata.org/docs/how-to-publish";
- berjon.biblio["COOL-SWURIS"] = "<cite><a href=\"http://www.w3.org/TR/cooluris/\">Cool URIs for the Semantic Web</a></cite>, L. Sauermann and R. Cyganiak, W3C Interest Group Note 03 December 2008. URL: http://www.w3.org/TR/cooluris/";
- berjon.biblio["VOID-GUIDE"] = "<cite><a href=\"http://www.w3.org/TR/void/\">Describing Linked Datasets with the VoID Vocabulary</a></cite>, K. Alexander, R. Cyganiak, M. Hausenblas, and J. Zhao, W3C Interest Group Note 03 March 2011. URL: http://www.w3.org/TR/void/";
- berjon.biblio["RDFA-CORE-PROFILE"] = "<cite><a href=\"http://www.w3.org/profile/rdfa-1.1\">RDFa Core Default Profile</a></cite>, I. Herman, W3C RDF Web Applications Working Group 02 June 2011. URL: http://www.w3.org/profile/rdfa-1.1";
- berjon.biblio["XHTML-RDFA-PROFILE"] = "<cite><a href=\"http://www.w3.org/profile/html-rdfa-1.1\">HTML+RDFa Core Default Profile</a></cite>, I. Herman, W3C RDF Web Applications Working Group 24 May 2011. URL: http://www.w3.org/profile/html-rdfa-1.1";
- berjon.biblio["RFC2616"] = "<cite><a href=\"http://www.w3.org/Protocols/rfc2616/rfc2616.html\">Hypertext Transfer Protocol -- HTTP/1.1</a></cite>, R. Fielding; et al. June 1999. Internet RFC 2616. URL: http://www.w3.org/Protocols/rfc2616/rfc2616.html.";
+ berjon.biblio["LINKED-DATA"] = "<cite><a href=\"http://www.w3.org/DesignIssues/LinkedData.html/\">LINKED-DATA</a></cite>, Tim Berners-Lee. Linked Data Design Issues. 27 July 2006. W3C-Internal Document. URL: <a href=\"http://www.w3.org/DesignIssues/LinkedData.html/\">http://www.w3.org/DesignIssues/LinkedData.html</a>";
+
+ berjon.biblio["HOWTO-LODP"] = "<cite><a href=\"http://linkeddatabook.com/editions/1.0/\">Linked Data: Evolving the Web into a Global Data Space.</a> 2011, Chris Bizer, Tom Health URL: <a href=\"http://linkeddata.org/docs/how-to-publish\">http://linkeddatabook.com/editions/1.0/</a>";
+
+ berjon.biblio["LD-FOR-DEVELOPERS"] = "<cite><a href=\"http://manning.com/dwood/\">Linked Data: Structured Data on the Web.</a> David Wood, Marsh Zaidman, Luke Ruth, with Michael Hausenblas</cite>; 2013 URL: <a href=\"http://www.manning.com/dwood\">http://www.manning.com/dwood/</a>";
+
+ berjon.biblio["LDP_ONE"] = "<cite><a href=\"http://www.w3.org/TR/2013/WD-ldp-20130307/\">Linked Data Platform 1.0.</a></cite> Steve Speicher, John Arwe. 07 March 2013. W3C Working Draft, Linked Data Platform Working Group. URL: <a href=\"http://www.w3.org/TR/ldp/\">http://www.w3.org/TR/ldp/</a>";
+
+ berjon.biblio["XHTML-RDFA"] = "<cite><a href=\"http://www.w3.org/TR/xhtml-rdfa/\">XHTML+RDFa</a></cite> Manu Sporny; et al. 31 March 2011. W3C Working Draft. URL: http://www.w3.org/TR/xhtml-rdfa/ ";
+
+ berjon.biblio["HTML-RDFA"] = "<cite><a href=\"http://dev.w3.org/html5/rdfa/\">HTML+RDFa</a></cite> Manu Sporny; et al. 24 May 2011. W3C Working Draft. URL: http://dev.w3.org/html5/rdfa/ ";
+
+ berjon.biblio["COOL-SWURIS"] = "<cite><a href=\"http://www.w3.org/TR/cooluris/\">Cool URIs for the Semantic Web</a></cite>, L. Sauermann and R. Cyganiak, W3C Interest Group Note 03 December 2008. URL: <a href=\"http://www.w3.org/TR/cooluris/\">http://www.w3.org/TR/cooluris/</a>";
+ berjon.biblio["VOID-GUIDE"] = "<cite><a href=\"http://www.w3.org/TR/void/\">Describing Linked Datasets with the VoID Vocabulary</a></cite>, K. Alexander, R. Cyganiak, M. Hausenblas, and J. Zhao, W3C Interest Group Note 03 March 2011. URL: http://www.w3.org/TR/void/";
+ berjon.biblio["RDFA-CORE-PROFILE"] = "<cite><a href=\"http://www.w3.org/profile/rdfa-1.1\">RDFa Core Default Profile</a></cite>, I. Herman, W3C RDF Web Applications Working Group 02 June 2011. URL: http://www.w3.org/profile/rdfa-1.1";
+ berjon.biblio["XHTML-RDFA-PROFILE"] = "<cite><a href=\"http://www.w3.org/profile/html-rdfa-1.1\">HTML+RDFa Core Default Profile</a></cite>, I. Herman, W3C RDF Web Applications Working Group 24 May 2011. URL: http://www.w3.org/profile/html-rdfa-1.1";
+ berjon.biblio["RFC2616"] = "<cite><a href=\"http://www.w3.org/Protocols/rfc2616/rfc2616.html\">Hypertext Transfer Protocol -- HTTP/1.1</a></cite>, R. Fielding; et al. June 1999. Internet RFC 2616. URL: <a href=\"http://www.w3.org/Protocols/rfc2616/rfc2616.html\">http://www.w3.org/Protocols/rfc2616/rfc2616.html</a>.";
berjon.biblio["RFC3986"] = "<cite><a href=\"http://tools.ietf.org/html/rfc3986\">Uniform Resource Identifier (URI): Generic Syntax</a></cite>, Berners-Lee, et al. January 2005. Internet RFC 3986. URL: <a href=\"http://tools.ietf.org/html/rfc3986\">http://tools.ietf.org/html/rfc3986</a>.";
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>";