--- a/dictionary/releases/NOTE-prov-dictionary-20130430/Overview.html Tue Apr 16 20:17:31 2013 -0600
+++ b/dictionary/releases/NOTE-prov-dictionary-20130430/Overview.html Wed Apr 17 10:45:22 2013 +0200
@@ -733,11 +733,11 @@
.section dl.attrs dd, .section dl.eldef dd {
margin-bottom: 0;
}
-</style><link rel="stylesheet" href="https://www.w3.org/StyleSheets/TR/W3C-WG-NOTE"><!--[if lt IE 9]><script src='https://www.w3.org/2008/site/js/html5shiv.js'></script><![endif]--></head>
+</style><link href="https://www.w3.org/StyleSheets/TR/W3C-WG-NOTE" rel="stylesheet"><!--[if lt IE 9]><script src='https://www.w3.org/2008/site/js/html5shiv.js'></script><![endif]--></head>
<body><div class="head">
<p>
- <a href="http://www.w3.org/"><img width="72" height="48" src="https://www.w3.org/Icons/w3c_home" alt="W3C"></a>
+ <a href="http://www.w3.org/"><img src="https://www.w3.org/Icons/w3c_home" alt="W3C" height="48" width="72"></a>
</p>
<h1 class="title" id="title">PROV-Dictionary: Modeling Provenance for Dictionary Data Structures</h1>
@@ -779,10 +779,10 @@
<p class="copyright">
- <a href="http://www.w3.org/Consortium/Legal/ipr-notice#Copyright">Copyright</a> ©
+ <a href="http://www.w3.org/Consortium/Legal/ipr-notice#Copyright">Copyright</a> ©
2013
- <a href="http://www.w3.org/"><abbr title="World Wide Web Consortium">W3C</abbr></a><sup>®</sup>
+ <a href="http://www.w3.org/"><abbr title="World Wide Web Consortium">W3C</abbr></a><sup>®</sup>
(<a href="http://www.csail.mit.edu/"><abbr title="Massachusetts Institute of Technology">MIT</abbr></a>,
<a href="http://www.ercim.eu/"><abbr title="European Research Consortium for Informatics and Mathematics">ERCIM</abbr></a>,
<a href="http://www.keio.ac.jp/">Keio</a>, <a href="http://ev.buaa.edu.cn/">Beihang</a>), All Rights Reserved.
@@ -795,11 +795,11 @@
<hr>
</div>
- <section id="abstract" class="introductory"><h2>Abstract</h2>
+ <section class="introductory" id="abstract"><h2>Abstract</h2>
<p>
Provenance is information about entities, activities, and people
involved in producing a piece of data or thing, which can be used to
-form assessments about its quality, reliability or trustworthiness. This document describes extensions to PROV to facilitate the modeling of provenance for dictionary data structures. [<cite><a class="bibref" href="#bib-PROV-DM">PROV-DM</a></cite>] specifies a <a href="http://www.w3.org/TR/2013/PR-prov-dm-20130312/Overview.html#component6">Collection</a> as an entity that provides a structure to some constituents, which are themselves entities. However, some applications may need a mechanism to specify more structure to a Collection, in order to accurately describe its provenance.
+form assessments about its quality, reliability or trustworthiness. This document describes extensions to PROV to facilitate the modeling of provenance for dictionary data structures. [<cite><a href="#bib-PROV-DM" class="bibref">PROV-DM</a></cite>] specifies a <a href="http://www.w3.org/TR/2013/PR-prov-dm-20130312/Overview.html#component6">Collection</a> as an entity that provides a structure to some constituents, which are themselves entities. However, some applications may need a mechanism to specify more structure to a Collection, in order to accurately describe its provenance.
Therefore, in this document, we introduce Dictionary, a specific type of Collection with a logical structure consisting of key-entity pairs.
</p>
@@ -818,20 +818,20 @@
<h4 id="prov-family-of-documents">PROV Family of Documents</h4>
This document is part of the PROV family of documents, a set of documents defining various aspects that are necessary to achieve the vision of inter-operable
-interchange of provenance information in heterogeneous environments such as the Web. These documents are listed below. Please consult the [<cite><a class="bibref" href="#bib-PROV-OVERVIEW">PROV-OVERVIEW</a></cite>] for a guide to reading these documents.
+interchange of provenance information in heterogeneous environments such as the Web. These documents are listed below. Please consult the [<cite><a href="#bib-PROV-OVERVIEW" class="bibref">PROV-OVERVIEW</a></cite>] for a guide to reading these documents.
<ul>
-<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-overview-20130430/">PROV-OVERVIEW</a> (Note), an overview of the PROV family of documents [<cite><a class="bibref" href="#bib-PROV-OVERVIEW">PROV-OVERVIEW</a></cite>];</li>
-<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-primer-20130430/">PROV-PRIMER</a> (Note), a primer for the PROV data model [<cite><a class="bibref" href="#bib-PROV-PRIMER">PROV-PRIMER</a></cite>];</li>
-<li> <a href="http://www.w3.org/TR/2013/REC-prov-o-20130430/">PROV-O</a> (Recommendation), the PROV ontology, an OWL2 ontology allowing the mapping of the PROV data model to RDF [<cite><a class="bibref" href="#bib-PROV-O">PROV-O</a></cite>];</li>
-<li> <a href="http://www.w3.org/TR/2013/REC-prov-dm-20130430/">PROV-DM</a> (Recommendation), the PROV data model for provenance [<cite><a class="bibref" href="#bib-PROV-DM">PROV-DM</a></cite>];</li>
-<li> <a href="http://www.w3.org/TR/2013/REC-prov-n-20130430/">PROV-N</a> (Recommendation), a notation for provenance aimed at human consumption [<cite><a class="bibref" href="#bib-PROV-N">PROV-N</a></cite>];</li>
-<li> <a href="http://www.w3.org/TR/2013/REC-prov-constraints-20130430/">PROV-CONSTRAINTS</a> (Recommendation), a set of constraints applying to the PROV data model [<cite><a class="bibref" href="#bib-PROV-CONSTRAINTS">PROV-CONSTRAINTS</a></cite>];</li>
-<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-xml-20130430/">PROV-XML</a> (Note), an XML schema for the PROV data model [<cite><a class="bibref" href="#bib-PROV-XML">PROV-XML</a></cite>];</li>
-<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-aq-20130430/">PROV-AQ</a> (Note), mechanisms for accessing and querying provenance [<cite><a class="bibref" href="#bib-PROV-AQ">PROV-AQ</a></cite>]; </li>
+<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-overview-20130430/">PROV-OVERVIEW</a> (Note), an overview of the PROV family of documents [<cite><a href="#bib-PROV-OVERVIEW" class="bibref">PROV-OVERVIEW</a></cite>];</li>
+<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-primer-20130430/">PROV-PRIMER</a> (Note), a primer for the PROV data model [<cite><a href="#bib-PROV-PRIMER" class="bibref">PROV-PRIMER</a></cite>];</li>
+<li> <a href="http://www.w3.org/TR/2013/REC-prov-o-20130430/">PROV-O</a> (Recommendation), the PROV ontology, an OWL2 ontology allowing the mapping of the PROV data model to RDF [<cite><a href="#bib-PROV-O" class="bibref">PROV-O</a></cite>];</li>
+<li> <a href="http://www.w3.org/TR/2013/REC-prov-dm-20130430/">PROV-DM</a> (Recommendation), the PROV data model for provenance [<cite><a href="#bib-PROV-DM" class="bibref">PROV-DM</a></cite>];</li>
+<li> <a href="http://www.w3.org/TR/2013/REC-prov-n-20130430/">PROV-N</a> (Recommendation), a notation for provenance aimed at human consumption [<cite><a href="#bib-PROV-N" class="bibref">PROV-N</a></cite>];</li>
+<li> <a href="http://www.w3.org/TR/2013/REC-prov-constraints-20130430/">PROV-CONSTRAINTS</a> (Recommendation), a set of constraints applying to the PROV data model [<cite><a href="#bib-PROV-CONSTRAINTS" class="bibref">PROV-CONSTRAINTS</a></cite>];</li>
+<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-xml-20130430/">PROV-XML</a> (Note), an XML schema for the PROV data model [<cite><a href="#bib-PROV-XML" class="bibref">PROV-XML</a></cite>];</li>
+<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-aq-20130430/">PROV-AQ</a> (Note), mechanisms for accessing and querying provenance [<cite><a href="#bib-PROV-AQ" class="bibref">PROV-AQ</a></cite>]; </li>
<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-dictionary-20130430/">PROV-DICTIONARY</a> (Note) introduces a specific type of collection, consisting of key-entity pairs (this document);</li>
-<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-dc-20130430/">PROV-DC</a> (Note) provides a mapping between PROV-O and Dublin Core Terms [<cite><a class="bibref" href="#bib-PROV-DC">PROV-DC</a></cite>];</li>
-<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-sem-20130430/">PROV-SEM</a> (Note), a declarative specification in terms of first-order logic of the PROV data model [<cite><a class="bibref" href="#bib-PROV-SEM">PROV-SEM</a></cite>];</li>
-<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-links-20130430/">PROV-LINKS</a> (Note) introduces a mechanism to link across bundles [<cite><a class="bibref" href="#bib-PROV-LINKS">PROV-LINKS</a></cite>].</li>
+<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-dc-20130430/">PROV-DC</a> (Note) provides a mapping between PROV-O and Dublin Core Terms [<cite><a href="#bib-PROV-DC" class="bibref">PROV-DC</a></cite>];</li>
+<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-sem-20130430/">PROV-SEM</a> (Note), a declarative specification in terms of first-order logic of the PROV data model [<cite><a href="#bib-PROV-SEM" class="bibref">PROV-SEM</a></cite>];</li>
+<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-links-20130430/">PROV-LINKS</a> (Note) introduces a mechanism to link across bundles [<cite><a href="#bib-PROV-LINKS" class="bibref">PROV-LINKS</a></cite>].</li>
</ul>
<h4 id="implementations-encouraged">Implementations Encouraged</h4>
@@ -888,7 +888,7 @@
-</section><section id="toc"><h2 class="introductory">Table of Contents</h2><ul class="toc"><li class="tocline"><a href="#introduction" class="tocxref"><span class="secno">1. </span>Introduction</a></li><li class="tocline"><a href="#prov-namespace" class="tocxref"><span class="secno">2. </span>PROV Namespace</a></li><li class="tocline"><a href="#dictionary-conceptual-definition" class="tocxref"><span class="secno">3. </span>Conceptual Definition of Dictionary</a><ul class="toc"><li class="tocline"><a href="#term-dictionary-membership" class="tocxref"><span class="secno">3.1 </span>Dictionary Membership</a></li><li class="tocline"><a href="#term-dictionary-insertion" class="tocxref"><span class="secno">3.2 </span>Dictionary Insertion</a></li><li class="tocline"><a href="#term-dictionary-removal" class="tocxref"><span class="secno">3.3 </span>Dictionary Removal</a></li></ul></li><li class="tocline"><a href="#dictionary-notation" class="tocxref"><span class="secno">4. </span>PROV-N Notation of Dictionary Concepts</a><ul class="toc"><li class="tocline"><a href="#expression-dictionary" class="tocxref"><span class="secno">4.1 </span>Dictionary and EmptyDictionary Expression</a></li><li class="tocline"><a href="#expression-dictionary-membership" class="tocxref"><span class="secno">4.2 </span>Dictionary Membership</a></li><li class="tocline"><a href="#expression-dictionary-insertion" class="tocxref"><span class="secno">4.3 </span>Insertion</a></li><li class="tocline"><a href="#expression-dictionary-removal" class="tocxref"><span class="secno">4.4 </span>Removal</a></li><li class="tocline"><a href="#expression-dictionary-other" class="tocxref"><span class="secno">4.5 </span>Other expressions</a></li></ul></li><li class="tocline"><a href="#dictionary-ontological-definition" class="tocxref"><span class="secno">5. </span>PROV-O Representation of Dictionary</a><ul class="toc"><li class="tocline"><a href="#prov-dictionary-owl-terms-at-a-glance" class="tocxref"><span class="secno">5.1 </span>Overview</a></li><li class="tocline"><a href="#Classes" class="tocxref"><span class="secno">5.2 </span>Dictionary Classes</a></li><li class="tocline"><a href="#Properties" class="tocxref"><span class="secno">5.3 </span>Dictionary Properties</a></li></ul></li><li class="tocline"><a href="#dictionary-xml-schema" class="tocxref"><span class="secno">6. </span>PROV-XML Representation of Dictionary</a><ul class="toc"><li class="tocline"><a href="#term-Dictionary" class="tocxref"><span class="secno">6.1 </span>Dictionary</a></li><li class="tocline"><a href="#term-KeyEntityPair" class="tocxref"><span class="secno">6.2 </span>Key-Entity Pair</a></li><li class="tocline"><a href="#term-DictionaryMembership" class="tocxref"><span class="secno">6.3 </span>Dictionary Membership</a></li><li class="tocline"><a href="#term-Insertion" class="tocxref"><span class="secno">6.4 </span>Insertion</a></li><li class="tocline"><a href="#term-Removal" class="tocxref"><span class="secno">6.5 </span>Removal</a></li></ul></li><li class="tocline"><a href="#dictionary-constraints" class="tocxref"><span class="secno">7. </span>Constraints Associated with Dictionary</a><ul class="toc"><li class="tocline"><a href="#dictionary-constraints-notation" class="tocxref"><span class="secno">7.1 </span>Notation and Conventions</a></li><li class="tocline"><a href="#dictionary-constraints-inferences" class="tocxref"><span class="secno">7.2 </span>Inferences</a></li><li class="tocline"><a href="#dictionary-constraints-constraints" class="tocxref"><span class="secno">7.3 </span>Constraints</a></li><li class="tocline"><a href="#dictionary-typing" class="tocxref"><span class="secno">7.4 </span>Typing</a></li></ul></li><li class="tocline"><a href="#example" class="tocxref"><span class="secno">A. </span>Example</a><ul class="toc"><li class="tocline"><a href="#example-data" class="tocxref"><span class="secno">A.1 </span>Data</a></li><li class="tocline"><a href="#example-provenance" class="tocxref"><span class="secno">A.2 </span>Provenance</a><ul class="toc"><li class="tocline"><a href="#example-prov-n" class="tocxref"><span class="secno">A.2.1 </span>PROV-N</a></li><li class="tocline"><a href="#example-prov-o" class="tocxref"><span class="secno">A.2.2 </span>PROV-O</a></li><li class="tocline"><a href="#example-prov-xml" class="tocxref"><span class="secno">A.2.3 </span>PROV-XML</a></li></ul></li></ul></li><li class="tocline"><a href="#change-log" class="tocxref"><span class="secno">B. </span>Change Log</a><ul class="toc"><li class="tocline"><a href="#change-log-since-first-public-working-draft" class="tocxref"><span class="secno">B.1 </span>Change Log Since First Public Working Draft</a></li></ul></li><li class="tocline"><a href="#acknowledgements" class="tocxref"><span class="secno">C. </span>Acknowledgements</a></li><li class="tocline"><a href="#references" class="tocxref"><span class="secno">D. </span>References</a><ul class="toc"><li class="tocline"><a href="#informative-references" class="tocxref"><span class="secno">D.1 </span>Informative references</a></li></ul></li></ul></section>
+</section><section id="toc"><h2 class="introductory">Table of Contents</h2><ul class="toc"><li class="tocline"><a class="tocxref" href="#introduction"><span class="secno">1. </span>Introduction</a></li><li class="tocline"><a class="tocxref" href="#prov-namespace"><span class="secno">2. </span>PROV Namespace</a></li><li class="tocline"><a class="tocxref" href="#dictionary-conceptual-definition"><span class="secno">3. </span>Conceptual Definition of Dictionary</a><ul class="toc"><li class="tocline"><a class="tocxref" href="#term-dictionary-membership"><span class="secno">3.1 </span>Dictionary Membership</a></li><li class="tocline"><a class="tocxref" href="#term-dictionary-insertion"><span class="secno">3.2 </span>Dictionary Insertion</a></li><li class="tocline"><a class="tocxref" href="#term-dictionary-removal"><span class="secno">3.3 </span>Dictionary Removal</a></li></ul></li><li class="tocline"><a class="tocxref" href="#dictionary-notation"><span class="secno">4. </span>PROV-N Notation of Dictionary Concepts</a><ul class="toc"><li class="tocline"><a class="tocxref" href="#expression-dictionary"><span class="secno">4.1 </span>Dictionary and EmptyDictionary Expression</a></li><li class="tocline"><a class="tocxref" href="#expression-dictionary-membership"><span class="secno">4.2 </span>Dictionary Membership</a></li><li class="tocline"><a class="tocxref" href="#expression-dictionary-insertion"><span class="secno">4.3 </span>Insertion</a></li><li class="tocline"><a class="tocxref" href="#expression-dictionary-removal"><span class="secno">4.4 </span>Removal</a></li><li class="tocline"><a class="tocxref" href="#expression-dictionary-other"><span class="secno">4.5 </span>Other expressions</a></li></ul></li><li class="tocline"><a class="tocxref" href="#dictionary-ontological-definition"><span class="secno">5. </span>PROV-O Representation of Dictionary</a><ul class="toc"><li class="tocline"><a class="tocxref" href="#prov-dictionary-owl-terms-at-a-glance"><span class="secno">5.1 </span>Overview</a></li><li class="tocline"><a class="tocxref" href="#Classes"><span class="secno">5.2 </span>Dictionary Classes</a></li><li class="tocline"><a class="tocxref" href="#Properties"><span class="secno">5.3 </span>Dictionary Properties</a></li></ul></li><li class="tocline"><a class="tocxref" href="#dictionary-xml-schema"><span class="secno">6. </span>PROV-XML Representation of Dictionary</a><ul class="toc"><li class="tocline"><a class="tocxref" href="#term-Dictionary"><span class="secno">6.1 </span>Dictionary</a></li><li class="tocline"><a class="tocxref" href="#term-KeyEntityPair"><span class="secno">6.2 </span>Key-Entity Pair</a></li><li class="tocline"><a class="tocxref" href="#term-DictionaryMembership"><span class="secno">6.3 </span>Dictionary Membership</a></li><li class="tocline"><a class="tocxref" href="#term-Insertion"><span class="secno">6.4 </span>Insertion</a></li><li class="tocline"><a class="tocxref" href="#term-Removal"><span class="secno">6.5 </span>Removal</a></li></ul></li><li class="tocline"><a class="tocxref" href="#dictionary-constraints"><span class="secno">7. </span>Constraints Associated with Dictionary</a><ul class="toc"><li class="tocline"><a class="tocxref" href="#dictionary-constraints-notation"><span class="secno">7.1 </span>Notation and Conventions</a></li><li class="tocline"><a class="tocxref" href="#dictionary-constraints-inferences"><span class="secno">7.2 </span>Inferences</a></li><li class="tocline"><a class="tocxref" href="#dictionary-constraints-constraints"><span class="secno">7.3 </span>Constraints</a></li><li class="tocline"><a class="tocxref" href="#dictionary-typing"><span class="secno">7.4 </span>Typing</a></li></ul></li><li class="tocline"><a class="tocxref" href="#example"><span class="secno">A. </span>Example</a><ul class="toc"><li class="tocline"><a class="tocxref" href="#example-data"><span class="secno">A.1 </span>Data</a></li><li class="tocline"><a class="tocxref" href="#example-provenance"><span class="secno">A.2 </span>Provenance</a><ul class="toc"><li class="tocline"><a class="tocxref" href="#example-prov-n"><span class="secno">A.2.1 </span>PROV-N</a></li><li class="tocline"><a class="tocxref" href="#example-prov-o"><span class="secno">A.2.2 </span>PROV-O</a></li><li class="tocline"><a class="tocxref" href="#example-prov-xml"><span class="secno">A.2.3 </span>PROV-XML</a></li></ul></li></ul></li><li class="tocline"><a class="tocxref" href="#change-log"><span class="secno">B. </span>Change Log</a><ul class="toc"><li class="tocline"><a class="tocxref" href="#change-log-since-first-public-working-draft"><span class="secno">B.1 </span>Change Log Since First Public Working Draft</a></li></ul></li><li class="tocline"><a class="tocxref" href="#acknowledgements"><span class="secno">C. </span>Acknowledgements</a></li><li class="tocline"><a class="tocxref" href="#references"><span class="secno">D. </span>References</a><ul class="toc"><li class="tocline"><a class="tocxref" href="#informative-references"><span class="secno">D.1 </span>Informative references</a></li></ul></li></ul></section>
@@ -899,13 +899,13 @@
<a href=" http://www.w3.org/TR/2013/PR-prov-dm-20130312/">Provenance</a>
is a record that describes the people, institutions, entities, and
activities involved in producing, influencing, or delivering a piece
-of data or a thing. The specifications [<cite><a class="bibref" href="#bib-PROV-O">PROV-O</a></cite>], [<cite><a class="bibref" href="#bib-PROV-DM">PROV-DM</a></cite>],
-[<cite><a class="bibref" href="#bib-PROV-N">PROV-N</a></cite>], and [<cite><a class="bibref" href="#bib-PROV-XML">PROV-XML</a></cite>] have respectively defined the PROV
+of data or a thing. The specifications [<cite><a href="#bib-PROV-O" class="bibref">PROV-O</a></cite>], [<cite><a href="#bib-PROV-DM" class="bibref">PROV-DM</a></cite>],
+[<cite><a href="#bib-PROV-N" class="bibref">PROV-N</a></cite>], and [<cite><a href="#bib-PROV-XML" class="bibref">PROV-XML</a></cite>] have respectively defined the PROV
ontology, the PROV conceptual model, the PROV notation, and the PROV
XML schema, allowing provenance descriptions to be expressed,
represented in various representations, and interchanged between systems across the Web.
</p>
-<p>[<cite><a class="bibref" href="#bib-PROV-DM">PROV-DM</a></cite>] specifies Collection as an entity that provides a structure to some constituents, which are themselves entities. However, some applications may need a mechanism to specify more structure to a Collection, in order to accurately describe its provenance.</p>
+<p>[<cite><a href="#bib-PROV-DM" class="bibref">PROV-DM</a></cite>] specifies Collection as an entity that provides a structure to some constituents, which are themselves entities. However, some applications may need a mechanism to specify more structure to a Collection, in order to accurately describe its provenance.</p>
<p>Therefore, this document introduces a new concept, <a>Dictionary</a>, that has a logical structure consisting of key-entity pairs.</p>
</section>
@@ -919,7 +919,7 @@
<section id="dictionary-conceptual-definition">
<!--OddPage--><h2><span class="secno">3. </span>Conceptual Definition of Dictionary</h2>
-<p>In this section a specific type of <a href="http://www.w3.org/TR/2013/PR-prov-dm-20130312/#component6">collection</a>, as specified in [<cite><a class="bibref" href="#bib-PROV-DM">PROV-DM</a></cite>], is introduced. This new type of collection, Dictionary, is specified as follows.</p>
+<p>In this section a specific type of <a href="http://www.w3.org/TR/2013/PR-prov-dm-20130312/#component6">collection</a>, as specified in [<cite><a href="#bib-PROV-DM" class="bibref">PROV-DM</a></cite>], is introduced. This new type of collection, Dictionary, is specified as follows.</p>
<span class="glossary-ref"></span>
@@ -945,7 +945,7 @@
<p>Note that the complete content of a dictionary is unknown unless it can be traced back to an empty dictionary through a series of insertions and removals. If an asserter wants to explicitly state that a dictionary is empty, it is recommended that the <span class="name">prov:type</span> <span class="name">prov:EmptyDictionary</span> is used.
-</p><div class="anexample" id="example_1"><div class="anexampleTitle">Example 1<sup><a class="internalDFN" href="#example_1"><span class="diamond"> ?</span></a></sup></div>
+</p><div id="example_1" class="anexample"><div class="anexampleTitle">Example 1<sup><a href="#example_1" class="internalDFN"><span class="diamond"> â—Š</span></a></sup></div>
<pre class="codeexample">entity(d0, [prov:type='prov:EmptyDictionary' ]) // d0 is an empty dictionary
entity(d1, [prov:type='prov:Dictionary' ]) // d1 is a dictionary, with (so far) unknown content
</pre>
@@ -962,7 +962,7 @@
</p>
<div class="attributes" id="attributes-hadMember-d">
- A <dfn title="hadMember-d" id="dfn-hadmember-d" class="internalDFN">dictionary membership</dfn><sup><a class="internalDFN" href="#dfn-hadmember-d"><span class="diamond"> ?</span></a></sup> relation, written <span class="pnExpression">prov:hadDictionaryMember(d, e_1, key_1)</span>, has:
+ A <dfn class="internalDFN" id="dfn-hadmember-d" title="hadMember-d">dictionary membership</dfn><sup><a href="#dfn-hadmember-d" class="internalDFN"><span class="diamond"> â—Š</span></a></sup> relation, written <span class="pnExpression">prov:hadDictionaryMember(d, e_1, key_1)</span>, has:
<ul>
<li><span class="attribute" id="membership-d.dictionary">dictionary</span>: an identifier (<span class="name">d</span>) for the dictionary whose members are asserted; </li>
<li><span class="attribute" id="membership-d.entity">entity</span>: an entity <span class="name">e_1</span> that is associated with the key and is a member of the dictionary;</li>
@@ -973,7 +973,7 @@
</div>
-<div class="anexample" id="example_2"><div class="anexampleTitle">Example 2<sup><a class="internalDFN" href="#example_2"><span class="diamond"> ?</span></a></sup></div>
+<div id="example_2" class="anexample"><div class="anexampleTitle">Example 2<sup><a href="#example_2" class="internalDFN"><span class="diamond"> â—Š</span></a></sup></div>
<pre class="codeexample">entity(d, [prov:type='prov:Dictionary' ]) // d is a dictionary, with (so far) unknown content
entity(e1)
@@ -999,15 +999,15 @@
<span class="glossary-ref"></span>
<div class="attributes" id="attributes-derivedByInsertionFrom">
-<p>An <dfn title="derivedByInsertionFrom" id="dfn-derivedbyinsertionfrom" class="internalDFN">Insertion</dfn><sup><a class="internalDFN" href="#dfn-derivedbyinsertionfrom"><span class="diamond"> ?</span></a></sup> relation<span class="withPn">, written <span class="pnExpression">prov:derivedByInsertionFrom(id; d2, d1, {(key_1, e_1), ..., (key_n, e_n)}, attrs)</span>,</span> has:</p>
+<p>An <dfn class="internalDFN" id="dfn-derivedbyinsertionfrom" title="derivedByInsertionFrom">Insertion</dfn><sup><a href="#dfn-derivedbyinsertionfrom" class="internalDFN"><span class="diamond"> â—Š</span></a></sup> relation<span class="withPn">, written <span class="pnExpression">prov:derivedByInsertionFrom(id; d2, d1, {(key_1, e_1), ..., (key_n, e_n)}, attrs)</span>,</span> has:</p>
<ul>
-<li><span class="attribute" id="insertion.id">id</span>: an <em class="rfc2119" title="OPTIONAL">OPTIONAL</em> identifier identifying the relation;</li>
+<li><span class="attribute" id="insertion.id">id</span>: an <em title="OPTIONAL" class="rfc2119">OPTIONAL</em> identifier identifying the relation;</li>
<li><span class="attribute" id="insertion.after">after</span>: an identifier (<span class="name">d2</span>) for the dictionary <em>after</em> insertion; </li>
<li><span class="attribute" id="insertion.before">before</span>: an identifier (<span class="name">d1</span>) for the dictionary <em>before</em> insertion;</li>
<li><span class="attribute" id="insertion.key-entity-set">key-entity-set</span>: all inserted key-entity pairs <span class="name">(key_1, e_1)</span>, ..., <span class="name">(key_n, e_n)</span>. Here, each <span class="name">key_i</span> is a <a href=" http://www.w3.org/TR/2013/PR-prov-dm-20130312/#term-value">value</a>, and <span class="name">e_i</span> is an identifier for the entity that has been inserted with the key;
each <span class="name">key_i</span> is expected to be unique for the key-entity-set, as formalized in <a href="#key-single-entity-inference">Inference D3</a>;
</li>
-<li><span class="attribute" id="insertion.attributes">attributes</span>: an <em class="rfc2119" title="OPTIONAL">OPTIONAL</em> set (<span class="name">attrs</span>) of attribute-value pairs representing additional information about this relation.</li>
+<li><span class="attribute" id="insertion.attributes">attributes</span>: an <em title="OPTIONAL" class="rfc2119">OPTIONAL</em> set (<span class="name">attrs</span>) of attribute-value pairs representing additional information about this relation.</li>
</ul>
</div>
@@ -1016,7 +1016,7 @@
following the insertion of key-entity pairs <span class="name">(key_1, e_1)</span>, ..., <span class="name">(key_n, e_n)</span> into dictionary <span class="name">d1</span>. In other words, the set of key-entity pairs <span class="name">{(key_1, e_1), ...,(key_n, e_n)}</span> is to be seen as the difference between <span class="name">d1</span> and <span class="name">d2</span>.
Note that this key-entity-set is considered to be complete. This means that we assume that no unknown keys were inserted in or removed from a dictionary derived by an insertion relation. This is formalized in <a href="#membership-insertion-membership-inference">Inference D4</a>.</p>
-<div class="anexample" id="example_3"><div class="anexampleTitle">Example 3<sup><a class="internalDFN" href="#example_3"><span class="diamond"> ?</span></a></sup></div>
+<div id="example_3" class="anexample"><div class="anexampleTitle">Example 3<sup><a href="#example_3" class="internalDFN"><span class="diamond"> â—Š</span></a></sup></div>
<pre class="codeexample">entity(d0, [prov:type='prov:EmptyDictionary' ]) // d0 is an empty dictionary
entity(e1)
entity(e2)
@@ -1037,7 +1037,7 @@
<p>Futhermore, insertion provides an "update semantics" for the keys that are already present in a dictionary,
since a new pair replaces an existing pair with the same key in the new dictionary. This is illustrated by the following example.</p>
-<div class="anexample" id="example_4"><div class="anexampleTitle">Example 4<sup><a class="internalDFN" href="#example_4"><span class="diamond"> ?</span></a></sup></div>
+<div id="example_4" class="anexample"><div class="anexampleTitle">Example 4<sup><a href="#example_4" class="internalDFN"><span class="diamond"> â—Š</span></a></sup></div>
<pre class="codeexample">entity(d0, [prov:type='prov:EmptyDictionary' ]) // d0 is an empty dictionary
entity(e1)
entity(e2)
@@ -1067,13 +1067,13 @@
<div class="attributes" id="attributes-derivedByRemovalFrom">
-<p> A <dfn title="derivedByRemovalFrom" id="dfn-derivedbyremovalfrom" class="internalDFN">Removal</dfn><sup><a class="internalDFN" href="#dfn-derivedbyremovalfrom"><span class="diamond"> ?</span></a></sup> relation, written <span class="pnExpression">prov:derivedByRemovalFrom(id; d2, d1, {key_1, ... key_n}, attrs)</span>, has:</p>
+<p> A <dfn class="internalDFN" id="dfn-derivedbyremovalfrom" title="derivedByRemovalFrom">Removal</dfn><sup><a href="#dfn-derivedbyremovalfrom" class="internalDFN"><span class="diamond"> â—Š</span></a></sup> relation, written <span class="pnExpression">prov:derivedByRemovalFrom(id; d2, d1, {key_1, ... key_n}, attrs)</span>, has:</p>
<ul>
-<li><span class="attribute" id="removal.id">id</span>: an <em class="rfc2119" title="OPTIONAL">OPTIONAL</em> identifier identifying the relation;</li>
+<li><span class="attribute" id="removal.id">id</span>: an <em title="OPTIONAL" class="rfc2119">OPTIONAL</em> identifier identifying the relation;</li>
<li><span class="attribute" id="removal.after">after</span>: an identifier (<span class="name">d2</span>) for the dictionary <em>after</em> the deletion; </li>
<li><span class="attribute" id="removal.before">before</span>: an identifier (<span class="name">d1</span>) for the dictionary <em>before</em> the deletion;</li>
<li><span class="attribute" id="removal.key-set">key-set</span>: the set of deleted keys <span class="name">key_1</span>, ..., <span class="name">key_n</span>. Here, each <span class="name">key_i</span> is a <a href=" http://www.w3.org/TR/2013/PR-prov-dm-20130312/#term-value">value</a>;</li>
-<li><span class="attribute" id="removal.attributes">attributes</span>: an <em class="rfc2119" title="OPTIONAL">OPTIONAL</em> set (<span class="name">attrs</span>) of attribute-value pairs representing additional information about this relation.</li>
+<li><span class="attribute" id="removal.attributes">attributes</span>: an <em title="OPTIONAL" class="rfc2119">OPTIONAL</em> set (<span class="name">attrs</span>) of attribute-value pairs representing additional information about this relation.</li>
</ul>
</div>
@@ -1081,7 +1081,7 @@
In other words, the key-set <span class="name">{key_1,...,key_n}</span> is to be seen as the difference in keys and corresponding entities between <span class="name">d1</span> and <span class="name">d2</span>. Note that this key-set is considered to be complete. This means that we assume that no unknown keys were inserted in or removed from a dictionary derived by a removal relation. This is formalized in <a href="#membership-removal-membership-inference">Inference D5</a>.
</p>
-<div class="anexample" id="example_5"><div class="anexampleTitle">Example 5<sup><a class="internalDFN" href="#example_5"><span class="diamond"> ?</span></a></sup></div>
+<div id="example_5" class="anexample"><div class="anexampleTitle">Example 5<sup><a href="#example_5" class="internalDFN"><span class="diamond"> â—Š</span></a></sup></div>
<pre class="codeexample">entity(d0, [prov:type="prov:EmptyDictionary"]) // d0 is an empty dictionary
entity(e1)
entity(e2)
@@ -1118,11 +1118,11 @@
<section id="expression-dictionary">
<h3><span class="secno">4.1 </span>Dictionary and EmptyDictionary Expression</h3>
- PROV-Dictionary provides no dedicated syntax for Dictionary and EmptyDictionary. Dictionaries are declared in <a href="http://www.w3.org/TR/2013/PR-prov-n-20130312/#expression-collection">the same way</a> as Collections. A Dictionary or an EmptyDictionary <em class="rfc2119" title="MUST">MUST</em> be expressed as an
+ PROV-Dictionary provides no dedicated syntax for Dictionary and EmptyDictionary. Dictionaries are declared in <a href="http://www.w3.org/TR/2013/PR-prov-n-20130312/#expression-collection">the same way</a> as Collections. A Dictionary or an EmptyDictionary <em title="MUST" class="rfc2119">MUST</em> be expressed as an
<code class="content"><a class="grammarRef" href="http://www.w3.org/TR/2013/PR-prov-n-20130312/#prod-entityExpression">entityExpression</a></code> with attribute
<span id="provn-type-Dictionary"><code>prov:type='prov:Dictionary'</code></span>, or
<span id="provn-type-EmptyDictionary"><code>prov:type='prov:EmptyDictionary'</code></span>, respectively.
-<div class="anexample" id="example_6"><div class="anexampleTitle">Example 6<sup><a class="internalDFN" href="#example_6"><span class="diamond"> ?</span></a></sup></div>
+<div id="example_6" class="anexample"><div class="anexampleTitle">Example 6<sup><a href="#example_6" class="internalDFN"><span class="diamond"> â—Š</span></a></sup></div>
<p>The following two expressions are about a dictionary and an empty dictionary, respectively.
</p><pre class="codeexample"> entity(ex:d1, [ prov:type='prov:Dictionary' ])
entity(ex:d2, [ prov:type='prov:EmptyDictionary' ])
@@ -1167,7 +1167,7 @@
-<div class="anexample" id="example_7"><div class="anexampleTitle">Example 7<sup><a class="internalDFN" href="#example_7"><span class="diamond"> ?</span></a></sup></div>
+<div id="example_7" class="anexample"><div class="anexampleTitle">Example 7<sup><a href="#example_7" class="internalDFN"><span class="diamond"> â—Š</span></a></sup></div>
<p>In this example, d is a dictionary known to have <span class="name">e0</span> as member, and may have other members.</p>
<pre class="codeexample">entity(e0)
@@ -1223,7 +1223,7 @@
</div>
-<div class="anexample" id="example_8"><div class="anexampleTitle">Example 8<sup><a class="internalDFN" href="#example_8"><span class="diamond"> ?</span></a></sup></div>
+<div id="example_8" class="anexample"><div class="anexampleTitle">Example 8<sup><a href="#example_8" class="internalDFN"><span class="diamond"> â—Š</span></a></sup></div>
<pre class="codeexample"> prov:derivedByInsertionFrom(id; d1, d, {("k1", e1), ("k2", e2)}, [])
</pre>
<p> Here
@@ -1291,7 +1291,7 @@
-<div class="anexample" id="example_9"><div class="anexampleTitle">Example 9<sup><a class="internalDFN" href="#example_9"><span class="diamond"> ?</span></a></sup></div>
+<div id="example_9" class="anexample"><div class="anexampleTitle">Example 9<sup><a href="#example_9" class="internalDFN"><span class="diamond"> â—Š</span></a></sup></div>
<pre class="codeexample"> prov:derivedByRemovalFrom(id; d3, d, {"k1", "k2"}, [])
</pre>
<p> Here
@@ -1368,7 +1368,7 @@
<section id="dictionary-ontological-definition">
<!--OddPage--><h2><span class="secno">5. </span>PROV-O Representation of Dictionary</h2>
-<p>In this section, the ontological definition of <code>prov:Dictionary</code> is given, in order to extend [<cite><a class="bibref" href="#bib-PROV-O">PROV-O</a></cite>] with dictionaries. For more information on the terminology, syntax and conventions used in this section, we refer to [<cite><a class="bibref" href="#bib-PROV-O">PROV-O</a></cite>].</p>
+<p>In this section, the ontological definition of <code>prov:Dictionary</code> is given, in order to extend [<cite><a href="#bib-PROV-O" class="bibref">PROV-O</a></cite>] with dictionaries. For more information on the terminology, syntax and conventions used in this section, we refer to [<cite><a href="#bib-PROV-O" class="bibref">PROV-O</a></cite>].</p>
<p>The classes and properties defined in this document are included in the default namespace of PROV.
Users of the ontology have the option of importing <code><http://www.w3.org/ns/prov#></code>, which includes all extensions, including PROV-Dictionary. Additionally, the [<a href="prov-dictionary.owl">OWL file for PROV-Dictionary</a>] is available for download.</p>
@@ -1400,7 +1400,7 @@
.</pre></div>
</div>
-<p>It is worth noting that <code>:d1</code> <em class="rfc2119" title="MAY">MAY</em> also
+<p>It is worth noting that <code>:d1</code> <em title="MAY" class="rfc2119">MAY</em> also
have other members. If one wants to explicitly state that a dictionary has no members, that dictionary can be described as an instance of the
subclass <a class="qname" href="#EmptyDictionary"><code>prov:EmptyDictionary</code></a>.
</p>
@@ -2537,7 +2537,7 @@
<section id="dictionary-xml-schema">
<!--OddPage--><h2><span class="secno">6. </span>PROV-XML Representation of Dictionary</h2>
This section details how to describe dictionaries with
-the [<cite><a class="bibref" href="#bib-PROV-XML">PROV-XML</a></cite>] serialization. The [<a href="http://www.w3.org/TR/2013/WD-prov-xml-20130312/schema/prov-dictionary.xsd">XML schema for PROV-Dictionary</a>] is available for download, and includes <a href="http://www.w3.org/TR/2013/WD-prov-xml-20130312/schema/prov-core.xsd">prov-core.xsd</a>, the core schema of PROV. Alternatively, the default schema, <a href="http://www.w3.org/TR/2013/WD-prov-xml-20130312/schema/prov.xsd">prov.xsd</a> can be used, which imports <a href="http://www.w3.org/TR/2013/WD-prov-xml-20130312/schema/prov-core.xsd">prov-core.xsd</a> and all extension schemas developed by the Working Group.
+the [<cite><a href="#bib-PROV-XML" class="bibref">PROV-XML</a></cite>] serialization. The [<a href="http://www.w3.org/TR/2013/WD-prov-xml-20130312/schema/prov-dictionary.xsd">XML schema for PROV-Dictionary</a>] is available for download, and includes <a href="http://www.w3.org/TR/2013/WD-prov-xml-20130312/schema/prov-core.xsd">prov-core.xsd</a>, the core schema of PROV. Alternatively, the default schema, <a href="http://www.w3.org/TR/2013/WD-prov-xml-20130312/schema/prov.xsd">prov.xsd</a> can be used, which imports <a href="http://www.w3.org/TR/2013/WD-prov-xml-20130312/schema/prov-core.xsd">prov-core.xsd</a> and all extension schemas developed by the Working Group.
<section id="term-Dictionary">
<h3><span class="secno">6.1 </span>Dictionary</h3>
<div class="glossary-ref"></div>
@@ -2769,9 +2769,9 @@
<section id="dictionary-constraints">
<!--OddPage--><h2><span class="secno">7. </span>Constraints Associated with Dictionary</h2>
-In this section, we specify some inferences and constraints associated with dictionaries. These inferences and constraints <em class="rfc2119" title="MAY">MAY</em> be applied to obtain valid provenance when using dictionaries. For more information about valid provenance and its purpose, we refer to the <a href="http://www.w3.org/TR/2013/PR-prov-constraints-20130312/#purpose">disclaimer</a> in [<cite><a class="bibref" href="#bib-PROV-CONSTRAINTS">PROV-CONSTRAINTS</a></cite>].
-Whereas collections were deliberately left unconstrained in [<cite><a class="bibref" href="#bib-PROV-DM">PROV-DM</a></cite>] and [<cite><a class="bibref" href="#bib-PROV-CONSTRAINTS">PROV-CONSTRAINTS</a></cite>] to remain as general as possible, dictionaries are intended to provide more structure, and thus, are constrained more strictly.
-For more information on how to read this section, we refer to [<cite><a class="bibref" href="#bib-PROV-CONSTRAINTS">PROV-CONSTRAINTS</a></cite>].
+In this section, we specify some inferences and constraints associated with dictionaries. These inferences and constraints <em title="MAY" class="rfc2119">MAY</em> be applied to obtain valid provenance when using dictionaries. For more information about valid provenance and its purpose, we refer to the <a href="http://www.w3.org/TR/2013/PR-prov-constraints-20130312/#purpose">disclaimer</a> in [<cite><a href="#bib-PROV-CONSTRAINTS" class="bibref">PROV-CONSTRAINTS</a></cite>].
+Whereas collections were deliberately left unconstrained in [<cite><a href="#bib-PROV-DM" class="bibref">PROV-DM</a></cite>] and [<cite><a href="#bib-PROV-CONSTRAINTS" class="bibref">PROV-CONSTRAINTS</a></cite>] to remain as general as possible, dictionaries are intended to provide more structure, and thus, are constrained more strictly.
+For more information on how to read this section, we refer to [<cite><a href="#bib-PROV-CONSTRAINTS" class="bibref">PROV-CONSTRAINTS</a></cite>].
<section id="dictionary-constraints-notation">
<h3><span class="secno">7.1 </span>Notation and Conventions</h3>
<p>In the constraints below, statements are made concerning the equality of sets of key-entity pairs and sets of keys. For the sake of clarity, we will explain the used notations here.</p>
@@ -2795,7 +2795,7 @@
<div class="inference" id="cmembership-dmembership-inference">
<span class="ruleTitle"><a class="internalDFN" href="#cmembership-dmembership-inference">Inference D2 (collection-membership-dictionary-membership)</a></span>
<p>
-<span class="conditional">IF</span> <span class="name">hadMember(d, e)</span> and <span class="name">'prov:Dictionary' ? typeOf(d)</span> <span class="conditional">THEN</span> there exists a
+<span class="conditional">IF</span> <span class="name">hadMember(d, e)</span> and <span class="name">'prov:Dictionary' ∈ typeOf(d)</span> <span class="conditional">THEN</span> there exists a
key <span class="name">k</span> such that <span class="name">prov:hadDictionaryMember(d, e, k)</span>
</p></div>
@@ -2814,11 +2814,11 @@
<p>Here, KV1 is a set of key-entity pairs and K1 is the key-set of KV1.</p>
<ol>
<li><span class="conditional">IF</span> <span class="name">prov:hadDictionaryMember(d1, e, k)</span>
- and <span class="name">prov:derivedByInsertionFrom(d2, d1, KV1)</span> and <span class="name">k</span> ? <span class="name">K1</span>
+ and <span class="name">prov:derivedByInsertionFrom(d2, d1, KV1)</span> and <span class="name">k</span> ∉ <span class="name">K1</span>
<span class="conditional">THEN</span> <span class="name">prov:hadDictionaryMember(d2, e, k)</span></li>
<li><span class="conditional">IF</span> <span class="name">prov:hadDictionaryMember(d2, e, k)</span>
- and <span class="name">prov:derivedByInsertionFrom(d2, d1, KV1)</span> and <span class="name">k</span> ? <span class="name">K1</span>
+ and <span class="name">prov:derivedByInsertionFrom(d2, d1, KV1)</span> and <span class="name">k</span> ∉ <span class="name">K1</span>
<span class="conditional">THEN</span> <span class="name">prov:hadDictionaryMember(d1, e, k)</span></li>
</ol></div>
@@ -2828,7 +2828,7 @@
<p>Here, K1 is a set of keys.</p>
<ol>
<li><span class="conditional">IF</span> <span class="name">prov:hadDictionaryMember(d1, e, k)</span>
- and <span class="name">prov:derivedByRemovalFrom(d2, d1, K1)</span> and <span class="name">k</span> ? <span class="name">K1</span>
+ and <span class="name">prov:derivedByRemovalFrom(d2, d1, K1)</span> and <span class="name">k</span> ∉ <span class="name">K1</span>
<span class="conditional">THEN</span> <span class="name">prov:hadDictionaryMember(d2, e, k)</span></li>
<li><span class="conditional">IF</span> <span class="name">prov:hadDictionaryMember(d2, e, k)</span>
@@ -2851,7 +2851,7 @@
<p>Here, KV1 is a set of key-entity pairs.</p>
<p>
<span class="conditional">IF</span> <span class="name">prov:derivedByInsertionFrom(d2, d1, KV1)</span>
- <span class="conditional">THEN</span> <span class="name">prov:hadDictionaryMember(d2, e, k) for each (k, e) ? KV1</span>
+ <span class="conditional">THEN</span> <span class="name">prov:hadDictionaryMember(d2, e, k) for each (k, e) ∈ KV1</span>
</p></div>
<p id="insertion-derivation-inference_text">Insertion and removal are special cases of derivation.</p>
@@ -2883,7 +2883,7 @@
<p>Here, <span class="name">K1</span> is a set of key-entity pairs.</p>
<p>
<span class="conditional">IF</span> <span class="name">prov:derivedByRemovalFrom(d2, d1, K1)</span> and
- <span class="name">prov:hadDictionaryMember(d2, e, k)</span> and <span class="name">k ? K1</span> <span class="conditional">THEN</span> <span class="conditional">INVALID</span>
+ <span class="name">prov:hadDictionaryMember(d2, e, k)</span> and <span class="name">k ∈ K1</span> <span class="conditional">THEN</span> <span class="conditional">INVALID</span>
</p></div>
<p id="impossible-removal-insertion_text">A dictionary must not be derived through multiple insertion or removal relations.</p>
@@ -2927,23 +2927,23 @@
<li>
<p>
<span class="conditional">IF</span> <span class="name">entity(d, [prov:type='prov:Dictionary'])</span> <span class="conditional">THEN</span>
- <span class="name">'prov:Dictionary' ? typeOf(d)</span> and <span class="name">'prov:Collection' ? typeOf(d)</span>
- and <span class="name">'entity' ? typeOf(d)</span>
+ <span class="name">'prov:Dictionary' ∈ typeOf(d)</span> and <span class="name">'prov:Collection' ∈ typeOf(d)</span>
+ and <span class="name">'entity' ∈ typeOf(d)</span>
</p>
</li>
<li>
<p>
<span class="conditional">IF</span> <span class="name">entity(d, [prov:type='prov:EmptyDictionary'])</span> <span class="conditional">THEN</span>
- <span class="name">'prov:EmptyDictionary' ? typeOf(d)</span> and <span class="name">'prov:Dictionary' ? typeOf(d)</span>
- and <span class="name">'prov:Collection' ? typeOf(d)</span>
- and <span class="name">'prov:EmptyCollection' ? typeOf(d)</span>
- and <span class="name">'entity' ? typeOf(d)</span>
+ <span class="name">'prov:EmptyDictionary' ∈ typeOf(d)</span> and <span class="name">'prov:Dictionary' ∈ typeOf(d)</span>
+ and <span class="name">'prov:Collection' ∈ typeOf(d)</span>
+ and <span class="name">'prov:EmptyCollection' ∈ typeOf(d)</span>
+ and <span class="name">'entity' ∈ typeOf(d)</span>
</p>
</li>
<li>
<p>
<span class="conditional">IF</span> <span class="name">prov:hadDictionaryMember(d, e, "k")</span> <span class="conditional">THEN</span>
- <span class="name">'prov:Dictionary' ? typeOf(d)</span> and <span class="name">'prov:Collection' ? typeOf(d)</span> and <span class="name">'entity' ? typeOf(d)</span> and <span class="name">'entity' ? typeOf(e)</span>
+ <span class="name">'prov:Dictionary' ∈ typeOf(d)</span> and <span class="name">'prov:Collection' ∈ typeOf(d)</span> and <span class="name">'entity' ∈ typeOf(d)</span> and <span class="name">'entity' ∈ typeOf(e)</span>
</p>
</li>
<li>
@@ -2951,14 +2951,14 @@
<p>Here, KV is a set of key-entity pairs</p>
<p>
<span class="conditional">IF</span> <span class="name">prov:derivedByInsertionFrom(d2, d1, KV)</span> <span class="conditional">THEN</span>
- <span class="name">'prov:Dictionary' ? typeOf(d1)</span> and <span class="name">'prov:Dictionary' ? typeOf(d2)</span> and <span class="name">'prov:Collection' ? typeOf(d1)</span> and <span class="name">'entity' ? typeOf(d1)</span> and <span class="name">'prov:Collection' ? typeOf(d2)</span> and <span class="name">'entity' ? typeOf(d2)</span> and <span class="name">'entity' ? typeOf(e1)</span>
+ <span class="name">'prov:Dictionary' ∈ typeOf(d1)</span> and <span class="name">'prov:Dictionary' ∈ typeOf(d2)</span> and <span class="name">'prov:Collection' ∈ typeOf(d1)</span> and <span class="name">'entity' ∈ typeOf(d1)</span> and <span class="name">'prov:Collection' ∈ typeOf(d2)</span> and <span class="name">'entity' ∈ typeOf(d2)</span> and <span class="name">'entity' ∈ typeOf(e1)</span>
</p>
</li>
<li>
<p>Here, K is a set of keys</p>
<p>
<span class="conditional">IF</span> <span class="name">prov:derivedByRemovalFrom(d2, d1, K)</span> <span class="conditional">THEN</span>
- <span class="name">'prov:Dictionary' ? typeOf(d1)</span> and <span class="name">'prov:Dictionary' ? typeOf(d2)</span> and <span class="name">'prov:Collection' ? typeOf(d1)</span> and <span class="name">'entity' ? typeOf(d1)</span> and <span class="name">'prov:Collection' ? typeOf(d2)</span> and <span class="name">'entity' ? typeOf(d2)</span>
+ <span class="name">'prov:Dictionary' ∈ typeOf(d1)</span> and <span class="name">'prov:Dictionary' ∈ typeOf(d2)</span> and <span class="name">'prov:Collection' ∈ typeOf(d1)</span> and <span class="name">'entity' ∈ typeOf(d1)</span> and <span class="name">'prov:Collection' ∈ typeOf(d2)</span> and <span class="name">'entity' ∈ typeOf(d2)</span>
</p>
</li>
</ol>
@@ -2968,7 +2968,7 @@
</section>
-<section class="appendix" id="example">
+<section id="example" class="appendix">
<!--OddPage--><h2><span class="secno">A. </span>Example</h2>
<p>To further clarify the use of PROV-Dictionary, we present its use in a practical scenario: tracking the provenance of a baseball team and its field positions.
@@ -2984,10 +2984,10 @@
<td>48</td><td> <a href="http://dbpedia.org/resource/Scott_Atchison" title="Scott Atchison">Scott Atchison</a></td>
<td>51</td><td> <a href="http://dbpedia.org/resource/Daniel_Bard" title="Daniel Bard">Daniel Bard</a></td></tr>
<tr><td>19</td><td> <a href="http://dbpedia.org/resource/Josh_Beckett" title="Josh Beckett">Josh Beckett</a></td>
-<td>23</td><td> <a href="http://dbpedia.org/resource/%C3%89rik_B%C3%A9dard" title="Érik Bédard">Érik Bédard</a></td>
+<td>23</td><td> <a href="http://dbpedia.org/resource/%C3%89rik_B%C3%A9dard" title="Érik Bédard">Érik Bédard</a></td>
<td>64</td><td> <a href="http://dbpedia.org/resource/Michael_Bowden_(baseball)" title="Michael Bowden (baseball)">Michael Bowden</a></td>
<td>11</td><td> <a href="http://dbpedia.org/resource/Clay_Buchholz" title="Clay Buchholz">Clay Buchholz</a></td></tr>
-<tr><td>61</td><td> <a href="http://dbpedia.org/resource/F%C3%A9lix_Doubront" title="Félix Doubront">Félix Doubront</a></td>
+<tr><td>61</td><td> <a href="http://dbpedia.org/resource/F%C3%A9lix_Doubront" title="Félix Doubront">Félix Doubront</a></td>
<td>53</td><td> <a href="http://dbpedia.org/resource/Rich_Hill_(pitcher)" title="Rich Hill (pitcher)">Rich Hill</a></td>
<td>68</td><td> <a href="http://dbpedia.org/resource/Tommy_Hottovy" title="Tommy Hottovy">Tommy Hottovy</a></td>
<td>52</td><td> <a href="http://dbpedia.org/resource/Bobby_Jenks" title="Bobby Jenks">Bobby Jenks</a></td></tr>
@@ -3009,9 +3009,9 @@
<td>39</td><td> <a href="http://dbpedia.org/resource/Jarrod_Saltalamacchia" title="Jarrod Saltalamacchia">Jarrod Saltalamacchia</a></td></tr>
<tr><td>33</td><td> <a href="http://dbpedia.org/resource/Jason_Varitek" title="Jason Varitek">Jason Varitek</a></td>
<td>62</td><td> <a href="http://dbpedia.org/resource/Lars_Anderson_(baseball)" title="Lars Anderson (baseball)">Lars Anderson</a></td>
-<td>3</td><td> <a href="http://dbpedia.org/resource/Mike_Avil%C3%A9s" title="Mike Avilés">Mike Avilés</a></td>
+<td>3</td><td> <a href="http://dbpedia.org/resource/Mike_Avil%C3%A9s" title="Mike Avilés">Mike Avilés</a></td>
<td>28</td><td> <a href="http://dbpedia.org/resource/Adrian_Gonzalez" title="Adrian Gonzalez">Adrian Gonzalez</a></td></tr>
-<tr><td>76</td><td> <a href="http://dbpedia.org/resource/Jos%C3%A9_Iglesias_(baseball)" title="José Iglesias (baseball)">José Iglesias</a></td>
+<tr><td>76</td><td> <a href="http://dbpedia.org/resource/Jos%C3%A9_Iglesias_(baseball)" title="José Iglesias (baseball)">José Iglesias</a></td>
<td>12</td><td> <a href="http://dbpedia.org/resource/Jed_Lowrie" title="Jed Lowrie">Jed Lowrie</a></td>
<td>60</td><td> <a href="http://dbpedia.org/resource/Yamaico_Navarro" title="Yamaico Navarro">Yamaico Navarro</a></td>
<td>34</td><td> <a href="http://dbpedia.org/resource/David_Ortiz" title="David Ortiz">David Ortiz</a></td></tr>
@@ -3045,7 +3045,7 @@
<td>11</td><td> <a href="http://dbpedia.org/resource/Clay_Buchholz" title="Clay Buchholz">Clay Buchholz</a></td>
<td>52</td><td> <a href="http://dbpedia.org/resource/Chris_Carpenter" title="Chris Carpenter">Chris Carpenter</a></td>
<td>35</td><td> <a href="http://dbpedia.org/resource/Aaron_Cook_(baseball)" title="Aaron Cook (baseball)">Aaron Cook</a></td></tr>
-<tr><td>61</td><td> <a href="http://dbpedia.org/resource/F%C3%A9lix_Doubront" title="Félix Doubront">Félix Doubront</a></td>
+<tr><td>61</td><td> <a href="http://dbpedia.org/resource/F%C3%A9lix_Doubront" title="Félix Doubront">Félix Doubront</a></td>
<td>47</td><td> <a href="http://dbpedia.org/resource/Justin_Germano" title="Justin Germano">Justin Germano</a></td>
<td>53</td><td> <a href="http://dbpedia.org/resource/Rich_Hill_(pitcher)" title="Rich Hill (pitcher)">Rich Hill</a></td>
<td>31</td><td> <a href="http://dbpedia.org/resource/Jon_Lester" title="Jon Lester">Jon Lester</a></td></tr>
@@ -3059,16 +3059,16 @@
<td>63</td><td> <a href="http://dbpedia.org/resource/Junichi_Tazawa" title="Junichi Tazawa">Junichi Tazawa</a></td></tr>
<tr><td>78</td><td> <a href="http://dbpedia.org/resource/Justin_Thomas" title="Justin Thomas">Justin Thomas</a></td>
<td>60</td><td> <a href="http://dbpedia.org/resource/Ryan_Lavarnway" title="Ryan Lavarnway">Ryan Lavarnway</a></td>
-<td>62</td><td> <a href="http://dbpedia.org/resource/Guillermo_Quir%C3%B3z" title="Guillermo Quiróz">Guillermo Quiróz</a></td>
+<td>62</td><td> <a href="http://dbpedia.org/resource/Guillermo_Quir%C3%B3z" title="Guillermo Quiróz">Guillermo Quiróz</a></td>
<td>39</td><td> <a href="http://dbpedia.org/resource/Jarrod_Saltalamacchia" title="Jarrod Saltalamacchia">Jarrod Saltalamacchia</a></td></tr>
<tr><td>10</td><td> <a href="http://dbpedia.org/resource/Kelly_Shoppach" title="Kelly Shoppach">Kelly Shoppach</a></td>
<td>62</td><td> <a href="http://dbpedia.org/resource/Lars_Anderson_(baseball)" title="Lars Anderson (baseball)">Lars Anderson</a></td>
-<td>3</td><td> <a href="http://dbpedia.org/resource/Mike_Avil%C3%A9s" title="Mike Avilés">Mike Avilés</a></td>
+<td>3</td><td> <a href="http://dbpedia.org/resource/Mike_Avil%C3%A9s" title="Mike Avilés">Mike Avilés</a></td>
<td>77</td><td> <a href="http://dbpedia.org/resource/Pedro_Ciriaco" title="Pedro Ciriaco">Pedro Ciriaco</a></td></tr>
-<tr><td>56</td><td> <a href="http://dbpedia.org/resource/Iv%C3%A1n_DeJes%C3%BAs,_Jr." title="Iván DeJesús, Jr.">Iván DeJesús, Jr.</a></td>
+<tr><td>56</td><td> <a href="http://dbpedia.org/resource/Iv%C3%A1n_DeJes%C3%BAs,_Jr." title="Iván DeJesús, Jr.">Iván DeJesús, Jr.</a></td>
<td>50</td><td> <a href="http://dbpedia.org/resource/Mauro_Gomez" title="Mauro Gomez" class="mw-redirect">Mauro Gomez</a></td>
<td>28</td><td> <a href="http://dbpedia.org/resource/Adrian_Gonzalez" title="Adrian Gonzalez">Adrian Gonzalez</a></td>
-<td>58</td><td> <a href="http://dbpedia.org/resource/Jos%C3%A9_Iglesias_(baseball)" title="José Iglesias (baseball)">José Iglesias</a></td></tr>
+<td>58</td><td> <a href="http://dbpedia.org/resource/Jos%C3%A9_Iglesias_(baseball)" title="José Iglesias (baseball)">José Iglesias</a></td></tr>
<tr><td>23</td><td> <a href="http://dbpedia.org/resource/Brent_Lillibridge" title="Brent Lillibridge">Brent Lillibridge</a></td>
<td>22</td><td> <a href="http://dbpedia.org/resource/James_Loney_(baseball)" title="James Loney (baseball)" class="mw-redirect">James Loney</a></td>
<td>64</td><td> <a href="http://dbpedia.org/resource/Will_Middlebrooks" title="Will Middlebrooks">Will Middlebrooks</a></td>
@@ -3118,7 +3118,7 @@
<tr><td>RF</td><td><a href="http://dbpedia.org/resource/Ryan_Sweeney" title="Ryan Sweeney">Ryan Sweeney</a></td></tr>
<tr><td>LF</td><td><a href="http://dbpedia.org/resource/Cody_Ross" title="Cody Ross">Cody Ross</a></td></tr>
<tr><td>C</td><td><a href="http://dbpedia.org/resource/Jarrod_Saltalamacchia" title="Jarrod Saltalamacchia">Jarrod Saltalamacchia</a></td></tr>
- <tr><td>SS</td><td><a href="http://dbpedia.org/resource/Mike_Avil%C3%A9s" title="Mike Avilés">Mike Avilés</a></td></tr>
+ <tr><td>SS</td><td><a href="http://dbpedia.org/resource/Mike_Avil%C3%A9s" title="Mike Avilés">Mike Avilés</a></td></tr>
<tr><td>SP</td><td><a href="http://dbpedia.org/resource/Jon_Lester" title="Jon Lester">Jon Lester</a></td></tr>
</tbody></table>
</section> <!-- data -->
@@ -3654,7 +3654,7 @@
</section>
</section>
</section>
-<section class="appendix" id="change-log">
+<section id="change-log" class="appendix">
<!--OddPage--><h2><span class="secno">B. </span>Change Log</h2>
<section id="change-log-since-first-public-working-draft">
<h3><span class="secno">B.1 </span>Change Log Since First Public Working Draft</h3>
@@ -3676,11 +3676,11 @@
</section>
-<section class="appendix" id="acknowledgements">
+<section id="acknowledgements" class="appendix">
<!--OddPage--><h2><span class="secno">C. </span>Acknowledgements</h2>
<p>This document has been produced by the PROV Working Group, and its contents reflect extensive discussion within the Working Group as a whole. The editors would especially like to thank Paolo Missier, James Cheney, Luc Moreau, Paul Groth, Stian Soiland-Reyes, Khalid Belhajjame, Timothy Lebo, Curt Tilmes, Stephan Zednik, Graham Klyne and Simon Miles for their contributions and their detailed reviews of this document. </p>
<p>
- Members of the Provenance Working Group at the time of publication of this document were: Ilkay Altintas (Invited expert), Reza B'Far (Oracle Corporation), Khalid Belhajjame (University of Manchester), James Cheney (University of Edinburgh, School of Informatics), Sam Coppens (iMinds - Ghent University), David Corsar (University of Aberdeen, Computing Science), Stephen Cresswell (The National Archives), Tom De Nies (iMinds - Ghent University), Helena Deus (DERI Galway at the National University of Ireland, Galway, Ireland), Simon Dobson (Invited expert), Martin Doerr (Foundation for Research and Technology - Hellas(FORTH)), Kai Eckert (Invited expert), Jean-Pierre EVAIN (European Broadcasting Union, EBU-UER), James Frew (Invited expert), Irini Fundulaki (Foundation for Research and Technology - Hellas(FORTH)), Daniel Garijo (Universidad Politécnica de Madrid), Yolanda Gil (Invited expert), Ryan Golden (Oracle Corporation), Paul Groth (Vrije Universiteit), Olaf Hartig (Invited expert), David Hau (National Cancer Institute, NCI), Sandro Hawke (<abbr title="World Wide Web Consortium">W3C</abbr>/<abbr title="Massachusetts Institute of Technology">MIT</abbr>), Jörn Hees (German Research Center for Artificial Intelligence (DFKI) Gmbh), Ivan Herman, (<abbr title="World Wide Web Consortium">W3C</abbr>/<abbr title="European Research Consortium for Informatics and Mathematics">ERCIM</abbr>), Ralph Hodgson (TopQuadrant), Hook Hua (Invited expert), Trung Dong Huynh (University of Southampton), Graham Klyne (University of Oxford), Michael Lang (Revelytix, Inc.), Timothy Lebo (Rensselaer Polytechnic Institute), James McCusker (Rensselaer Polytechnic Institute), Deborah McGuinness (Rensselaer Polytechnic Institute), Simon Miles (Invited expert), Paolo Missier (School of Computing Science, Newcastle university), Luc Moreau (University of Southampton), James Myers (Rensselaer Polytechnic Institute), Vinh Nguyen (Wright State University), Edoardo Pignotti (University of Aberdeen, Computing Science), Paulo da Silva Pinheiro (Rensselaer Polytechnic Institute), Carl Reed (Open Geospatial Consortium), Adam Retter (Invited Expert), Christine Runnegar (Invited expert), Satya Sahoo (Invited expert), David Schaengold (Revelytix, Inc.), Daniel Schutzer (FSTC, Financial Services Technology Consortium), Yogesh Simmhan (Invited expert), Stian Soiland-Reyes (University of Manchester), Eric Stephan (Pacific Northwest National Laboratory), Linda Stewart (The National Archives), Ed Summers (Library of Congress), Maria Theodoridou (Foundation for Research and Technology - Hellas(FORTH)), Ted Thibodeau (OpenLink Software Inc.), Curt Tilmes (National Aeronautics and Space Administration), Craig Trim (IBM Corporation), Stephan Zednik (Rensselaer Polytechnic Institute), Jun Zhao (University of Oxford), Yuting Zhao (University of Aberdeen, Computing Science).
+ Members of the Provenance Working Group at the time of publication of this document were: Ilkay Altintas (Invited expert), Reza B'Far (Oracle Corporation), Khalid Belhajjame (University of Manchester), James Cheney (University of Edinburgh, School of Informatics), Sam Coppens (iMinds - Ghent University), David Corsar (University of Aberdeen, Computing Science), Stephen Cresswell (The National Archives), Tom De Nies (iMinds - Ghent University), Helena Deus (DERI Galway at the National University of Ireland, Galway, Ireland), Simon Dobson (Invited expert), Martin Doerr (Foundation for Research and Technology - Hellas(FORTH)), Kai Eckert (Invited expert), Jean-Pierre EVAIN (European Broadcasting Union, EBU-UER), James Frew (Invited expert), Irini Fundulaki (Foundation for Research and Technology - Hellas(FORTH)), Daniel Garijo (Universidad Politécnica de Madrid), Yolanda Gil (Invited expert), Ryan Golden (Oracle Corporation), Paul Groth (Vrije Universiteit), Olaf Hartig (Invited expert), David Hau (National Cancer Institute, NCI), Sandro Hawke (<abbr title="World Wide Web Consortium">W3C</abbr>/<abbr title="Massachusetts Institute of Technology">MIT</abbr>), Jörn Hees (German Research Center for Artificial Intelligence (DFKI) Gmbh), Ivan Herman, (<abbr title="World Wide Web Consortium">W3C</abbr>/<abbr title="European Research Consortium for Informatics and Mathematics">ERCIM</abbr>), Ralph Hodgson (TopQuadrant), Hook Hua (Invited expert), Trung Dong Huynh (University of Southampton), Graham Klyne (University of Oxford), Michael Lang (Revelytix, Inc.), Timothy Lebo (Rensselaer Polytechnic Institute), James McCusker (Rensselaer Polytechnic Institute), Deborah McGuinness (Rensselaer Polytechnic Institute), Simon Miles (Invited expert), Paolo Missier (School of Computing Science, Newcastle university), Luc Moreau (University of Southampton), James Myers (Rensselaer Polytechnic Institute), Vinh Nguyen (Wright State University), Edoardo Pignotti (University of Aberdeen, Computing Science), Paulo da Silva Pinheiro (Rensselaer Polytechnic Institute), Carl Reed (Open Geospatial Consortium), Adam Retter (Invited Expert), Christine Runnegar (Invited expert), Satya Sahoo (Invited expert), David Schaengold (Revelytix, Inc.), Daniel Schutzer (FSTC, Financial Services Technology Consortium), Yogesh Simmhan (Invited expert), Stian Soiland-Reyes (University of Manchester), Eric Stephan (Pacific Northwest National Laboratory), Linda Stewart (The National Archives), Ed Summers (Library of Congress), Maria Theodoridou (Foundation for Research and Technology - Hellas(FORTH)), Ted Thibodeau (OpenLink Software Inc.), Curt Tilmes (National Aeronautics and Space Administration), Craig Trim (IBM Corporation), Stephan Zednik (Rensselaer Polytechnic Institute), Jun Zhao (University of Oxford), Yuting Zhao (University of Aberdeen, Computing Science).
</p>
</section>
@@ -3688,7 +3688,7 @@
-<section id="references" class="appendix"><!--OddPage--><h2><span class="secno">D. </span>References</h2><section id="informative-references"><h3><span class="secno">D.1 </span>Informative references</h3><dl class="bibliography"><dt id="bib-PROV-AQ">[PROV-AQ]</dt><dd>Graham Klyne; Paul Groth; eds. <a href="http://www.w3.org/TR/2013/NOTE-prov-aq-20130430/"><cite>Provenance Access and Query</cite></a>. 30 April 2013, W3C Note. URL: <a href="http://www.w3.org/TR/2013/NOTE-prov-aq-20130430/">http://www.w3.org/TR/2013/NOTE-prov-aq-20130430/</a>
+<section class="appendix" id="references"><!--OddPage--><h2><span class="secno">D. </span>References</h2><section id="informative-references"><h3><span class="secno">D.1 </span>Informative references</h3><dl class="bibliography"><dt id="bib-PROV-AQ">[PROV-AQ]</dt><dd>Graham Klyne; Paul Groth; eds. <a href="http://www.w3.org/TR/2013/NOTE-prov-aq-20130430/"><cite>Provenance Access and Query</cite></a>. 30 April 2013, W3C Note. URL: <a href="http://www.w3.org/TR/2013/NOTE-prov-aq-20130430/">http://www.w3.org/TR/2013/NOTE-prov-aq-20130430/</a>
</dd><dt id="bib-PROV-CONSTRAINTS">[PROV-CONSTRAINTS]</dt><dd>James Cheney; Paolo Missier; Luc Moreau; eds. <a href="http://www.w3.org/TR/2013/REC-prov-constraints-20130430/"><cite>Constraints of the PROV Data Model</cite></a>. 30 April 2013, W3C Recommendation. URL: <a href="http://www.w3.org/TR/2013/REC-prov-constraints-20130430/">http://www.w3.org/TR/2013/REC-prov-constraints-20130430/</a>
</dd><dt id="bib-PROV-DC">[PROV-DC]</dt><dd>Daniel Garijo; Kai Eckert; eds. <a href="http://www.w3.org/TR/2013/NOTE-prov-dc-20130430/"><cite>Dublin Core to PROV Mapping</cite></a>. 30 April 2013, W3C Note. URL: <a href="http://www.w3.org/TR/2013/NOTE-prov-dc-20130430/">http://www.w3.org/TR/2013/NOTE-prov-dc-20130430/</a>
</dd><dt id="bib-PROV-DM">[PROV-DM]</dt><dd>Luc Moreau; Paolo Missier; eds. <a href="http://www.w3.org/TR/2013/REC-prov-dm-20130430/"><cite>PROV-DM: The PROV Data Model</cite></a>. 30 April 2013, W3C Recommendation. URL: <a href="http://www.w3.org/TR/2013/REC-prov-dm-20130430/">http://www.w3.org/TR/2013/REC-prov-dm-20130430/</a>