--- a/nquads/index.html Mon Oct 21 14:38:39 2013 -0400
+++ b/nquads/index.html Wed Oct 23 19:28:31 2013 +0200
@@ -3,13 +3,16 @@
<head>
<title>N-Quads</title>
<meta http-equiv='Content-Type' content='text/html;charset=utf-8'/>
- <script src='https://ajax.googleapis.com/ajax/libs/jquery/1.6.2/jquery.min.js' class='remove'></script>
- <script src='https://raw.github.com/darobin/respec/develop/builds/respec-w3c-common-3.1.62.js' async class='remove'></script>
+ <script src="../local-biblio.js" class="remove"></script>
+ <script src="https://www.w3.org/Tools/respec/respec-w3c-common" class="remove"></script>
<script class='remove'>
var respecConfig = {
+ // extend the bibliography entries
+ localBiblio: localBibliography,
+
// specification status (e.g. WD, LCWD, NOTE, etc.). If in doubt use ED.
specStatus: "CR",
-
+
// the specification's short name, as in http://www.w3.org/TR/short-name/
shortName: "n-quads",
@@ -17,10 +20,6 @@
// formal title, define it here
subtitle : "A line-based syntax for an RDF datasets",
- "localBiblio" : {
- "EBNF-NOTATION" : "Tim Bray; Jean Paoli; C. M. Sperberg-McQueen; Eve Maler; François Yergeau. <a href=\"http://www.w3.org/TR/REC-xml/#sec-notation\"><cite>EBNF Notation</cite></a> 26 November 2008. W3C Recommendation. URL: <a href=\"http://www.w3.org/TR/REC-xml/#sec-notation\">http://www.w3.org/TR/REC-xml/#sec-notation</a> "
- },
-
// if you wish the publication date to be other than today, set this
publishDate: "2013-11-05",
@@ -40,30 +39,26 @@
//lcEnd: "2013-10-14",
crEnd: "2013-11-26",
- // if you want to have extra CSS, append them to this list
- // it is recommended that the respec.css stylesheet be kept
- extraCSS: ["http://dev.w3.org/2009/dap/ReSpec.js/css/respec.css"],
-
// editors, add as many as you like
// only "name" is required
editors: [
{ name: "Gavin Carothers", // url: "http://gavin.carothers.name/",
- company: "Lex Machina, Inc", companyURL: "https://lexmachina.com/" },
+ company: "Lex Machina, Inc", companyURL: "https://lexmachina.com/" },
],
- // authors, add as many as you like.
+ // authors, add as many as you like.
// This is optional, uncomment if you have authors as well as editors.
// only "name" is required. Same format as editors.
// name of the WG
wg: "RDF Working Group",
-
+
// URI of the public WG page
wgURI: "http://www.w3.org/2011/rdf-wg/",
-
+
// name (with the @w3c.org) of the public mailing to which comments are due
wgPublicList: "public-rdf-comments",
-
+
// URI of the patent status for this WG, for Rec-track documents
// !!!! IMPORTANT !!!!
// This is important for Rec-track documents, do not copy a patent URI from a random
@@ -72,7 +67,7 @@
wgPatentURI: "http://www.w3.org/2004/01/pp-impl/46168/status",
// doRDFa: true,
- testSuiteURI: "http://www.w3.org/2013/N-QuadsTests/"
+ testSuiteURI: "http://www.w3.org/2013/N-QuadsTests/"
};
</script>
<style type="text/css">
@@ -86,7 +81,7 @@
.separated tbody tr td.r { text-align: right; padding: .5em; }
.grammar td { font-family: monospace;}
.grammar-literal { color: gray;}
- </style>
+ </style>
</head>
<body>
<section id='abstract'>
@@ -95,8 +90,8 @@
<section id='sotd'>
<p>The N-Quads format has a similar flavor as N-Triples
-[[n-triples]]. The main distinction is that N-Quads allows encoding
-multiple graphs. In a change from previous publication, this document is intended to become a W3C Recommendation.</p>
+[[N-TRIPLES]]. The main distinction is that N-Quads allows encoding
+multiple graphs. In a change from previous publication, this document is intended to become a W3C Recommendation.</p>
</section>
<section id="sec-intro">
@@ -126,7 +121,7 @@
<h3>IRIs</h3>
<p>
- <a href="http://www.w3.org/TR/rdf11-concepts/#dfn-iri">IRIs</a> may be written only as absolute IRIs.
+ <a href="http://www.w3.org/TR/rdf11-concepts/#dfn-iri">IRIs</a> may be written only as absolute IRIs.
IRIs are enclosed in '<' and '>' and may contain numeric escape sequences (described below). For example <code><http://example.org/#green-goblin></code>.
</p>
</section>
@@ -177,14 +172,14 @@
<p>A conforming <strong>N-Quad parser</strong> is a system capable of reading N-Quad documents on behalf of an application. It makes the serialized RDF graph, as defined in <a href="#sec-parsing" class="sectionRef"></a>, available to the application, usually through some form of API.</p>
- <p>The IRI that identifies the N-Quad language is: <code>http://www.w3.org/ns/formats/N-Quads</code></p>
+ <p>The IRI that identifies the N-Quad language is: <code>http://www.w3.org/ns/formats/N-Quads</code></p>
<section id="sec-mediatype">
<h2>Media Type and Content Encoding</h2>
-
+
<p>The media type of N-Quads is <code>application/n-quads</code>.
- The content encoding of N-Quads is always UTF-8.
- See <a href="#sec-mediaReg">N-Quads Media Type</a> for the media type
+ The content encoding of N-Quads is always UTF-8.
+ See <a href="#sec-mediaReg">N-Quads Media Type</a> for the media type
registration form.
</p>
</section>
@@ -199,7 +194,7 @@
<p>The <abbr title="Extended Backus–Naur Form">EBNF</abbr> used here is defined in XML 1.0
[[!EBNF-NOTATION]].</p>
<p>Escape sequence rules are the same as Turtle
- [[turtle]]. However, as only the <a href="#grammar-production-STRING_LITERAL_QUOTE"><code>STRING_LITERAL_QUOTE</code></a> production is allowed new lines in literals MUST be escaped.</p>
+ [[TURTLE]]. However, as only the <a href="#grammar-production-STRING_LITERAL_QUOTE"><code>STRING_LITERAL_QUOTE</code></a> production is allowed new lines in literals MUST be escaped.</p>
<div data-include="nquads-bnf.html">
</div>
</section>
@@ -236,7 +231,7 @@
<section id="section-ack" class="informative">
<h2>Acknowledgements</h2>
<p>The editor of the 2013 edition acknowledges valuable contributions from Gregg Kellogg, Andy Seaborn, Eric Prud'hommeaux, Dave Beckett, David Robillard, Gregory Williams, Antoine Zimmermann, Sandro Hawke, Richard Cyganiak, Pat Hayes, Henry S. Thompson, Bob Ferris, Henry Story, Andreas Harth, Lee Feigenbaum, Peter Ansell, and David Booth.</p>
- <p>This specification is a product of extended deliberations by the
+ <p>This specification is a product of extended deliberations by the
<a href="http://www.w3.org/2000/09/dbwg/details?group=46168&public=1">members of the RDF Working Group</a> chaired by Guus Schreiber and David Wood. It draws upon the eariler specification in <em><a href="http://sw.deri.org/2008/07/n-quads/">N-Quads: Extending N-Triples with Context</a></em>, edited by Richard Cyganiak, Andreas Harth, and Aidan Hogan.</p>
</section>
@@ -291,17 +286,17 @@
<a class="norm" href="http://www.ietf.org/rfc/rfc3987.txt">Internationalized Resource Identifiers (IRIs)</a> [[!RFC3987]] Section 8, as well as
<a class="norm" href="http://www.ietf.org/rfc/rfc3986.txt">Uniform Resource Identifier (URI): Generic Syntax</a> [[!RFC3986]] Section 7.</dd>
- <dd>Multiple IRIs may have the same appearance. Characters in different scripts may
- look similar (a Cyrillic "о" may appear similar to a Latin "o"). A character followed
- by combining characters may have the same visual representation as another character
- (LATIN SMALL LETTER E followed by COMBINING ACUTE ACCENT has the same visual representation
+ <dd>Multiple IRIs may have the same appearance. Characters in different scripts may
+ look similar (a Cyrillic "о" may appear similar to a Latin "o"). A character followed
+ by combining characters may have the same visual representation as another character
+ (LATIN SMALL LETTER E followed by COMBINING ACUTE ACCENT has the same visual representation
as LATIN SMALL LETTER E WITH ACUTE).
<!-- (<code>foo:resum鼯code> and <code>fоо:resumé</code>)-->
Any person or application that is writing or interpreting data in Turtle must take care to use the IRI that matches the intended semantics, and avoid IRIs that make look similar.
- Further information about matching of similar characters can be found
- in <a class="inform" href="http://www.unicode.org/reports/tr36/">Unicode Security
+ Further information about matching of similar characters can be found
+ in <a class="inform" href="http://www.unicode.org/reports/tr36/">Unicode Security
Considerations</a> [[UNICODE-SECURITY]] and
- <a class="norm" href="http://www.ietf.org/rfc/rfc3987.txt">Internationalized Resource
+ <a class="norm" href="http://www.ietf.org/rfc/rfc3987.txt">Internationalized Resource
Identifiers (IRIs)</a> [[RFC3987]] Section 8.
</dd>
--- a/rdf-mt/index.html Mon Oct 21 14:38:39 2013 -0400
+++ b/rdf-mt/index.html Wed Oct 23 19:28:31 2013 +0200
@@ -1,30 +1,19 @@
<!DOCTYPE html>
<html>
<head>
- <meta http-equiv='Content-Type' content='text/html;charset=utf-8'/>
- <title>RDF 1.1 Semantics</title>
-
- <script src='https://www.w3.org/Tools/respec/respec-w3c-common' class='remove'></script>
- <script class='remove'>
+ <meta http-equiv='Content-Type' content='text/html;charset=utf-8'/>
+ <title>RDF 1.1 Semantics</title>
+ <script src="../local-biblio.js" class="remove"></script>
+ <script src='https://www.w3.org/Tools/respec/respec-w3c-common' class='remove'></script>
+ <script class='remove'>
var respecConfig = {
-//THis line is chacking on mercurial push. Ignore it. 20130530.1
+ // extend the bibliography entries
+ localBiblio: localBibliography,
+
// specification status (e.g. WD, LCWD, NOTE, etc.). If in doubt use ED.
specStatus: "ED",
// specStatus: "CR",
-
-localBiblio:{
-"HORST04":"Herman J. ter Horst. <cite>Extending the RDFS Entailment Lemma</cite>, in S.A. McIlraith et al. (Eds.), The Semantic Web - ISWC2004, Proceedings of the Third International Semantic Web Conference, Hiroshima, Japan, November 2004, Springer, LNCS 3298, pp. 77-91.",
-
-"HORST05":"Herman J. ter Horst. <cite>Completeness, Decidability and Complexity of Entailment for RDF Schema and a Semantic Extension Involving the OWL Vocabulary</cite>, Journal of Web Semantics 3 (2005) 79-115.",
-"RDF11-CONCEPTS": "Richard Cyganiak, David Wood. <cite><a href=\"http://www.w3.org/TR/2013/WD-rdf11-concepts-20130723/\">RDF 1.1 Concepts and Abstract Syntax.</a></cite> 23 July 2013. W3C Last Call Working Draft. URL: <a href=\"http://www.w3.org/TR/2013/WD-rdf11-concepts-20130723/\">http://www.w3.org/TR/2013/WD-rdf11-concepts-20130723/</a>. The latest edition is available at <a href=\"http://www.w3.org/TR/rdf11-concepts/\">http://www.w3.org/TR/rdf11-concepts/</a>",
-
-"RDF-PLAIN-LITERAL":"Jie Bao, Sandro Hawke, Boris Motik, Peter F. Patel-Schneider, Alex Polleres. <cite><a href=\"http://www.w3.org/TR/rdf-plain-literal/\">rdf:PlainLiteral: A Datatype for RDF Plain Literals (Second Edition)</a></cite> 11 December 2012. W3C Recommendation. URL: <a href=\"http://www.w3.org/TR/rdf-plain-literal/\">http://www.w3.org/TR/rdf-plain-literal/</a>",
-
-"TURTLE-CR":"Eric Prud'hommeaux, Gavin Carothers. <cite><a href=\"http://www.w3.org/TR/2013/CR-turtle-20130219/\">Turtle; Terse RDF Triple Language</a></cite>. 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>. The latest edition is available at <a href=\"http://www.w3.org/TR/turtle/\">http://www.w3.org/TR/turtle/</a>",
-
-"ISO24707":"<cite>Information technology — Common Logic (CL): a framework for a family of logic-based languages</cite> 1 October 2007. International Standard ISO/IEC 24707:2007(E). URL: <a href=\"http://standards.iso.org/ittf/PubliclyAvailableStandards/c039175_ISO_IEC_24707_2007%28E%29.zip\"> http://standards.iso.org/ittf/PubliclyAvailableStandards/c039175_ISO_IEC_24707_2007%28E%29.zip</a>" },
-
// the specification's short name, as in http://www.w3.org/TR/short-name/
shortName: "rdf11-mt",
@@ -52,21 +41,17 @@
// lcEnd: "2013-09-06",
prevRecShortname: "rdf-mt/",
- // if you want to have extra CSS, append them to this list
- // it is recommended that the respec.css stylesheet be kept
- extraCSS: ["http://dev.w3.org/2009/dap/ReSpec.js/css/respec.css"],
-
// editors, add as many as you like
// only "name" is required
editors: [
{ name: "Patrick J. Hayes", url: "http://www.ihmc.us/groups/phayes/",
company: "Florida IHMC", companyURL: "http://www.ihmc.us/index.php" },
- { name: "Peter F. Patel-Schneider",
+ { name: "Peter F. Patel-Schneider",
company: "Nuance Communications", companyURL: "http://www.nuance.com/" },
-
+
],
- // authors, add as many as you like.
+ // authors, add as many as you like.
// This is optional, uncomment if you have authors as well as editors.
// only "name" is required. Same format as editors.
@@ -74,16 +59,16 @@
// { name: "Your Name", url: "http://example.org/",
// company: "Your Company", companyURL: "http://example.com/" },
//],
-
+
// name of the WG
wg: "RDF Working Group",
-
+
// URI of the public WG page
wgURI: "http://www.w3.org/2011/rdf-wg/",
-
+
// name (without the @w3c.org) of the public mailing to which comments are due
wgPublicList: "public-rdf-comments",
-
+
// URI of the patent status for this WG, for Rec-track documents
// !!!! IMPORTANT !!!!
// This is important for Rec-track documents, do not copy a patent URI from a random
@@ -91,8 +76,7 @@
// Team Contact.
wgPatentURI: "http://www.w3.org/2004/01/pp-impl/46168/status",
- testSuiteURI: "http://www.w3.org/2013/rdf-mt-tests/"
-
+ testSuiteURI: "http://www.w3.org/2013/rdf-mt-tests/"
};
</script>
<style type="text/css">
@@ -153,7 +137,7 @@
</head>
<body>
<section id='abstract'>
- <p> This document describes a precise semantics for the Resource Description
+ <p> This document describes a precise semantics for the Resource Description
Framework 1.1 [[RDF11-CONCEPTS]] and RDF Schema [[RDF-SCHEMA]]. It defines a number of distinct entailment regimes and corresponding patterns of entailment. It is part of a suite of documents which comprise the full specification of RDF 1.1.</p>
</section>
@@ -172,7 +156,7 @@
</section>
<section id="conformance"><p>This specification, <em>RDF 1.1 Semantics</em>, is normative for RDF semantics and the validity of RDF inference processes. It is not normative for many aspects of RDF meaning which are not described or specified by this semantics, including social issues of how IRIs are assigned meanings in use and how the referents of IRIs are related to Web content expressed in other media such as natural language texts. </p></section>
-
+
<section>
<h2 id="extensions">Semantic Extensions and Entailment Regimes</h2>
<p>RDF is intended for use as a base notation for a variety of extended notations such as OWL [[OWL2-OVERVIEW]] and RIF [[RIF-OVERVIEW]], whose expressions can be encoded as RDF graphs which use a particular vocabulary with a specially defined meaning. Also, particular IRI vocabularies may be given meanings by other specifications or conventions. When such extra meanings are assumed, a given RDF graph may support more extensive entailments than are sanctioned by the basic RDF semantics. In general, the more assumptions that are made about the meanings of IRIs in an RDF graph, the more entailments follow from those assumptions. </p>
@@ -196,46 +180,46 @@
<p>The words <dfn>denotes</dfn> and <dfn>refers to</dfn> are used interchangeably as synonyms for the relationship between an IRI or literal and what it refers to in a given interpretation, itself called the <dfn>referent</dfn> or <dfn>denotation</dfn>. IRI meanings may also be determined by other constraints external to the RDF semantics; when we wish to refer to such an externally defined naming relationship, we will use the word <dfn>identify</dfn> and its cognates. For example, the fact that the IRI <code>http://www.w3.org/2001/XMLSchema#decimal</code> is widely used as the name of a datatype described in the XML Schema document [[XMLSCHEMA11-2]] might be described by saying that the IRI <em>identifies</em> that datatype. If an IRI identifies something it may or may not refer to it in a given interpretation, depending on how the semantics is specified. For example, an IRI used as a graph name <a>identify</a>ing a named graph in an <a href="http://www.w3.org/TR/rdf11-concepts/#section-dataset" class="external">RDF dataset</a> may refer to something different from the graph it identifies. </p>
-<p>Throughout this document, the equality sign = indicates strict identity. The statement "A = B" means that there is one entity to which both expressions "A" and "B" refer. Angle brackets < x, y > are used to indicate an ordered pair
+<p>Throughout this document, the equality sign = indicates strict identity. The statement "A = B" means that there is one entity to which both expressions "A" and "B" refer. Angle brackets < x, y > are used to indicate an ordered pair
of x and y.</p>
-<p>Throughout this document, RDF graphs and other fragments of RDF abstract syntax are written using the notational conventions of the Turtle syntax [[!TURTLE-CR]]. The namespace prefixes <code>rdf:</code> <code>rdfs:</code> and <code>xsd:</code> are used as in [[!RDF11-CONCEPTS]], <a href="http://www.w3.org/TR/rdf11-concepts/#vocabularies">section 1.4</a>. When the exact IRI does not matter, the prefix <code>ex:</code> is used. When stating general rules or conditions we use three-character variables such as aaa, xxx, sss to indicate arbitrary IRIs, literals, or other components of RDF syntax. Some cases are illustrated by node-arc diagrams showing the graph structure directly.</p>
+<p>Throughout this document, RDF graphs and other fragments of RDF abstract syntax are written using the notational conventions of the Turtle syntax [[!TURTLE]]. The namespace prefixes <code>rdf:</code> <code>rdfs:</code> and <code>xsd:</code> are used as in [[!RDF11-CONCEPTS]], <a href="http://www.w3.org/TR/rdf11-concepts/#vocabularies">section 1.4</a>. When the exact IRI does not matter, the prefix <code>ex:</code> is used. When stating general rules or conditions we use three-character variables such as aaa, xxx, sss to indicate arbitrary IRIs, literals, or other components of RDF syntax. Some cases are illustrated by node-arc diagrams showing the graph structure directly.</p>
<p>A <dfn>name</dfn> is any IRI or literal. A typed literal contains
- two <a>name</a>s: itself and its internal type
- IRI. A <dfn>vocabulary</dfn> is a set of <a>name</a>s.
+ two <a>name</a>s: itself and its internal type
+ IRI. A <dfn>vocabulary</dfn> is a set of <a>name</a>s.
</p>
<p>The <dfn>empty graph</dfn> is the empty set of triples. </p>
-<p>A <dfn>subgraph</dfn> of an RDF graph is a subset
- of the triples in the graph. A triple is identified with the singleton set
- containing it, so that each triple in a graph is considered to be a subgraph.
+<p>A <dfn>subgraph</dfn> of an RDF graph is a subset
+ of the triples in the graph. A triple is identified with the singleton set
+ containing it, so that each triple in a graph is considered to be a subgraph.
A <dfn>proper subgraph</dfn> is a proper subset of the triples in the graph. </p>
-
-<p>A <dfn>ground</dfn> RDF graph is one that contains no blank
+
+<p>A <dfn>ground</dfn> RDF graph is one that contains no blank
nodes.</p>
-<p>Suppose that M is a functional mapping from a set of blank
- nodes to some set of literals, blank nodes and IRIs. Any graph obtained
- from a graph G by replacing some or all of the blank nodes N in G by M(N) is
- an <dfn>instance</dfn> of G. Any graph is an instance of itself,
+<p>Suppose that M is a functional mapping from a set of blank
+ nodes to some set of literals, blank nodes and IRIs. Any graph obtained
+ from a graph G by replacing some or all of the blank nodes N in G by M(N) is
+ an <dfn>instance</dfn> of G. Any graph is an instance of itself,
an instance of an instance of G is an instance of G,
- and if H is an instance of G then every triple in H is an instance of at least one triple
+ and if H is an instance of G then every triple in H is an instance of at least one triple
in G.</p>
-<p>An <dfn>instance with respect to</dfn> a vocabulary
- V is an <a>instance</a> in which all the
- <a>name</a>s in the instance that were substituted
- for blank nodes in the original are <a>name</a>s
+<p>An <dfn>instance with respect to</dfn> a vocabulary
+ V is an <a>instance</a> in which all the
+ <a>name</a>s in the instance that were substituted
+ for blank nodes in the original are <a>name</a>s
from V.</p>
-<p>A <dfn>proper instance</dfn> of a graph
- is an <a>instance</a> in which a blank node has been replaced by a <a>name</a>, or two blank
+<p>A <dfn>proper instance</dfn> of a graph
+ is an <a>instance</a> in which a blank node has been replaced by a <a>name</a>, or two blank
nodes in the graph have been mapped into the same node in the instance. </p>
-<p>Two graphs are <a class="externalDFN" href="http://www.w3.org/TR/rdf11-concepts/#graph-isomorphism">isomorphic</a> when each maps into the other by a 1:1 mapping on blank nodes. Isomorphic graphs are mutual instances with an invertible instance
+<p>Two graphs are <a class="externalDFN" href="http://www.w3.org/TR/rdf11-concepts/#graph-isomorphism">isomorphic</a> when each maps into the other by a 1:1 mapping on blank nodes. Isomorphic graphs are mutual instances with an invertible instance
mapping. As blank nodes have no particular identity beyond their location in a graph, we will often treat isomorphic graphs as identical.</p>
-<p >An RDF graph is <dfn>lean</dfn> if it has no instance which is
- a proper subgraph of itself. Non-lean graphs have internal redundancy
+<p >An RDF graph is <dfn>lean</dfn> if it has no instance which is
+ a proper subgraph of itself. Non-lean graphs have internal redundancy
and express the same content as their lean subgraphs. For example, the graph</p>
<p ><code>ex:a ex:p _:x .<br/>
_:y ex:p _:x .</code></p>
@@ -254,7 +238,7 @@
the same document or from the same <a class="externalDFN" href="http://www.w3.org/TR/rdf11-concepts/#dfn-rdf-source">RDF source</a>.</p>
<p> RDF applications which manipulate concrete syntaxes for RDF which use blank node identifiers should take care to keep track of the identity of the blank nodes they identify. Blank node identifiers often have a local scope, so when RDF from different sources is combined, identifiers may have to be changed in order to avoid accidental conflation of distinct blank nodes.</p>
-<p> For example, two documents may both use the blank node identifier "<code>_:x</code>" to identify a blank node, but unless these documents are in a shared identifier scope or are derived from a common source, the occurrences of "<code>_:x</code>" in one document will identify a different blank node than the one in the graph described by the other document. When graphs are formed by combining RDF from multiple sources, it may be necessary to <dfn>standardize</dfn> apart the blank node identifiers by replacing them by others which do not occur in the other document(s). For example, the two graphs represented by the following texts: </p>
+<p> For example, two documents may both use the blank node identifier "<code>_:x</code>" to identify a blank node, but unless these documents are in a shared identifier scope or are derived from a common source, the occurrences of "<code>_:x</code>" in one document will identify a different blank node than the one in the graph described by the other document. When graphs are formed by combining RDF from multiple sources, it may be necessary to <dfn>standardize</dfn> apart the blank node identifiers by replacing them by others which do not occur in the other document(s). For example, the two graphs represented by the following texts: </p>
<p><code>ex:a ex:p _:x . </code><br/><br/>
<img src="RDF11SemanticsDiagrams/example1.jpg" alt="Graph 1" /></p>
<p><code>ex:b ex:q _:x . </code><br/><br/>
@@ -278,7 +262,7 @@
<p>in which the blank node identifiers have been <a>standardize</a>d apart to avoid conflating the distinct blank nodes. (The particular blank node identifiers used have no significance, only that they are distinct.) </p>
<p>It is possible for two or more graphs to share a blank node, for example if they are subgraphs of a single larger graph or derived from a common source. In this case, the union of a set of graphs preserves the identity of blank nodes shared between the graphs. In general, the union of a set of RDF graphs accurately represents the same semantic content as the graphs themselves, whether or not they share blank nodes. </p>
-<p>A related operation, called <dfn>merging</dfn>, takes the union after forcing any shared blank nodes, which occur in more than one graph, to be distinct in each graph. The resulting graph is called the <dfn>merge</dfn>. The merge of subgraphs of a graph may be larger than the original graph. For example, the result of merging the two singleton subgraphs of the three-node graph</p>
+<p>A related operation, called <dfn>merging</dfn>, takes the union after forcing any shared blank nodes, which occur in more than one graph, to be distinct in each graph. The resulting graph is called the <dfn>merge</dfn>. The merge of subgraphs of a graph may be larger than the original graph. For example, the result of merging the two singleton subgraphs of the three-node graph</p>
<p><img src="RDF11SemanticsDiagrams/example3.jpg" alt="Three-node Graph"></p>
@@ -295,12 +279,12 @@
<section>
<h2 id="simple"> Simple Interpretations</h2>
-
+
<p>This section defines the basic notions of simple interpretation and truth for RDF graphs. All <a>semantic extension</a>s of any vocabulary or higher-level notation encoded in RDF MUST conform to these minimal truth conditions. Other <a>semantic extension</a>s may extend and add to these, but they MUST NOT modify or negate them. For example, because simple interpretations are mappings which apply to IRIs, a <a>semantic extension</a> cannot interpret different occurrences of a single IRI differently.</p>
<p>The entire semantics applies to <a>RDF graph</a>s, not to <a>RDF source</a>s. An <a>RDF source</a> has a semantic meaning only through the graph that is its value at a given time, or in a given state. Graphs cannot change their semantics with time.</p>
-
+
<p>A <dfn>simple interpretation</dfn> I is a structure consisting of:</p>
<div class="tabletitle">Definition of a simple interpretation.</div>
@@ -329,13 +313,13 @@
</p>
<p>The distinction between IR and IL will become significant below when the semantics of datatypes are defined. IL is allowed to be partial because some literals may fail to have a referent. </p>
-<p class="technote">
+<p class="technote">
It is conventional to map a relation name to a relational extension directly. This however presumes that the vocabulary is segregated into relation names and individual names, and RDF makes no such assumption. Moreover, RDF allows an IRI to be used as a relation name applied to itself as an argument. Such self-application structures are used in RDFS, for example. The use of the IEXT mapping to distinguish the relation as an object from its relational extension accommodates both of these requirements. It also provides for a notion of RDFS 'class' which can be distinguished from its set-theoretic extension. A similar technique is used in the ISO/IEC Common Logic standard [[ISO24707]].
</p>
- <p>The denotation of a ground RDF graph in a simple interpretation I is then given by the following
+ <p>The denotation of a ground RDF graph in a simple interpretation I is then given by the following
rules, where the interpretation is also treated as a function from expressions (names, triples and graphs) to elements of the universe and truth values:</p>
@@ -344,7 +328,7 @@
<tbody>
- <tr>
+ <tr>
<td class="semantictable">if E is a literal then I(E) = IL(E)</td>
</tr>
@@ -353,9 +337,9 @@
</tr>
<tr>
- <td class="semantictable"><p>if E is a ground triple s p o<code>.</code>
+ <td class="semantictable"><p>if E is a ground triple s p o<code>.</code>
then I(E) = true if </p>
- <p>I(p) is in IP and the pair <I(s),I(o)>
+ <p>I(p) is in IP and the pair <I(s),I(o)>
is in IEXT(I(p))</p>
<p>otherwise I(E) = false.</p></td>
</tr>
@@ -377,8 +361,8 @@
<section>
<h3 id="blank_nodes">Blank nodes</h3>
-
-<p>Blank nodes are treated as simply indicating the existence of a thing, without using an IRI to <a>identify</a> any particular thing. This is not the same as assuming that the blank node indicates an 'unknown' IRI.
+
+<p>Blank nodes are treated as simply indicating the existence of a thing, without using an IRI to <a>identify</a> any particular thing. This is not the same as assuming that the blank node indicates an 'unknown' IRI.
</p>
<p> Suppose I is a simple interpretation and A is a mapping from a set of blank nodes to the universe IR of I. Define the mapping [I+A] to be I on <a>name</a>s, and A on blank nodes on the set: [I+A](x)=I(x) when x is a <a>name</a> and [I+A](x)=A(x) when x is a blank node; and extend this mapping to triples and RDF graphs using the rules given above for ground graphs. Then the semantic conditions for an RDF graph are:</p>
@@ -386,7 +370,7 @@
<div class="tabletitle">Semantic condition for blank nodes.</div>
<table border="1">
<tbody>
-
+
<tr>
<td class="semantictable">If E is an RDF graph then I(E) = true if [I+A](E) =
@@ -396,7 +380,7 @@
</tbody>
</table>
-<p>Mappings from blank nodes to referents are not part of the definition of a simple interpretation, since the truth condition refers only to <em>some</em> such mapping.
+<p>Mappings from blank nodes to referents are not part of the definition of a simple interpretation, since the truth condition refers only to <em>some</em> such mapping.
Blank nodes themselves differ from other nodes in not being assigned
a denotation by a simple interpretation, reflecting the intuition that
they have no 'global' meaning. </p>
@@ -408,7 +392,7 @@
<p> and a simple interpretation I over the universe {Alice, Bob, Monica, Ruth} with:<br/>
I(<code>ex:Alice</code>)=Alice, I(<code>ex:Bob</code>)=Bob, IEXT(I(<code>ex:hasChild</code>))={<Alice,Monica>,<Bob,Ruth> }<br/></p>
<p>Each of the inner graphs is true under this interpretation, but the two of them together is not, because the three-node graph says that Alice and Bob have a child together. In order to capture the full meaning of graphs sharing a blank node, it is necessary to consider the union graph containing all the triples which contain the blank node.</p>
-<p class="technote"> RDF graphs can be viewed as conjunctions of simple atomic sentences in first-order logic, where blank nodes are free variables which are understood to be existential. Taking the union of two graphs is then analogous to syntactic conjunction in this syntax. RDF syntax has no explicit variable-binding quantifiers, so the truth conditions for any RDF graph treat the free variables in that graph as existentially quantified in that graph. Taking the union of graphs which share a blank node changes the implied quantifier scopes.
+<p class="technote"> RDF graphs can be viewed as conjunctions of simple atomic sentences in first-order logic, where blank nodes are free variables which are understood to be existential. Taking the union of two graphs is then analogous to syntactic conjunction in this syntax. RDF syntax has no explicit variable-binding quantifiers, so the truth conditions for any RDF graph treat the free variables in that graph as existentially quantified in that graph. Taking the union of graphs which share a blank node changes the implied quantifier scopes.
</p>
@@ -421,7 +405,7 @@
<p>An RDF graph is true exactly when:</p>
<p>1. the IRIs and literals in subject or object position in the graph all refer to things,</p><p>2. there is some way to interpret all the blank nodes in the graph as referring to things,</p><p>3. the IRIs in property position refer to binary relationships,</p><p>4. and under these interpretations, each triple S P O in the graph asserts that the thing referred to as S, and the thing referred to as O, do in fact stand in the relationship referred to by P. </p>
-
+
</section>
-->
@@ -435,7 +419,7 @@
<p><a id="defvalid">Any process which constructs a graph E from
some other graph S is (simply) <dfn>valid</dfn> if S
- simply entails E in every case, otherwise <dfn>invalid.</dfn></a></p>
+ simply entails E in every case, otherwise <dfn>invalid.</dfn></a></p>
<p>The fact that an inference is valid should not be understood as meaning that any RDF application is obliged or required to make the inference. Similarly, the logical invalidity of some RDF transformation or process does not mean that the process is incorrect or prohibited. Nothing in this specification requires or prohibits any particular operations on RDF graphs or sources. Entailment and validity are concerned solely with establishing the conditions on such operations which guarantee the preservation of truth. While logically invalid processes, which do not follow valid entailments, are not prohibited, users should be aware that they may be at risk of introducing falsehoods into true RDF data. Nevertheless, particular uses of logically invalid processes may be justified and appropriate for data processing under circumstances where truth can be ensured by other means. </p>
@@ -445,7 +429,7 @@
<section class="informative">
-<h3 id="simple_entailment_properties">Properties of simple entailment (Informative) </h3>
+<h3 id="simple_entailment_properties">Properties of simple entailment (Informative) </h3>
<p>The properties described here apply only to simple entailment, not to extended notions of entailment introduced in later sections. Proofs are given in Appendix C. </p>
<p class="fact">Every graph is satisfiable.</p>
@@ -455,38 +439,38 @@
<p>The following <dfn>interpolation</dfn> <strong>lemma</strong> </p>
<p class="fact">
- G simply entails a graph E if and only if a subgraph of G is an instance of E.
+ G simply entails a graph E if and only if a subgraph of G is an instance of E.
</p>
-<p> completely characterizes simple entailment in syntactic
- terms. To detect whether one RDF graph simply entails another, check that
+<p> completely characterizes simple entailment in syntactic
+ terms. To detect whether one RDF graph simply entails another, check that
there is some instance of the entailed graph which is a subset of the first graph. </p>
<p class="technote">This is clearly decidable, but it is also difficult to determine in general, since one can encode the NP-hard subgraph problem (detecting whether one mathematical graph is a subgraph of another) as detecting simple entailment between RDF graphs. This construction (due to Jeremy Carroll) uses graphs containing many blank nodes, which are unlikely to occur in practice. The complexity of checking simple entailment is reduced by having fewer blank nodes in the conclusion E. When E is a <a>ground</a> graph, it is simply a matter of checking the subset relationship on sets of triples.</p>
<p><a>Interpolation</a> has a number of direct consequences, for example:</p>
-<p class="fact"> The <a>empty graph</a> is entailed by
+<p class="fact"> The <a>empty graph</a> is entailed by
any graph, and does not entail any graph except itself.
<!-- <a href="#emptygraphlemmaprf" class="termref">[Proof]</a> -->
</p>
<p class="fact"> A graph entails all its subgraphs.
<!-- <a href="#subglemprf" class="termref">[Proof]</a> -->
</p>
-<p class="fact"> A graph
+<p class="fact"> A graph
is entailed by any of its <a>instance</a>s.
<!-- <a href="#instlemprf" class="termref"> [Proof]</a> -->
</p>
-<p class="fact"> If
- E is a <a>lean</a> graph and E' is a <a>proper instance</a> of E, then E does
- not entail E'.
+<p class="fact"> If
+ E is a <a>lean</a> graph and E' is a <a>proper instance</a> of E, then E does
+ not entail E'.
</p>
-
+
<p class="fact"> If S is a subgraph of S' and S entails E, then S' entails E.
<!-- <a href="#monotonicitylemmaprf" class="termref"> [Proof]</a> -->
</p>
-<p class="fact">
- If S entails a finite graph E, then some finite subset S' of S entails E.
+<p class="fact">
+ If S entails a finite graph E, then some finite subset S' of S entails E.
<!-- <a href="#compactlemmaprf" class="termref"> [Proof]</a> -->
</p>
<p>The property just above is called <em>compactness</em> - RDF is compact. As RDF graphs can be infinite, this is sometimes important.</p>
@@ -498,7 +482,7 @@
</section>
<section class="informative"><h2 id="skolemization">Skolemization (Informative)</h2>
-<p><a class="externaldefinition">Skolemization</a> is a transformation on RDF graphs which eliminates blank nodes by replacing them with "new" IRIs, which means IRIs which are coined for this purpose and are therefore guaranteed to not occur in any other RDF graph (at the time of creation). See <a href="http://www.w3.org/TR/rdf11-concepts/#section-skolemization">Section 3.5</a> of [[!RDF11-CONCEPTS]] for a fuller discussion. </p>
+<p><a class="externaldefinition">Skolemization</a> is a transformation on RDF graphs which eliminates blank nodes by replacing them with "new" IRIs, which means IRIs which are coined for this purpose and are therefore guaranteed to not occur in any other RDF graph (at the time of creation). See <a href="http://www.w3.org/TR/rdf11-concepts/#section-skolemization">Section 3.5</a> of [[!RDF11-CONCEPTS]] for a fuller discussion. </p>
<p> Suppose G is a graph containing blank nodes and sk is a skolemization mapping from the blank nodes in G to the skolem IRIs which are substituted for them, so that sk(G) is a skolemization of G. Then the semantic relationship between them can be summarized as follows. </p>
<p class="fact"> sk(G) simply entails G (since sk(G) is an instance of G.)</p>
@@ -518,10 +502,10 @@
<p class="changenote">In the 2004 RDF 1.0 specification, the semantics of datatypes referred to datatype maps. The current treatment subsumes datatype maps into the interpretation mapping on recognized IRIs.</p>
-<p>RDF literals and datatypes are fully described in <a href="http://www.w3.org/TR/rdf11-concepts/#section-Datatypes"> Section 5</a> of [[!RDF11-CONCEPTS]]. In summary: RDF literals are either language-tagged strings, or datatyped literals which
+<p>RDF literals and datatypes are fully described in <a href="http://www.w3.org/TR/rdf11-concepts/#section-Datatypes"> Section 5</a> of [[!RDF11-CONCEPTS]]. In summary: RDF literals are either language-tagged strings, or datatyped literals which
combine a string and an IRI <a>identify</a>ing a datatype. A datatype is understood to define a partial mapping, called the <dfn>lexical-to-value mapping</dfn>, from character strings to values. The function <dfn>L2V</dfn> maps datatypes to their lexical-to-value mapping. A literal with datatype d denotes the value obtained by applying this mapping to the character string sss: L2V(d)(sss). If the lexical-to-value mapping gives no value for the literal string, then the literal has no referent. The <dfn>value space</dfn> of a datatype is the range of the <a>lexical-to-value mapping</a>. Every literal with that type either refers to a value in the value space of the type, or fails to refer at all. An <dfn>ill-typed</dfn> literal is one whose datatype IRI is <a>recognize</a>d, but whose character string is assigned no value by the <a>lexical-to-value mapping</a> for that datatype. </p>
-<p> RDF processors are not REQUIRED to <a>recognize</a> any datatype IRIs other than <a href="http://www.w3.org/TR/rdf11-concepts/#dfn-language-tagged-string"><code>rdf:langString</code></a> and <a href="http://www.w3.org/TR/xmlschema11-2/#string"><code>xsd:string</code></a>, but when IRIs listed in <a href="http://www.w3.org/TR/rdf11-concepts/#section-Datatypes">Section 5</a> of [[!RDF11-CONCEPTS]] are <a>recognize</a>d, they MUST be interpreted as described there, and when the IRI <code>rdf:PlainLiteral</code> is <a>recognize</a>d, it MUST be interpreted to refer to the datatype defined in [[!RDF-PLAIN-LITERAL]]. RDF processors MAY recognize other datatype IRIs, but when other datatype IRIs are <a>recognize</a>d, the mapping between a <a>recognize</a>d IRI and the datatype it refers to MUST be specified unambiguously, and MUST be fixed during all RDF transformations or manipulations.</p>
+<p> RDF processors are not REQUIRED to <a>recognize</a> any datatype IRIs other than <a href="http://www.w3.org/TR/rdf11-concepts/#dfn-language-tagged-string"><code>rdf:langString</code></a> and <a href="http://www.w3.org/TR/xmlschema11-2/#string"><code>xsd:string</code></a>, but when IRIs listed in <a href="http://www.w3.org/TR/rdf11-concepts/#section-Datatypes">Section 5</a> of [[!RDF11-CONCEPTS]] are <a>recognize</a>d, they MUST be interpreted as described there, and when the IRI <code>rdf:PlainLiteral</code> is <a>recognize</a>d, it MUST be interpreted to refer to the datatype defined in [[!RDF-PLAIN-LITERAL]]. RDF processors MAY recognize other datatype IRIs, but when other datatype IRIs are <a>recognize</a>d, the mapping between a <a>recognize</a>d IRI and the datatype it refers to MUST be specified unambiguously, and MUST be fixed during all RDF transformations or manipulations.</p>
<p>Literals with <a href="http://www.w3.org/TR/rdf11-concepts/#dfn-language-tagged-string"><code>rdf:langString</code></a> as their datatype are an exceptional case which are given a special treatment. The IRI <code>rdf:langString</code> is classified as a datatype IRI, and interpreted to refer to a datatype, even though no L2V mapping is defined for it. The value space of <code>rdf:langString</code> is the set of all pairs of a string with a language tag. The semantics of literals with this as their type are given below. </p>
@@ -529,7 +513,7 @@
<section id="D_interpretations"><h2>D-interpretations</h2>
-<p>Let D be a set of IRIs <a>identify</a>ing datatypes. A <dfn>(simple) D-interpretation</dfn> is a <a>simple interpretation</a> which satisfies the following conditions:</p>
+<p>Let D be a set of IRIs <a>identify</a>ing datatypes. A <dfn>(simple) D-interpretation</dfn> is a <a>simple interpretation</a> which satisfies the following conditions:</p>
<div class="tabletitle">Semantic conditions for datatyped literals.</div>
<table border="1">
@@ -542,7 +526,7 @@
<p>If the literal is <a>ill-typed</a> then the L2V(I(aaa)) mapping has no value, and so the literal cannot denote anything. In this case, any triple containing the literal must be false. Thus, any triple, and hence any graph, containing an <a>ill-typed</a> literal will be <a>D-unsatisfiable</a>, i.e. false in every D-interpretation. This applies only to literals typed with recognized datatype IRIs in D; literals with an unrecognized type IRI are not <a>ill-typed</a> and cannot give rise to a <a>D-unsatisfiable</a> graph. </p>
-<p>The special datatype <a href="http://www.w3.org/TR/rdf11-concepts/#dfn-language-tagged-string"><code>rdf:langString</code></a> has no <a>ill-typed</a> literals. Any syntactically legal literal with this type will denote a value in every D-interpretation where D included <code>rdf:langString</code>. The only ill-typed literals of type <a href="http://www.w3.org/TR/xmlschema11-2/#string"><code>xsd:string</code></a> are those containing a Unicode code point which does not match the <a href="http://www.w3.org/TR/xml11/#NT-Char"><em>Char</em> production</a> in [[XML10]]. Such strings cannot be written in an XML-compatible surface syntax.
+<p>The special datatype <a href="http://www.w3.org/TR/rdf11-concepts/#dfn-language-tagged-string"><code>rdf:langString</code></a> has no <a>ill-typed</a> literals. Any syntactically legal literal with this type will denote a value in every D-interpretation where D included <code>rdf:langString</code>. The only ill-typed literals of type <a href="http://www.w3.org/TR/xmlschema11-2/#string"><code>xsd:string</code></a> are those containing a Unicode code point which does not match the <a href="http://www.w3.org/TR/xml11/#NT-Char"><em>Char</em> production</a> in [[XML10]]. Such strings cannot be written in an XML-compatible surface syntax.
</p>
@@ -571,7 +555,7 @@
<section class="informative"> <h4 id="datatype_entailment_patterns">Patterns of datatype entailment (Informative)</h4>
-<p>Unlike <a title="simply entails">simple entailment</a>, it is not possible to give a single syntactic criterion to detect all D-entailments, which
+<p>Unlike <a title="simply entails">simple entailment</a>, it is not possible to give a single syntactic criterion to detect all D-entailments, which
can hold because of particular properties of the lexical-to-value mappings of the <a>recognize</a>d datatypes. For example, if D contains <code>xsd:decimal</code> then </p>
<p><code>ex:a ex:p "25.0"^^xsd:decimal .</code></p>
@@ -595,24 +579,24 @@
</section>
</section>
<section><h2 id="rdf_d_interpretations">RDF Interpretations</h2>
- <p >RDF interpretations impose extra semantic conditions on <code>xsd:string</code> and part of the infinite
- set of IRIs with the namespace prefix <code>rdf:</code> .
+ <p >RDF interpretations impose extra semantic conditions on <code>xsd:string</code> and part of the infinite
+ set of IRIs with the namespace prefix <code>rdf:</code> .
-<p>An <dfn>RDF interpretation</dfn> <strong>recognizing D</strong> is a <a>D-interpretation</a> I where D includes <code>rdf:langString</code> and <code>xsd:string</code>, and which satisfies:</p>
-<div class="tabletitle">RDF semantic conditions.</div>
+<p>An <dfn>RDF interpretation</dfn> <strong>recognizing D</strong> is a <a>D-interpretation</a> I where D includes <code>rdf:langString</code> and <code>xsd:string</code>, and which satisfies:</p>
+<div class="tabletitle">RDF semantic conditions.</div>
<table border="1">
<tbody>
- <tr>
- <td class="semantictable"><a id="rdfsemcond1"></a>x is
+ <tr>
+ <td class="semantictable"><a id="rdfsemcond1"></a>x is
in IP if and only if <x, I(<code>rdf:Property</code>)> is in IEXT(I(<code>rdf:type</code>))</td>
</tr>
<tr><td class="semantictable"><a id="rdfsemcond3">For every IRI aaa in D, < x, I(aaa) > is in IEXT(I(<code>rdf:type</code>)) if and only if x is in the value space of I(aaa)</a></td></tr>
-
+
</tbody>
</table>
- <p>and satisfies every triple in the following infinite set:</p>
- <div class="tabletitle">RDF axioms.</div>
+ <p>and satisfies every triple in the following infinite set:</p>
+ <div class="tabletitle">RDF axioms.</div>
<table border="1">
<tr>
@@ -628,7 +612,7 @@
rdf:_2 rdf:type rdf:Property .<br/>
... <br/>
</code>
-
+
</td>
</tr>
</table>
@@ -651,24 +635,24 @@
<section class="informative"><h4 id="rdf_entailment_patterns">Patterns of RDF entailment (Informative)</h4>
-<p> The last semantic condition in the above table gives the following entailment pattern for <a>recognize</a>d datatype IRIs: </p>
+<p> The last semantic condition in the above table gives the following entailment pattern for <a>recognize</a>d datatype IRIs: </p>
-<div class="tabletitle">RDF entailment pattern.</div>
+<div class="tabletitle">RDF entailment pattern.</div>
<table border="1" >
<tbody>
- <tr>
+ <tr>
<th > </th>
<th ><strong>if S contains</strong></th>
<th ><strong>then S RDF entails, recognizing D</strong></th>
</tr>
- <tr >
+ <tr >
<td class="othertable"><dfn>rdfD1</dfn></td>
<td class="othertable"> xxx aaa <code>"</code>sss<code>"^^</code>ddd <code>.</code> <br/>
for ddd in D</td>
<td class="othertable">xxx aaa _:nnn <code>.</code><br/>
_:nnn <code>rdf:type</code> ddd <code>.</code></td>
</tr>
-
+
</tbody>
</table>
<p>Note, this is valid even when the literal is <a>ill-typed</a>, since an unsatisfiable graph entails any triple.</p>
@@ -685,19 +669,19 @@
<table border="1" >
<tbody>
- <tr>
+ <tr>
<th > </th>
<th ><strong>if S contains</strong></th>
<th ><strong>then S RDF entails, recognizing D</strong></th>
</tr>
-
+
<tr>
<td class="othertable"><dfn>rdfD2</dfn></td>
<td class="othertable">xxx aaa yyy <code>.</code></td>
<td class="othertable">aaa <code>rdf:type rdf:Property .</code> </td>
</tr>
-
-
+
+
</tbody>
</table>
@@ -727,7 +711,7 @@
</section>
<section><h2 id="rdfs_interpretations">RDFS Interpretations</h2>
<p>RDF Schema [[RDF-SCHEMA]]
- extends RDF to a larger vocabulary
+ extends RDF to a larger vocabulary
with more complex semantic constraints:</p>
<div >
@@ -747,30 +731,30 @@
</tbody>
</table>
</div>
-<p>(<code>rdfs:comment</code>,<code> rdfs:seeAlso</code>, <code>rdfs:isDefinedBy</code>
- and <code>rdfs:label</code> are included here because some constraints which
- apply to their use can be stated using <code>rdfs:domain</code>,<code> rdfs:range</code>
- and <code>rdfs:subPropertyOf</code>. Other than this, the formal semantics does
+<p>(<code>rdfs:comment</code>,<code> rdfs:seeAlso</code>, <code>rdfs:isDefinedBy</code>
+ and <code>rdfs:label</code> are included here because some constraints which
+ apply to their use can be stated using <code>rdfs:domain</code>,<code> rdfs:range</code>
+ and <code>rdfs:subPropertyOf</code>. Other than this, the formal semantics does
not constrain their meanings.)</p>
-<p>It is convenient to state the RDFS semantics
- in terms of a new semantic construct, a <dfn>class</dfn>, i.e. a resource which represents
- a set of things in the universe which all have that class as a value of their
- <code>rdf:type</code> property. <a>Class</a>es are defined to be things of type <code>rdfs:Class</code>,
- and the set of all classes in an interpretation will be called IC.
- The semantic conditions are stated in terms of a mapping ICEXT (for the <em>C</em>lass
- <em>Ext</em>ension in I) from IC to the set of subsets of IR.</p><p> A class may have an
+<p>It is convenient to state the RDFS semantics
+ in terms of a new semantic construct, a <dfn>class</dfn>, i.e. a resource which represents
+ a set of things in the universe which all have that class as a value of their
+ <code>rdf:type</code> property. <a>Class</a>es are defined to be things of type <code>rdfs:Class</code>,
+ and the set of all classes in an interpretation will be called IC.
+ The semantic conditions are stated in terms of a mapping ICEXT (for the <em>C</em>lass
+ <em>Ext</em>ension in I) from IC to the set of subsets of IR.</p><p> A class may have an
empty class extension. Two different classes can have the same class extension.
- The class extension of <code>rdfs:Class</code> contains the class <code>rdfs:Class</code>.
+ The class extension of <code>rdfs:Class</code> contains the class <code>rdfs:Class</code>.
</p>
-
-<p> An <dfn>RDFS interpretation</dfn> (<strong>recognizing D</strong>) is an <a>RDF interpretation</a> (recognizing D) I
+
+<p> An <dfn>RDFS interpretation</dfn> (<strong>recognizing D</strong>) is an <a>RDF interpretation</a> (recognizing D) I
which satisfies the semantic conditions in the following table, and all the triples in the subsequent table of RDFS axiomatic triples. </p>
-
+
<div class="tabletitle">RDFS semantic conditions.</div>
<table border="1">
- <tr>
-
+ <tr>
+
<td class="semantictable"> <p><a id="rdfssemcond1"></a>ICEXT(y) is defined to be { x : < x,y > is in IEXT(I(<code>rdf:type</code>)) }</p>
<p>IC is defined to be ICEXT(I(<code>rdfs:Class</code>))</p>
<p>LV is defined to be ICEXT(I(<code>rdfs:Literal</code>))</p>
@@ -780,56 +764,56 @@
<p>for every IRI aaa in D, I(aaa) is in ICEXT(I(<code>rdfs:Datatype</code>)) </p>
</td>
</tr>
- <tr>
-
- <td class="semantictable"> <p><a id="rdfssemcond2"></a>If
- < x,y > is in IEXT(I(<code>rdfs:domain</code>)) and < u,v > is
+ <tr>
+
+ <td class="semantictable"> <p><a id="rdfssemcond2"></a>If
+ < x,y > is in IEXT(I(<code>rdfs:domain</code>)) and < u,v > is
in IEXT(x) then u is in ICEXT(y)</p></td>
</tr>
- <tr>
-
- <td class="semantictable"> <p><a id="rdfssemcond3"></a>If
- < x,y > is in IEXT(I(<code>rdfs:range</code>)) and < u,v > is
+ <tr>
+
+ <td class="semantictable"> <p><a id="rdfssemcond3"></a>If
+ < x,y > is in IEXT(I(<code>rdfs:range</code>)) and < u,v > is
in IEXT(x) then v is in ICEXT(y)</p></td>
</tr>
- <tr>
-
- <td class="semantictable"><p><a id="rdfssemcond4"></a>IEXT(I(<code>rdfs:subPropertyOf</code>))
+ <tr>
+
+ <td class="semantictable"><p><a id="rdfssemcond4"></a>IEXT(I(<code>rdfs:subPropertyOf</code>))
is transitive and reflexive on IP</p></td>
</tr>
- <tr>
-
- <td class="semantictable"> <p><a id="rdfssemcond5"></a>If
- <x,y> is in IEXT(I(<code>rdfs:subPropertyOf</code>)) then x and
+ <tr>
+
+ <td class="semantictable"> <p><a id="rdfssemcond5"></a>If
+ <x,y> is in IEXT(I(<code>rdfs:subPropertyOf</code>)) then x and
y are in IP and IEXT(x) is a subset of IEXT(y)</p></td>
</tr>
- <tr>
-
- <td class="semantictable"><p><a id="rdfssemcond6"></a>If
+ <tr>
+
+ <td class="semantictable"><p><a id="rdfssemcond6"></a>If
x is in IC then < x, I(<code>rdfs:Resource</code>) > is in IEXT(I(<code>rdfs:subClassOf</code>))</p></td>
</tr>
- <tr>
+ <tr>
- <td class="semantictable"><p><a id="rdfssemcond8"></a>IEXT(I(<code>rdfs:subClassOf</code>))
+ <td class="semantictable"><p><a id="rdfssemcond8"></a>IEXT(I(<code>rdfs:subClassOf</code>))
is transitive and reflexive on IC</p></td>
</tr>
<tr>
- <td class="semantictable"> <p><a id="rdfssemcond7"></a>If
- < x,y > is in IEXT(I(<code>rdfs:subClassOf</code>)) then x and y are
+ <td class="semantictable"> <p><a id="rdfssemcond7"></a>If
+ < x,y > is in IEXT(I(<code>rdfs:subClassOf</code>)) then x and y are
in IC and ICEXT(x) is a subset of ICEXT(y)</p></td>
</tr>
-
- <tr>
- <td class="semantictable"><p><a id="rdfssemcond9"></a>If
+
+ <tr>
+ <td class="semantictable"><p><a id="rdfssemcond9"></a>If
x is in ICEXT(I(<code>rdfs:ContainerMembershipProperty</code>)) then:<br/>
< x, I(<code>rdfs:member</code>) > is in IEXT(I(<code>rdfs:subPropertyOf</code>))<br/>
</td>
</tr>
- <tr>
-
- <td class="semantictable"><p><a id="rdfssemcond10"></a>If
- x is in ICEXT(I(<code>rdfs:Datatype</code>)) then <span >< x,
+ <tr>
+
+ <td class="semantictable"><p><a id="rdfssemcond10"></a>If
+ x is in ICEXT(I(<code>rdfs:Datatype</code>)) then <span >< x,
I(<code>rdfs:Literal</code>) > is in IEXT(I(<code>rdfs:subClassOf</code>))</span></p></td>
</tr>
</table>
@@ -837,15 +821,15 @@
-
+
<p><a id="RDFS_axiomatic_triples"> </a>
</p>
<div class="tabletitle">RDFS axiomatic triples.</div>
<table border="1">
-
+
<tr>
-
-
+
+
<td class="ruletable"> <code>rdf:type rdfs:domain rdfs:Resource .<br/>
rdfs:domain rdfs:domain rdf:Property .<br/>
rdfs:range rdfs:domain rdf:Property .<br/>
@@ -887,7 +871,7 @@
<br/>
rdfs:isDefinedBy rdfs:subPropertyOf rdfs:seeAlso .<br/>
<br/>
-
+
rdfs:Datatype rdfs:subClassOf rdfs:Class .<br/>
<br/>
rdf:_1 rdf:type rdfs:ContainerMembershipProperty .<br/>
@@ -898,21 +882,21 @@
rdf:_2 rdfs:range rdfs:Resource . <br/>
</code>... <br/> </td>
</tr>
-
+
</table>
<p class="changenote">In the 2004 RDF 1.0 semantics, LV was defined as part of a simple interpretation structure, and the definition given here was a constraint. </p>
-<p>Since I is an <a>RDF interpretation</a>, the first condition implies that IP
+<p>Since I is an <a>RDF interpretation</a>, the first condition implies that IP
= ICEXT(I(<code>rdf:Property</code>)).</p>
<p>The semantic conditions on <a>RDF interpretation</a>s, together with the RDFS conditions on ICEXT, mean that every <a>recognize</a>d datatype can be treated as a class whose extension is the value space of the datatype, and every literal with that datatype either fails to refer, or refers to a value in that class.</p>
<p>When using RDFS semantics, the referents of all <a>recognize</a>d datatype IRIs can be considered to be in the <a>class</a> <code>rdfs:Datatype</code>. </p>
-<p>The axioms and conditions listed above have some redundancy. For example, all but one
- of the RDF axiomatic triples can be derived from the RDFS axiomatic triples
+<p>The axioms and conditions listed above have some redundancy. For example, all but one
+ of the RDF axiomatic triples can be derived from the RDFS axiomatic triples
and the semantic conditions on ICEXT,<code> rdfs:domain</code> and <code>rdfs:range</code>. </p>
-<p> Other triples which must be true in all RDFS interpretations
+<p> Other triples which must be true in all RDFS interpretations
include the following. This is not a complete set.</p>
<div class="tabletitle">Some rdfs-valid triples.</div>
<table border="1">
@@ -963,9 +947,9 @@
<h3 id="rdfs_entailment">RDFS entailment</h3>
<p>S <dfn>RDFS entails</dfn> E <strong>recognizing D</strong> when every <a>RDFS interpretation</a> recognizing D
which satisfies S also satisfies E.</p>
-<p> Since every <a>RDFS interpretation</a> is an <a>RDF interpretation</a>, if S <a>RDFS entails</a>
- E then S also <a>RDF entail</a>s E; but RDFS entailment is stronger than RDF entailment.
- Even the empty graph has a large number of RDFS entailments which are not RDF entailments,
+<p> Since every <a>RDFS interpretation</a> is an <a>RDF interpretation</a>, if S <a>RDFS entails</a>
+ E then S also <a>RDF entail</a>s E; but RDFS entailment is stronger than RDF entailment.
+ Even the empty graph has a large number of RDFS entailments which are not RDF entailments,
for example all triples of the form </p>
<p> aaa <code>rdf:type rdfs:Resource .</code></p>
<p>where aaa is an IRI, are true in all RDFS interpretations.</p>
@@ -974,86 +958,86 @@
<P>RDFS entailment holds for all the following patterns, which correspond closely to the RDFS semantic conditions:</p>
-<div class="title">RDFS entailment patterns.</div>
+<div class="title">RDFS entailment patterns.</div>
<table border="1">
<tbody>
- <tr >
+ <tr >
<th ></th>
<th >If S contains:</th>
<th >then S RDFS entails recognizing D:</th>
</tr>
<tr >
<td class="othertable"><dfn>rdfs1</dfn></td>
- <td class="othertable">any IRI aaa in D</td>
+ <td class="othertable">any IRI aaa in D</td>
<td class="othertable">aaa <code>rdf:type rdfs:Datatype . </code></td>
</tr>
- <tr >
+ <tr >
<td class="othertable"><dfn>rdfs2</dfn></td>
<td class="othertable"> aaa <code>rdfs:domain</code> xxx <code>.</code><br />
yyy aaa zzz <code>.</code></td>
<td class="othertable">yyy <code>rdf:type</code> xxx <code>.</code></td>
</tr>
- <tr >
+ <tr >
<td class="othertable"><dfn>rdfs3</dfn></td>
<td class="othertable">aaa <code>rdfs:range</code> xxx <code>.</code><br />
yyy aaa zzz <code>.</code></td>
<td class="othertable">zzz <code>rdf:type</code> xxx <code>.</code></td>
</tr>
- <tr >
+ <tr >
<td class="othertable"><dfn>rdfs4a</dfn></td>
<td class="othertable">xxx aaa yyy <code>.</code></td>
<td class="othertable">xxx <code>rdf:type rdfs:Resource .</code></td>
</tr>
- <tr >
+ <tr >
<td class="othertable"><dfn>rdfs4b</dfn></td>
<td class="othertable">xxx aaa yyy<code>.</code></td>
<td class="othertable">yyy <code>rdf:type rdfs:Resource .</code></td>
</tr>
- <tr >
+ <tr >
<td class="othertable"><dfn>rdfs5</dfn></td>
<td class="othertable"> xxx <code>rdfs:subPropertyOf</code> yyy <code>.</code><br />
yyy <code>rdfs:subPropertyOf</code> zzz <code>.</code></td>
<td class="othertable">xxx <code>rdfs:subPropertyOf</code> zzz <code>.</code></td>
</tr>
- <tr >
+ <tr >
<td class="othertable"><dfn>rdfs6</dfn></td>
<td class="othertable">xxx <code>rdf:type rdf:Property .</code></td>
<td class="othertable">xxx <code>rdfs:subPropertyOf</code> xxx <code>.</code></td>
</tr>
- <tr >
+ <tr >
<td class="othertable"><dfn>rdfs7</dfn></td>
<td class="othertable"> aaa <code>rdfs:subPropertyOf</code> bbb <code>.</code><br />
xxx aaa yyy <code>.</code></td>
<td class="othertable">xxx bbb yyy <code>.</code></td>
</tr>
- <tr >
+ <tr >
<td class="othertable"><dfn>rdfs8</dfn></td>
<td class="othertable">xxx <code>rdf:type rdfs:Class .</code></td>
<td class="othertable">xxx <code>rdfs:subClassOf rdfs:Resource .</code></td>
</tr>
- <tr >
+ <tr >
<td class="othertable"><dfn>rdfs9</dfn></td>
<td class="othertable">xxx <code>rdfs:subClassOf</code> yyy <code>.</code><br />
zzz <code>rdf:type</code> xxx <code>.</code></td>
<td class="othertable">zzz <code>rdf:type</code> yyy <code>.</code></td>
</tr>
- <tr >
+ <tr >
<td class="othertable"><dfn>rdfs10</dfn></td>
<td class="othertable">xxx <code>rdf:type rdfs:Class .</code></td>
<td class="othertable">xxx <code>rdfs:subClassOf</code> xxx <code>.</code></td>
</tr>
- <tr >
+ <tr >
<td class="othertable"><dfn>rdfs11</dfn></td>
<td class="othertable"> xxx <code>rdfs:subClassOf</code> yyy <code>.</code><br />
yyy <code>rdfs:subClassOf</code> zzz <code>.</code></td>
<td class="othertable">xxx <code>rdfs:subClassOf</code> zzz <code>.</code></td>
</tr>
- <tr >
+ <tr >
<td class="othertable"><dfn>rdfs12</dfn></td>
<td class="othertable">xxx <code>rdf:type rdfs:ContainerMembershipProperty .</code></td>
<td class="othertable">xxx <code>rdfs:subPropertyOf rdfs:member .</code></td>
</tr>
- <tr >
+ <tr >
<td class="othertable"><dfn>rdfs13</dfn></td>
<td class="othertable">xxx <code>rdf:type rdfs:Datatype .</code></td>
<td class="othertable">xxx <code>rdfs:subClassOf rdfs:Literal .</code></td>
@@ -1105,34 +1089,34 @@
<table border="1" >
<tbody>
- <tr>
-
+ <tr>
+
<th > </th>
<th >RDF entails</th>
</tr>
-
+
<tr>
-
+
<td class="othertable"><code>ex:a ex:p "string"^^xsd:string .<br/>
ex:b ex:q "string"^^xsd:string .</code></td>
<td class="othertable"><code>ex:a ex:p _:b .<br/>
ex:b ex:q _:b .<br/>
_:b rdf:type xsd:string .</code> </td>
</tr>
-
- <tr>
-
+
+ <tr>
+
<th > </th>
<th >RDFS entails</th>
</tr>
<tr>
-
+
<td class="othertable"><code>ex:a rdfs:subPropertyOf _:b .<br/>
_:b rdfs:domain ex:c .<br/>
ex:d ex:a ex:e .</code></td>
<td class="othertable"><code>ex:d rdf:type ex:c .</code> </td>
- </tr>
-
+ </tr>
+
</tbody>
</table>
<p> Both of these can be handled by allowing the rules to apply to a generalization of the RDF syntax in which literals may occur in subject position and blank nodes may occur in predicate position. </p>
@@ -1140,21 +1124,21 @@
<!--<p>Define a <dfn>generalized RDF triple</dfn> to be a triple <x, y, z> where x and z can be an IRI, a blank node or a literal, and y can be an IRI or a blank node; and extend this to the rest of RDF, so that a generalized RDF graph is a set of generalized RDF triples. -->
<p>Consider <a class="externalDFN" href="http://www.w3.org/TR/rdf11-concepts/#section-generalized-rdf">generalized RDF triples, graphs, and datasets</a> instead of RDF triples, graphs and datasets (extending the generalization used in [[HORST04]] and following exactly the terms used in [[OWL2-PROFILES]]). The semantics described in this document applies to the generalization without change, so that the notions of interpretation, satisfiability and entailment can be used freely. Then we can replace the first RDF entailment pattern with the simpler and more direct</p>
-<div class="tabletitle">G-RDF-D entailment pattern.</div>
+<div class="tabletitle">G-RDF-D entailment pattern.</div>
<table border="1" >
<tbody>
- <tr>
+ <tr>
<th > </th>
<th ><strong>if S contains</strong></th>
<th ><strong>then S RDF entails, recognizing D</strong></th>
</tr>
- <tr >
+ <tr >
<td class="othertable"><dfn>GrdfD1</dfn></td>
<td class="othertable"> xxx aaa <code>"</code>sss<code>"^^</code>ddd <code>.</code> <br/>
for ddd in D</td>
<td class="othertable"><code>"</code>sss<code>"^^</code>ddd <code>rdf:type</code> ddd <code>.</code></td>
</tr>
-
+
</tbody>
</table>
@@ -1181,7 +1165,7 @@
4. Apply the rules <a>GrdfD1</a> and <a>rdfD2</a> (and the rules <a>rdfs1</a> through <a>rdfs13</a>), with D={<code>rdf:langString</code>, <code>xsd:string</code>), to the set in all possible ways, to exhaustion. </p>
<p>Then we have the completeness result:</p>
-<p class="fact">If S is RDF (RDFS) consistent, then S RDF entails (RDFS entails) E just when the <a>generalized RDF (RDFS) closure</a> of S towards E simply entails E. </p>
+<p class="fact">If S is RDF (RDFS) consistent, then S RDF entails (RDFS entails) E just when the <a>generalized RDF (RDFS) closure</a> of S towards E simply entails E. </p>
<p>The closures are finite. The generation process is decidable and of polynomial complexity. Detecting simple entailment is NP-complete in general, but of low polynomial order when E contains no blank nodes. </p>
@@ -1192,7 +1176,7 @@
<p>As noted earlier, detecting datatype entailment for larger sets of datatype IRIs requires attention to idiosyncratic properties of the particular datatypes.</p>
</section>
-
+
<section class="informative appendix"><h2 id="finite_interpretations">Finite interpretations (Informative)</h2>
<p>To keep the exposition simple, the RDF semantics has been phrased in a way which requires interpretations to be larger than absolutely necessary. For example, all interpretations are required to interpret the whole IRI vocabulary, and the universes of all D-interpretations where D contains
<code>xsd:string</code> must contain all possible strings and therefore be infinite. This appendix sketches, without proof, how to re-state the semantics using smaller semantic structures, without changing any entailments. </p>
@@ -1208,7 +1192,7 @@
<section class="informative appendix"><h2 id="proofs">Proofs of some results (Informative)</h2>
-<p class="fact"> The <a>empty graph</a> is entailed by
+<p class="fact"> The <a>empty graph</a> is entailed by
any graph, and does not entail any graph except itself.
<!-- <a href="#emptygraphlemmaprf" class="termref">[Proof]</a> -->
</p>
@@ -1220,7 +1204,7 @@
</p>
<p>If I satisfies G then it satisfies every triple in G, hence every triple in any subset of G. QED.</p>
-<p class="fact"> A graph
+<p class="fact"> A graph
is entailed by any of its <a>instance</a>s.
<!-- <a href="#instlemprf" class="termref"> [Proof]</a> -->
</p>
@@ -1230,7 +1214,7 @@
<p>Consider the simple interpretation with universe {x}, IEXT(x)= <x,x > and I(aaa)=x for any IRI aaa. This interpretation satisfies every RDF graph. QED.</p>
<p class="fact">
- G simply entails a graph E if and only if a subgraph of G is an instance of E.
+ G simply entails a graph E if and only if a subgraph of G is an instance of E.
</p>
<p>If a subgraph E' of G is an instance of E then G entails E' which entails E, so G entails E. Now suppose G entails E, and consider the <a>Herbrand interpretation</a> I of G defined as follows. IR contains the <a>name</a>s and blank nodes which occur in the graph, with I(n)=n for each <a>name</a> n; n is in IP and <a, b> in IEXT(n) just when the triple <a n b> is in the graph. (For IRIs which do not occur in the graph, assign them values in IR at random.) I satisfies every triple <s p o> in E; that is, for some mapping A from the blank nodes of E to the vocabulary of G, the triple <[I+A](s) I(p) [I+A](o)> occurs in G. But this is an instance of <s p o> under the instance mapping A; so an instance of E is a subgraph of G. QED.</p>
@@ -1253,21 +1237,21 @@
<section class="informative appendix" id="whatnot"><h2 id="non_semantics">RDF reification, containers and collections (Informative)</h2>
-<p>The RDF semantic conditions do not place formal constraints on the meaning
- of much of the RDF vocabulary which is intended for use in describing containers and bounded collections,
+<p>The RDF semantic conditions do not place formal constraints on the meaning
+ of much of the RDF vocabulary which is intended for use in describing containers and bounded collections,
or the reification vocabulary intended to enable an RDF graph to describe RDF triples. This appendix briefly reviews the intended meanings of this vocabulary. </p>
-<p>The omission of these conditions from the formal semantics is a design decision
- to accommodate variations in existing RDF usage and to make it easier to implement
- processes to check formal RDF entailment. For example, implementations may decide
+<p>The omission of these conditions from the formal semantics is a design decision
+ to accommodate variations in existing RDF usage and to make it easier to implement
+ processes to check formal RDF entailment. For example, implementations may decide
to use special procedural techniques to implement the RDF collection vocabulary.</p>
<section>
-
+
<h3 id="Reif">Reification</h3>
- <div class="c1">
+ <div class="c1">
<table border="1">
<tbody>
<tr>
@@ -1283,7 +1267,7 @@
<p>The intended meaning of this vocabulary is to allow an RDF graph to act as metadata describing other RDF triples. </p>
-
+
<p>Consider an example graph containing a single triple:</p>
<p><code>ex:a ex:b ex:c .</code></p>
@@ -1343,7 +1327,7 @@
</section>
<section>
-
+
<h4 id="containers">RDF containers</h4>
<table border="1">
@@ -1398,8 +1382,8 @@
However, these informal conditions are not reflected in any formal RDF
entailments.</p>
-
-<p>The RDF semantics does not support any entailments which could arise from enumerating
+
+<p>The RDF semantics does not support any entailments which could arise from enumerating
the elements of an unordered <code>rdf:Bag</code> in a different order. For example,</p>
<p><code>_:xxx rdf:type rdf:Bag .<br/>
@@ -1420,7 +1404,7 @@
any of the elements of the container, or vice versa. </p>
<p>There is no formal requirement that
the three container classes are disjoint, so that for example
- it is consistent to assert that something is both an <code>rdf:Bag</code> and an <code>rdf:Seq</code>.
+ it is consistent to assert that something is both an <code>rdf:Bag</code> and an <code>rdf:Seq</code>.
There is no assumption that containers are gap-free, so that for example</p>
<p><code>_:xxx rdf:type rdf:Seq.<br/>
_:xxx rdf:_1 ex:a .<br/>
@@ -1439,7 +1423,7 @@
</section>
<section>
-
+
<h4 id="collections">RDF collections</h4>
<table border="1">
@@ -1458,26 +1442,26 @@
explicit terminator, allowing applications to determine the exact
set of items in the collection.</p>
-
-<p>As with containers, no special semantic conditions are imposed on this vocabulary
- other than the type of <code>rdf:nil</code> being <code>rdf:List</code>. It
- is intended for use typically in a context where a container is described using
- blank nodes to connect a 'well-formed' sequence of items, each described by
+
+<p>As with containers, no special semantic conditions are imposed on this vocabulary
+ other than the type of <code>rdf:nil</code> being <code>rdf:List</code>. It
+ is intended for use typically in a context where a container is described using
+ blank nodes to connect a 'well-formed' sequence of items, each described by
two triples of the form
<code><br/>
<br/>
_:c1 rdf:first aaa .<br/>
_:c1 rdf:rest _:c2 .</code></p>
-
-<p>where the final item is indicated by the use of <code>rdf:nil</code> as the
- value of the property <code>rdf:rest</code>. In a familiar convention, <code>rdf:nil</code>
- can be thought of as the empty collection. Any such graph amounts to an assertion
- that the collection exists, and since the members of the collection can be determined
- by inspection, this is often sufficient to enable applications to determine
- what is meant. The semantics does not require any collections
- to exist other than those mentioned explicitly in a graph (and the empty collection).
- For example, the existence of a collection containing two items does not automatically
+
+<p>where the final item is indicated by the use of <code>rdf:nil</code> as the
+ value of the property <code>rdf:rest</code>. In a familiar convention, <code>rdf:nil</code>
+ can be thought of as the empty collection. Any such graph amounts to an assertion
+ that the collection exists, and since the members of the collection can be determined
+ by inspection, this is often sufficient to enable applications to determine
+ what is meant. The semantics does not require any collections
+ to exist other than those mentioned explicitly in a graph (and the empty collection).
+ For example, the existence of a collection containing two items does not automatically
guarantee that the similar collection with the items permuted also exists:
<code>
<br/><br/>
@@ -1486,7 +1470,7 @@
_:c2 rdf:first ex:bbb .<br/>
_:c2 rdf:rest rdf:nil . </code></p>
<p>does not entail</p>
-
+
<p><code>_:c3 rdf:first ex:bbb .<br/>
_:c3 rdf:rest _:c4 .<br/>
<span >_:c4 rdf:first</span> ex:aaa .<br/>
@@ -1497,29 +1481,29 @@
vocabulary, so that it is possible to write RDF graphs which assert
the existence of highly peculiar objects such as lists with forked
or non-list tails, or multiple heads:</p>
-
+
<p><code>_:666 rdf:first ex:aaa .<br/>
_:666 rdf:first ex:bbb .<br/>
_:666 rdf:rest ex:ccc .<br/>
_:666 rdf:rest rdf:nil . </code></p>
-
-<p>It is also possible to write a set of triples which under-specify a collection
+
+<p>It is also possible to write a set of triples which under-specify a collection
by failing to specify its <code>rdf:rest</code> property value.</p>
-
+
<p><a>Semantic extension</a>s may
- place extra syntactic well-formedness restrictions on the use of this vocabulary
+ place extra syntactic well-formedness restrictions on the use of this vocabulary
in order to rule out such graphs. They may
- exclude interpretations of the collection vocabulary which violate the convention
- that the subject of a 'linked' collection of two-triple items of the form described
- above, ending with an item ending with <code>rdf:nil</code>, denotes a totally
- ordered sequence whose members are the denotations of the <code>rdf:first</code>
- values of the items, in the order got by tracing the <code>rdf:rest</code> properties
- from the subject to <code>rdf:nil</code>. This permits sequences which contain
+ exclude interpretations of the collection vocabulary which violate the convention
+ that the subject of a 'linked' collection of two-triple items of the form described
+ above, ending with an item ending with <code>rdf:nil</code>, denotes a totally
+ ordered sequence whose members are the denotations of the <code>rdf:first</code>
+ values of the items, in the order got by tracing the <code>rdf:rest</code> properties
+ from the subject to <code>rdf:nil</code>. This permits sequences which contain
other sequences.</p>
-<p> The RDFS semantic conditions require that any
- subject of the <code>rdf:first</code> property, and any subject or object of
+<p> The RDFS semantic conditions require that any
+ subject of the <code>rdf:first</code> property, and any subject or object of
the <code>rdf:rest</code> property, be of <code>rdf:type rdf:List</code>. </p>
</section>
@@ -1555,7 +1539,7 @@
<p>This document was prepared using the <a href="http://dev.w3.org/2009/dap/ReSpec.js/documentation.html">ReSpec.js specification writing tool</a> developed by Robin Berjon. </p>
-
+
</section>
</body>
</html>
--- a/rdf-turtle/n-triples.html Mon Oct 21 14:38:39 2013 -0400
+++ b/rdf-turtle/n-triples.html Wed Oct 23 19:28:31 2013 +0200
@@ -3,13 +3,16 @@
<head>
<title>N-Triples</title>
<meta http-equiv='Content-Type' content='text/html;charset=utf-8'/>
- <script src='https://ajax.googleapis.com/ajax/libs/jquery/1.6.2/jquery.min.js' class='remove'></script>
- <script src='https://raw.github.com/darobin/respec/develop/builds/respec-w3c-common-3.1.62.js' async class='remove'></script>
+ <script src="../local-biblio.js" class="remove"></script>
+ <script src="https://www.w3.org/Tools/respec/respec-w3c-common" class="remove"></script>
<script class='remove'>
var respecConfig = {
+ // extend the bibliography entries
+ localBiblio: localBibliography,
+
// specification status (e.g. WD, LCWD, NOTE, etc.). If in doubt use ED.
specStatus: "CR",
-
+
// the specification's short name, as in http://www.w3.org/TR/short-name/
shortName: "n-triples",
@@ -17,11 +20,6 @@
// formal title, define it here
subtitle : "A line-based syntax for an RDF graph",
-
- "localBiblio" : {
- "EBNF-NOTATION" : "Tim Bray; Jean Paoli; C. M. Sperberg-McQueen; Eve Maler; François Yergeau. <a href=\"http://www.w3.org/TR/REC-xml/#sec-notation\"><cite>EBNF Notation</cite></a> 26 November 2008. W3C Recommendation. URL: <a href=\"http://www.w3.org/TR/REC-xml/#sec-notation\">http://www.w3.org/TR/REC-xml/#sec-notation</a> "
- },
-
// if you wish the publication date to be other than today, set this
publishDate: "2013-11-05",
@@ -42,10 +40,6 @@
crEnd: "2013-11-26",
- // if you want to have extra CSS, append them to this list
- // it is recommended that the respec.css stylesheet be kept
- extraCSS: ["http://dev.w3.org/2009/dap/ReSpec.js/css/respec.css"],
-
// editors, add as many as you like
// only "name" is required
editors: [
@@ -53,7 +47,7 @@
company: "Lex Machina, Inc", companyURL: "https://lexmachina.com/" },
],
- // authors, add as many as you like.
+ // authors, add as many as you like.
// This is optional, uncomment if you have authors as well as editors.
// only "name" is required. Same format as editors.
@@ -62,16 +56,16 @@
//{ name: "Gavin Carothers", url: "http://gavin.carothers.name/", company: "Lex Machina, Inc", companyURL: "https://lexmachina.com/" },
],
-
+
// name of the WG
wg: "RDF Working Group",
-
+
// URI of the public WG page
wgURI: "http://www.w3.org/2011/rdf-wg/",
-
+
// name (with the @w3c.org) of the public mailing to which comments are due
wgPublicList: "public-rdf-comments",
-
+
// URI of the patent status for this WG, for Rec-track documents
// !!!! IMPORTANT !!!!
// This is important for Rec-track documents, do not copy a patent URI from a random
@@ -94,7 +88,7 @@
.separated tbody tr td.r { text-align: right; padding: .5em; }
.grammar td { font-family: monospace;}
.grammar-literal { color: gray;}
- </style>
+ </style>
</head>
<body>
<section id='abstract'>
@@ -103,17 +97,17 @@
<!-- BEGIN N-TRIPLES SPEC -->
<section id='sotd'>
-N-Triples was originally defined as a syntax for
+N-Triples was originally defined as a syntax for
the RDF Test Cases [[!RDF-TESTCASES]] document. Due to its popularity
as an exchange format the <a href="http://www.w3.org/2011/rdf-wg/">RDF
Working Group</a> decided to publish an updated
-version. In a change from previous publication, this document is intended to become a W3C Recommendation.
+version. In a change from previous publication, this document is intended to become a W3C Recommendation.
</section>
<section id="sec-introduction">
<h2>Introduction</h2>
<p>This document defines an easy to parse line-based subset of
- Turtle [[!turtle]] named N-Triples.</p>
+ Turtle [[!TURTLE]] named N-Triples.</p>
<p>The syntax is a revised version of N-Triples as originally defined in the RDF Test Cases [[!RDF-TESTCASES]] document. Its original intent was for writing test cases, but it has proven to be popular as an exchange format for RDF data.</p>
<p>An N-Triples document contains no parsing directives.
</p>
@@ -132,7 +126,7 @@
<p>The RDF graph represented by an N-Triples document contains
exactly each triple matching the N-Triples <a
href="#grammar-production-triple"><code>triple</code></a>
- production</a>.
+ production</a>.
</section>
<section id="sec-n-triples-language">
@@ -147,7 +141,7 @@
<h3>IRIs</h3>
<p>
- <a href="http://www.w3.org/TR/rdf11-concepts/#dfn-iri">IRIs</a> may be written only as absolute IRIs.
+ <a href="http://www.w3.org/TR/rdf11-concepts/#dfn-iri">IRIs</a> may be written only as absolute IRIs.
IRIs are enclosed in '<code><</code>' and '<code>></code>' and may contain numeric escape sequences (described below). For example <code><http://example.org/#green-goblin></code>.
</p>
</section>
@@ -156,7 +150,7 @@
<p><a href="http://www.w3.org/TR/rdf11-concepts/#dfn-literal">Literals</a>
are used to identify values such as strings, numbers,
- dates.</p>
+ dates.</p>
<p>
@@ -172,10 +166,10 @@
<pre class="example"><script type="application/n-triples"><http://example.org/show/218> <http://www.w3.org/2000/01/rdf-schema#label> "That Seventies Show"^^<http://www.w3.org/2001/XMLSchema#string> . # literal with XML Schema string datatype
<http://example.org/show/218> <http://www.w3.org/2000/01/rdf-schema#label> "That Seventies Show" . # same as above
<http://example.org/show/218> <http://example.org/show/localName> "That Seventies Show"@en . # literal with a language tag
-<http://example.org/show/218> <http://example.org/show/localName> "Cette Série des Années Septante"@fr-be . # literal outside of ASCII range with a region subtag
+<http://example.org/show/218> <http://example.org/show/localName> "Cette Série des Années Septante"@fr-be . # literal outside of ASCII range with a region subtag
<http://example.org/#spiderman> <http://example.org/text> "This is a multi-line\nliteral with many quotes (\"\"\"\"\")\nand two apostrophes ('')." .
-<http://en.wikipedia.org/wiki/Helium> <http://example.org/elements/atomicNumber> "2"^^<http://www.w3.org/2001/XMLSchema#integer> . # xsd:integer
-<http://en.wikipedia.org/wiki/Helium> <http://example.org/elements/specificGravity> "1.663E-4"^^<http://www.w3.org/2001/XMLSchema#double> . # xsd:double
+<http://en.wikipedia.org/wiki/Helium> <http://example.org/elements/atomicNumber> "2"^^<http://www.w3.org/2001/XMLSchema#integer> . # xsd:integer
+<http://en.wikipedia.org/wiki/Helium> <http://example.org/elements/specificGravity> "1.663E-4"^^<http://www.w3.org/2001/XMLSchema#double> . # xsd:double
</script>
</pre>
</section>
@@ -235,14 +229,14 @@
<p>A conforming <dfn>N-Triple parser</dfn> is a system capable of reading N-Triple documents on behalf of an application. It makes the serialized RDF graph, as defined in <a href="#sec-parsing" class="sectionRef"></a>, available to the application, usually through some form of API.</p>
- <p>The IRI that identifies the N-Triple language is: <code>http://www.w3.org/ns/formats/N-Triples</code></p>
+ <p>The IRI that identifies the N-Triple language is: <code>http://www.w3.org/ns/formats/N-Triples</code></p>
<section id="n-triples-mediatype">
<h2>Media Type and Content Encoding</h2>
-
+
<p>The media type of N-Triples is <code>application/n-triples</code>.
- The content encoding of N-Triples is always UTF-8.
- See <a href="#sec-mediaReg-n-triples">N-Triples Media Type</a> for the media type
+ The content encoding of N-Triples is always UTF-8.
+ See <a href="#sec-mediaReg-n-triples">N-Triples Media Type</a> for the media type
registration form.
</p>
@@ -263,7 +257,7 @@
<p>The <abbr title="Extended Backus–Naur Form">EBNF</abbr> used here is defined in XML 1.0
[[!EBNF-NOTATION]].</p>
<p>Escape sequence rules are the same as Turtle
- [[turtle]]. However, as only the <a href="#grammar-production-STRING_LITERAL_QUOTE"><code>STRING_LITERAL_QUOTE</code></a> production is allowed new lines in literals MUST be escaped.</p>
+ [[TURTLE]]. However, as only the <a href="#grammar-production-STRING_LITERAL_QUOTE"><code>STRING_LITERAL_QUOTE</code></a> production is allowed new lines in literals MUST be escaped.</p>
<div data-include="n-prime-bnf.html">
</div>
</section>
@@ -293,7 +287,7 @@
</section>
<section>
<h3>RDF Triple Construction</h3>
- <p>A N-Triple document defines an RDF graphs composed of a set of RDF triples. The <code><a href="#grammar-production-triple">triple</a></code> production produces a triple defined by the terms constructed for <code><a href="#grammar-production-subject">subject</a></code>, <code><a href="#grammar-production-predicate">predicate</a></code> and <code><a href="#grammar-production-object">object</a></code>.
+ <p>A N-Triple document defines an RDF graphs composed of a set of RDF triples. The <code><a href="#grammar-production-triple">triple</a></code> production produces a triple defined by the terms constructed for <code><a href="#grammar-production-subject">subject</a></code>, <code><a href="#grammar-production-predicate">predicate</a></code> and <code><a href="#grammar-production-object">object</a></code>.
</section>
@@ -302,7 +296,7 @@
<section id="section-ack" class="informative">
<h2>Acknowledgements</h2>
<p>The editor of the 2013 edition acknowledges valuable contributions from Gregg Kellogg, Andy Seaborn, Eric Prud'hommeaux, Dave Beckett, David Robillard, Gregory Williams, Pat Hayes, Richard Cyganiak, Henry S. Thompson, and David Booth.</p>
- <p>This specification is a product of extended deliberations by the
+ <p>This specification is a product of extended deliberations by the
<a href="http://www.w3.org/2000/09/dbwg/details?group=46168&public=1">members of the RDF Working Group</a>.
It draws upon the earlier specification in <a href="http://www.w3.org/TR/2004/REC-rdf-testcases-20040210/#ntriples">RDF Test Cases</a>, edited by Dave Beckett.</p>
</section>
@@ -360,17 +354,17 @@
<a class="norm" href="http://www.ietf.org/rfc/rfc3987.txt">Internationalized Resource Identifiers (IRIs)</a> [[!RFC3987]] Section 8, as well as
<a class="norm" href="http://www.ietf.org/rfc/rfc3986.txt">Uniform Resource Identifier (URI): Generic Syntax</a> [[!RFC3986]] Section 7.</dd>
- <dd>Multiple IRIs may have the same appearance. Characters in different scripts may
- look similar (a Cyrillic "о" may appear similar to a Latin "o"). A character followed
- by combining characters may have the same visual representation as another character
- (LATIN SMALL LETTER E followed by COMBINING ACUTE ACCENT has the same visual representation
+ <dd>Multiple IRIs may have the same appearance. Characters in different scripts may
+ look similar (a Cyrillic "о" may appear similar to a Latin "o"). A character followed
+ by combining characters may have the same visual representation as another character
+ (LATIN SMALL LETTER E followed by COMBINING ACUTE ACCENT has the same visual representation
as LATIN SMALL LETTER E WITH ACUTE).
<!-- (<code>foo:resum鼯code> and <code>fоо:resumé</code>)-->
Any person or application that is writing or interpreting data in Turtle must take care to use the IRI that matches the intended semantics, and avoid IRIs that make look similar.
- Further information about matching of similar characters can be found
- in <a class="inform" href="http://www.unicode.org/reports/tr36/">Unicode Security
+ Further information about matching of similar characters can be found
+ in <a class="inform" href="http://www.unicode.org/reports/tr36/">Unicode Security
Considerations</a> [[UNICODE-SECURITY]] and
- <a class="norm" href="http://www.ietf.org/rfc/rfc3987.txt">Internationalized Resource
+ <a class="norm" href="http://www.ietf.org/rfc/rfc3987.txt">Internationalized Resource
Identifiers (IRIs)</a> [[RFC3987]] Section 8.
</dd>
--- a/trig/index.html Mon Oct 21 14:38:39 2013 -0400
+++ b/trig/index.html Wed Oct 23 19:28:31 2013 +0200
@@ -4,6 +4,7 @@
<title>TriG</title>
<meta http-equiv='Content-Type' content='text/html;charset=utf-8'/>
<script src='https://ajax.googleapis.com/ajax/libs/jquery/1.6.2/jquery.min.js' class='remove'></script>
+ <script src="../local-biblio.js" class="remove"></script>
<script src='https://raw.github.com/darobin/respec/develop/builds/respec-w3c-common-3.1.62.js' async class='remove'></script>
<script class='remove'>
$.fn.renameElement = function (name) {
@@ -33,9 +34,12 @@
</script>
<script class='remove'>
var respecConfig = {
+ // extend the bibliography entries
+ localBiblio: localBibliography,
+
// specification status (e.g. WD, LCWD, NOTE, etc.). If in doubt use ED.
specStatus: "LC",
-
+
// the specification's short name, as in http://www.w3.org/TR/short-name/
shortName: "trig",
@@ -43,10 +47,6 @@
// formal title, define it here
subtitle : "RDF Dataset Language",
- "localBiblio" : {
- "EBNF-NOTATION" : "Tim Bray; Jean Paoli; C. M. Sperberg-McQueen; Eve Maler; François Yergeau. <a href=\"http://www.w3.org/TR/REC-xml/#sec-notation\"><cite>EBNF Notation</cite></a> 26 November 2008. W3C Recommendation. URL: <a href=\"http://www.w3.org/TR/REC-xml/#sec-notation\">http://www.w3.org/TR/REC-xml/#sec-notation</a>"
- },
-
// if you wish the publication date to be other than today, set this
publishDate: "2013-09-19",
@@ -82,28 +82,28 @@
}
],
- // authors, add as many as you like.
+ // authors, add as many as you like.
// This is optional, uncomment if you have authors as well as editors.
// only "name" is required. Same format as editors.
authors: [
{ name: "Chris Bizer",
- // link error, pls correct: url: "http://www.bizer.de",
+ // link error, pls correct: url: "http://www.bizer.de",
company: "Freie Universität Berlin", companyURL: "http://www.fu-berlin.de/" },
- { name: "Richard Cyganiak", url: "http://richard.cyganiak.de",
+ { name: "Richard Cyganiak", url: "http://richard.cyganiak.de",
company: "Freie Universität Berlin", companyURL: "http://www.fu-berlin.de/" },
],
-
+
// name of the WG
wg: "RDF Working Group",
-
+
// URI of the public WG page
wgURI: "http://www.w3.org/2011/rdf-wg/",
-
+
// name (with the @w3c.org) of the public mailing to which comments are due
wgPublicList: "public-rdf-comments",
-
+
// URI of the patent status for this WG, for Rec-track documents
// !!!! IMPORTANT !!!!
// This is important for Rec-track documents, do not copy a patent URI from a random
@@ -151,30 +151,30 @@
padding: 3px 1em;
}
- </style>
+ </style>
</head>
<body>
<section id='abstract'>
<p>The Resource Description Framework
- (<abbr title="Resource Description Framework">RDF</abbr>) is a
+ (<abbr title="Resource Description Framework">RDF</abbr>) is a
general-purpose language for representing information in the Web.</p>
<p>This document defines a textual syntax for RDF called TriG
that allows an RDF dataset to be completely written in a compact and
natural text form, with abbreviations for common usage patterns and
- datatypes. TriG is an extension of the
- <a href="http://www.w3.org/TR/turtle/">Turtle</a> [[!turtle]] format.
+ datatypes. TriG is an extension of the
+ <a href="http://www.w3.org/TR/turtle/">Turtle</a> [[!TURTLE]] format.
</p>
</section>
<section id='sotd'>
-<p>TriG is intended the meet the charter requirement of the
+<p>TriG is intended the meet the charter requirement of the
<a href="http://www.w3.org/2011/rdf-wg/">RDF Working Group</a> to
-define an RDF syntax for multiple graphs. TriG is an extension of the
+define an RDF syntax for multiple graphs. TriG is an extension of the
<a href="http://www.w3.org/TR/turtle/">Turtle</a>
-syntax for RDF [[!turtle]]. The current document is based on
-the original proposal by Chris Bizer and Richard Cyganiak.</p>
+syntax for RDF [[!TURTLE]]. The current document is based on
+the original proposal by Chris Bizer and Richard Cyganiak.</p>
<div style="border:1px solid red; padding: 1em; margin: 1em;"> The RDF WG welcomes reports of implementations, sent to the comments address. If we gather sufficient evidence of interoperable implementations, the group may request to skip <a href="http://www.w3.org/2005/10/Process-20051014/tr#cfi">Call for Implementations (Candidate Recommendation)</a> drafts and have the next round of publications be <a href="http://www.w3.org/2005/10/Process-20051014/tr#cfr">Proposed Recommendations</a>. </div>
</section>
@@ -183,8 +183,8 @@
<h2>Introduction</h2>
<p>This document defines TriG, a concrete syntax for RDF as defined in the
RDF Concepts and Abstract Syntax
- ([[!rdf11-concepts]]). TriG is an extension of
- <a href="http://www.w3.org/TR/turtle/">Turtle</a> ([[!turtle]]), extended
+ ([[!RDF11-CONCEPTS]]). TriG is an extension of
+ <a href="http://www.w3.org/TR/turtle/">Turtle</a> ([[!TURTLE]]), extended
to support representing a complete RDF Dataset.
</section>
@@ -192,15 +192,15 @@
<h2>TriG Language</h2>
<p>A TriG document allows writing down an RDF Dataset in a compact
- textual form. It consists of a sequence of directives, triple statements, graph statements which contain triple-generating statements and optional blank lines.
- Comments may be given after a <code>#</code> that is not part of another
+ textual form. It consists of a sequence of directives, triple statements, graph statements which contain triple-generating statements and optional blank lines.
+ Comments may be given after a <code>#</code> that is not part of another
lexical token and continue to the end of the line.</p>
<p>
<p>Graph statements are a pair of an IRI or blank node label and a group of triple statements
surrounded by <code>{}</code>. The IRI or blank node label of the graph statement may be used in another graph statement which implies taking the union of the tripes generated
- by each graph statement. An IRI or blank node label used as a graph label may also reoccur as part of any triple statement.
- Optionally a graph statement may not not be labeled with an IRI. Such a
+ by each graph statement. An IRI or blank node label used as a graph label may also reoccur as part of any triple statement.
+ Optionally a graph statement may not not be labeled with an IRI. Such a
graph statement corresponds to the Default Graph of an RDF Dataset.</p>
<p>
The construction of an RDF Dataset from a TriG document is defined in <a href="#sec-grammar" class="sectionRef">TriG Grammar</a> and <a href="#sec-parsing" class="sectionRef">Parsing</a>.
@@ -213,7 +213,7 @@
<section id="sec-graph-statements">
<h3>Graph Statements</h3>
-
+
<p>A graph statement pairs an IRI or blank node with a RDF graph. The triple statements that make up the graph are enclosed in <code>{}</code>.</p>
<p>In a TriG document a graph IRI or blank node may be used as label for more than one graph statements. The graph label of a graph statement may be omitted. In this case the graph is considered the default graph of the RDF Dataset.</p>
@@ -225,11 +225,11 @@
@prefix : <http://www.example.org/exampleDocument#> .
:G1 { :Monica a ex:Person ;
- ex:name "Monica Murphy" ;
+ ex:name "Monica Murphy" ;
ex:homepage <http://www.monicamurphy.org> ;
ex:email <mailto:monica@monicamurphy.org> ;
ex:hasSkill ex:Management ,
- ex:Programming . }
+ ex:Programming . }
</script>
</pre>
<p>A RDF Dataset may contain a default graph, and named graphs.</p>
@@ -241,21 +241,21 @@
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
# default graph
- {
- <http://example.org/bob> dc:publisher "Bob" .
+ {
+ <http://example.org/bob> dc:publisher "Bob" .
<http://example.org/alice> dc:publisher "Alice" .
}
-<http://example.org/bob>
- {
- _:a foaf:name "Bob" .
+<http://example.org/bob>
+ {
+ _:a foaf:name "Bob" .
_:a foaf:mbox <mailto:bob@oldcorp.example.org> .
_:a foaf:knows _:b .
}
-
+
<http://example.org/alice>
- {
- _:b foaf:name "Alice" .
+ {
+ _:b foaf:name "Alice" .
_:b foaf:mbox <mailto:alice@work.example.org> .
} </script>
</pre>
@@ -263,7 +263,7 @@
<p>TriG provides various alternative ways to write graphs
and triples, giving the data writer choices for clarity:
</p>
-
+
<pre class="example">
<script type="application/trig"># This document contains a same data as the
previous example.
@@ -273,22 +273,22 @@
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
# default graph - no {} used.
-<http://example.org/bob> dc:publisher "Bob" .
+<http://example.org/bob> dc:publisher "Bob" .
<http://example.org/alice> dc:publisher "Alice" .
# GRAPH keyword to highlight a named graph
# Abbreviation of triples using ;
-GRAPH <http://example.org/bob>
-{
- [] foaf:name "Bob" ;
+GRAPH <http://example.org/bob>
+{
+ [] foaf:name "Bob" ;
foaf:mbox <mailto:bob@oldcorp.example.org> ;
foaf:knows _:b .
}
-
+
GRAPH <http://example.org/alice>
-{
+{
_:b foaf:name "Alice" ;
- foaf:mbox <mailto:alice@work.example.org>
+ foaf:mbox <mailto:alice@work.example.org>
}</script>
</pre>
@@ -317,14 +317,14 @@
<p>A conforming <strong>TriG parser</strong> is a system capable of reading TriG documents on behalf of an application. It makes the serialized RDF dataset, as defined in <a href="#sec-parsing" class="sectionRef"></a>, available to the application, usually through some form of API.</p>
- <p>The IRI that identifies the TriG language is: <code>http://www.w3.org/ns/formats/TriG</code></p>
+ <p>The IRI that identifies the TriG language is: <code>http://www.w3.org/ns/formats/TriG</code></p>
<p class="note">This specification does not define how TriG parsers handle non-conforming input documents.</p>
<section id="sec-mime">
<h2>Media Type and Content Encoding</h2>
-
+
<p>The media type of TriG is <code>application/trig</code>.
- The content encoding of TriG content is always UTF-8.
+ The content encoding of TriG content is always UTF-8.
</p>
</section>
</section>
@@ -334,7 +334,7 @@
<p>A TriG document is a Unicode[[!UNICODE]] character string
- encoded in UTF-8.
+ encoded in UTF-8.
Unicode characters only in the range U+0000 to U+10FFFF inclusive are
allowed.
</p>
@@ -400,7 +400,7 @@
corresponding to the value encoded by the four hexadecimal digits interpreted from most significant to least significant digit.</td>
</tr>
-
+
<tr>
<td>'\U' <a href="#rHEX">hex</a> <a href="#rHEX">hex</a> <a href="#rHEX">hex</a> <a href="#rHEX">hex</a> <a href="#rHEX">hex</a> <a href="#rHEX">hex</a> <a href="#rHEX">hex</a> <a href="#rHEX">hex</a></td>
@@ -413,7 +413,7 @@
<p>where <a href="#rHEX">HEX</a> is a hexadecimal character</p>
<blockquote>
- <p><span style="font-family: monospace; font-size: 85%;"><a id="rHEX">HEX</a>
+ <p><span style="font-family: monospace; font-size: 85%;"><a id="rHEX">HEX</a>
::= [0-9] | [A-F] | [a-f]</span></p>
</blockquote>
@@ -439,38 +439,38 @@
<td>'\t'</td>
<td>U+0009</td>
</tr>
-
+
<tr>
<td>'\b'</td>
<td>U+0008</td>
</tr>
-
+
<tr>
<td>'\n'</td>
<td>U+000A</td>
</tr>
-
+
<tr>
<td>'\r'</td>
<td>U+000D</td>
</tr>
-
+
<tr>
<td>'\f'</td>
<td>U+000C</td>
</tr>
-
+
<tr>
<td>'\"'</td><!-- " -->
<td>U+0022</td>
</tr>
-
+
<tr>
<td>'\''</td> <!-- ' -->
<td>U+0027</td>
</tr>
-
+
<tr>
<td>'\\'</td>
@@ -521,15 +521,15 @@
</tbody>
</table>
<p class="note">%-encoded sequences are in the <a href="#grammar-production-IRIREF">character range for IRIs</a> and are <a href="#grammar-production-PERCENT">explicitly allowed</a> in local names. These appear as a '%' followed by two hex characters and represent that same sequence of three characters. These sequences are <em>not</em> decoded during processing. A term written as <code><http://a.example/%66oo-bar></code> in TriG designates the IRI <code>http://a.example/%66oo-bar</code> and not IRI <code>http://a.example/foo-bar</code>. A term written as <code>ex:%66oo-bar</code> with a prefix <code>@prefix ex: <http://a.example/></code> also designates the IRI <code>http://a.example/%66oo-bar</code>.</p>
-
+
</section>
<section id="grammar-ebnf">
<h3>Grammar</h3>
<p>The <abbr title="Extended Backus–Naur Form">EBNF</abbr> used here is defined in XML 1.0
- [[!EBNF-NOTATION]]. Production labels consisting of a number and a final 'g' are unique to TriG. All Production labels consisting of only a number reference the production with that number in the
+ [[!EBNF-NOTATION]]. Production labels consisting of a number and a final 'g' are unique to TriG. All Production labels consisting of only a number reference the production with that number in the
<a href="http://www.w3.org/TR/turtle/">Turtle</a> grammar
-[[!turtle]]. Production labels consisting of a number and a final 's', e.g. [<a href="http://www.w3.org/TR/sparql11-query/#rRDFLiteral"><span class="prodNo">60s</span></a>], reference the production with that number in the <a href="http://www.w3.org/TR/sparql11-query/#sparqlGrammar">SPARQL Query Language for RDF grammar</a> [[RDF-SPARQL-QUERY]].
+[[!TURTLE]]. Production labels consisting of a number and a final 's', e.g. [<a href="http://www.w3.org/TR/sparql11-query/#rRDFLiteral"><span class="prodNo">60s</span></a>], reference the production with that number in the <a href="http://www.w3.org/TR/sparql11-query/#sparqlGrammar">SPARQL Query Language for RDF grammar</a> [[RDF-SPARQL-QUERY]].
</p>
@@ -548,7 +548,7 @@
'<code class="grammar-literal">false</code>') are
case-sensitive.
Keywords in double quotes (
- "<code class="grammar-literal">BASE</code>",
+ "<code class="grammar-literal">BASE</code>",
"<code class="grammar-literal">PREFIX</code>"
"<code class="grammar-literal">GRAPH</code>"
) are case-insensitive.
@@ -556,7 +556,7 @@
<li>
Escape sequences markers <code>\u</code>, <code>\U</code>
and those in <code><a
-href="#grammar-production-ECHAR">ECHAR</a></code>
+href="#grammar-production-ECHAR">ECHAR</a></code>
are case sensitive.
</li>
<li>
@@ -580,24 +580,24 @@
<span>'<code class="grammar-literal">[</code>' <a href="#grammar-production-WS">WS</a><code class="grammar-star">*</code> '<code class="grammar-literal">]</code>'</span>
</span>
token allows any amount of white space and comments between <code class="grammar-literal">[]</code>s.
- The single space version is used in the grammar for clarity.
+ The single space version is used in the grammar for clarity.
</li>
<li>
The strings '<a href="#grammar-production-prefixID"><code class="grammar-literal">@prefix</code></a>' and '<a href="#grammar-production-base"><code class="grammar-literal">@base</code></a>' match the pattern for <a href="#grammar-production-LANGTAG">LANGTAG</a>, though neither "<code class="grammar-literal">prefix</code>" nor "<code class="grammar-literal">base</code>" are <a href="http://www.iana.org/assignments/language-subtag-registry">registered language
-subtags</a>.
+subtags</a>.
This specification does not define whether a quoted literal followed by either of these tokens (e.g. <code>"Z"@base</code>) is in the TriG language.
</li>
</ol>
</div>
-
+
<div data-include="trig-bnf.html"></div>
-
+
</section>
</section>
- <section id="sec-parsing">
+ <section id="sec-parsing">
<h2>Parsing</h2>
- <p>The <a href="http://www.w3.org/TR/rdf11-concepts">RDF Concepts and Abstract Syntax</a> ([[!RDF-CONCEPTS]]) specification defines three types of <em>RDF Term</em>:
+ <p>The <a href="http://www.w3.org/TR/rdf11-concepts">RDF Concepts and Abstract Syntax</a> ([[!RDF11-CONCEPTS]]) specification defines three types of <em>RDF Term</em>:
<a href="http://www.w3.org/TR/rdf11-concepts#dfn-iri">IRIs</a>,
<a href="http://www.w3.org/TR/rdf11-concepts#dfn-literal">literals</a> and
@@ -620,7 +620,7 @@
<li id="curPredicate">RDF_Term <code class="dfn">curPredicate</code> — The <code class="curPredicate">curPredicate</code> is bound to the <code><a href="#grammar-production-verb">verb</a></code> production. If token matched was "<code>a</code>", <code class="curPredicate">curPredicate</code> is bound to the IRI <code>http://www.w3.org/1999/02/22-rdf-syntax-ns#type</code>.</li>
- <li id="curGraph">RDF_Term <code class="dfn">curGraph</code> —
+ <li id="curGraph">RDF_Term <code class="dfn">curGraph</code> —
The <code class="curGraph">curGraph</code> is bound to
the label of the graph that is the destination of triples
produced in parsing. When undefined, triples are destined
@@ -667,10 +667,10 @@
<p>
A TriG document defines an <a href="http://www.w3.org/TR/rdf11-concepts/#section-dataset"
>RDF Dataset</a> composed of one default graph and zero or
- more named graphs. Each graph is composed of a set of
+ more named graphs. Each graph is composed of a set of
<a href="http://www.w3.org/TR/rdf11-concepts/#dfn-rdf-triple">RDF triple</a>s.
</p>
-
+
<section id="output-graph">
<h4>Output Graph</h4>
<p>The state <code class="curGraph">curGraph</code> is
@@ -678,14 +678,14 @@
triples produced during parsing. If undefined, the default
graph is used.</p>
- <p>The rule
+ <p>The rule
<code><a href="#grammar-production-labelOrSubject">labelOrSubject</a></code>
sets both <code class="curGraph">curGraph</code>
and <code class="curSubject">curSubject</code>
(only one of these will be used).
</p>
- <p>The following grammar production clauses set
+ <p>The following grammar production clauses set
<code class="curGraph">curGraph</code> to be undefined, indicating the default
graph:
</p>
@@ -694,20 +694,20 @@
The grammar production clause <code>wrappedGraph</code> in rule <code><a href="#grammar-production-block">block</a></code>.
</li>
<li>
- The grammar production in rule
+ The grammar production in rule
<code><a href="#grammar-production-triples2">triples2</a></code>.
</li>
</ul>
<p>
- The grammar production
+ The grammar production
<code>labelOrSubject predicateObjectList '.'</code>
- unsets
+ unsets
<code class="curGraph">curGraph</code>
before handling <code>predicateObjectLists</code>
in rule <code><a href="#grammar-production-triplesOrGraph">triplesOrGraph</a></code>.
</li>
-
+
</section>
<section>
<h4>Triple Output</h4>
@@ -724,7 +724,7 @@
production sets the <code class="curPredicate">curPredicate</code>.
</p>
<p>Triples are produced at the following points in the
- parsing process and each RDF triple produced is
+ parsing process and each RDF triple produced is
added to the graph identified
by <code class="curGraph">curGraph</code>.
</p>
@@ -732,9 +732,9 @@
<h5 style="padding-bottom:0; margin-bottom:0;">Triple Production</h5>
<p style="padding-top:0; margin-top:0;">
Each <a class="grammarRef" href="#grammar-production-object">object</a>
- <code>N</code> in the document produces an RDF triple:
- <span class="ntriple"><code class="curSubject">curSubject</code>
- <code class="curPredicate">curPredicate</code> <code>N</code>.</span>
+ <code>N</code> in the document produces an RDF triple:
+ <span class="ntriple"><code class="curSubject">curSubject</code>
+ <code class="curPredicate">curPredicate</code> <code>N</code>.</span>
</p>
</section>
<section id="propertyList">
@@ -762,22 +762,22 @@
<section id="sec-differences" class="appendix informative">
<h2>Differences from Previous TriG</h2>
<p>This section describes the main differences between TriG, as
- defined in this document, and earlier forms.
+ defined in this document, and earlier forms.
<ul>
- <li>Syntax is aligned to the
- <a href="http://www.w3.org/TR/turtle/">Turtle</a> [[!turtle]] recommendation
+ <li>Syntax is aligned to the
+ <a href="http://www.w3.org/TR/turtle/">Turtle</a> [[!TURTLE]] recommendation
for RDF terms.</li>
<li>Graph labels can be blank nodes.</li>
<li>The default graph, or sections of the default graph, do not
need to be enclosed in <code>{</code> ... <code>}</code>.</li>
- <li>No support for optional <code>=</code> graph naming operator
+ <li>No support for optional <code>=</code> graph naming operator
or optional "." after each graph.</li>
<li>Graph labels do not have to be unique within a TriG
document. Reusing a graph label causes all the triples
for that graph to be included in the resulting graph.
Sections with the same label are combined by set union.</li>
- <li>Keywords <code>BASE</code>,
- <code>PREFIX</code> as in [[!turtle]].</li>
+ <li>Keywords <code>BASE</code>,
+ <code>PREFIX</code> as in [[!TURTLE]].</li>
<li>The optional <code>GRAPH</code> keyword is allowed to aid
SPARQL alignment.
</ul>
@@ -820,17 +820,17 @@
<a class="norm" href="http://www.ietf.org/rfc/rfc3987.txt">Internationalized Resource Identifiers (IRIs)</a> [[!RFC3987]] Section 8, as well as
<a class="norm" href="http://www.ietf.org/rfc/rfc3986.txt">Uniform Resource Identifier (URI): Generic Syntax</a> [[!RFC3986]] Section 7.</dd>
- <dd>Multiple IRIs may have the same appearance. Characters in different scripts may
- look similar (a Cyrillic "о" may appear similar to a Latin "o"). A character followed
- by combining characters may have the same visual representation as another character
- (LATIN SMALL LETTER E followed by COMBINING ACUTE ACCENT has the same visual representation
+ <dd>Multiple IRIs may have the same appearance. Characters in different scripts may
+ look similar (a Cyrillic "о" may appear similar to a Latin "o"). A character followed
+ by combining characters may have the same visual representation as another character
+ (LATIN SMALL LETTER E followed by COMBINING ACUTE ACCENT has the same visual representation
as LATIN SMALL LETTER E WITH ACUTE).
<!-- (<code>foo:resum鼯code> and <code>fоо:resumé</code>)-->
Any person or application that is writing or interpreting data in TriG must take care to use the IRI that matches the intended semantics, and avoid IRIs that make look similar.
- Further information about matching of similar characters can be found
- in <a class="inform" href="http://www.unicode.org/reports/tr36/">Unicode Security
+ Further information about matching of similar characters can be found
+ in <a class="inform" href="http://www.unicode.org/reports/tr36/">Unicode Security
Considerations</a> [[UNICODE-SECURITY]] and
- <a class="norm" href="http://www.ietf.org/rfc/rfc3987.txt">Internationalized Resource
+ <a class="norm" href="http://www.ietf.org/rfc/rfc3987.txt">Internationalized Resource
Identifiers (IRIs)</a> [[RFC3987]] Section 8.</dd>
<dt>Interoperability considerations:</dt>
@@ -843,7 +843,7 @@
<dt>Additional information:</dt>
<dt>Magic number(s):</dt>
<dd>TriG documents may have the strings 'prefix' or 'base' (case
- independent) near the beginning of the document.</dd>
+ independent) near the beginning of the document.</dd>
<dt>File extension(s):</dt>
<dd>".trig"</dd>
@@ -865,7 +865,7 @@
<dd>The TriG specification is the product of the RDF WG. The W3C reserves change control over this specifications.</dd>
</dl>
</section>
-
+
<section id="sec-changes" class="appendix">
<h2>Changes since the last publication of this document</h2>
<ul>
@@ -878,6 +878,6 @@
</ul>
</section>
-
+
</body>
-</html>
\ No newline at end of file
+</html>