--- a/dc-note/releases/NOTE-prov-dc-20130430/Overview.html Mon Apr 15 11:33:55 2013 +0200
+++ b/dc-note/releases/NOTE-prov-dc-20130430/Overview.html Mon Apr 15 11:34:21 2013 +0200
@@ -340,7 +340,7 @@
<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 [<cite><a href="#bib-PROV-DICTIONARY" class="bibref">PROV-DICTIONARY</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 Dublic Core Terms (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 (this document);</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>
--- a/links/diff.html Mon Apr 15 11:33:55 2013 +0200
+++ b/links/diff.html Mon Apr 15 11:34:21 2013 +0200
@@ -17,7 +17,7 @@
color: #b9ab2d;
}
div.issue-title { color: #e05252; }
-div.note-title { color: #52e052; }
+div.note-title { color: <span class="delete">#52e052;</span><span class="insert">#2b2;</span> }
div.issue-title span, div.note-title span {
text-transform: uppercase;
}
@@ -32,7 +32,7 @@
border-left-style: solid;
}
div.issue, div.note {
- padding: 0.5em;
+ padding:<span class="insert"> 1em 1.2em</span> 0.5em;
margin: 1em 0;
position: relative;
clear: both;
@@ -855,7 +855,7 @@
<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-xml-20130430/">PROV-XML</a> <span class="delete">(To be published as Note),</span><span class="insert">(Note),</span> 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> <span class="delete">(To be published as Note), the</span><span class="insert">(Note),</span> 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-dictionary-20130430/">PROV-DICTIONARY</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> introduces a specific type of collection, consisting of key-entity pairs [<cite><a class="bibref" href="#bib-PROV-DICTIONARY">PROV-DICTIONARY</a></cite>];</li>
-<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-dc-20130430/">PROV-DC</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> provides a mapping between <span class="delete">PROV</span><span class="insert">PROV-O</span> and Dublic 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-dc-20130430/">PROV-DC</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> provides a mapping between <span class="delete">PROV</span><span class="insert">PROV-O</span> and <span class="delete">Dublic</span><span class="insert">Dublin</span> 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> <span class="delete">(To be published as Note),</span><span class="insert">(Note),</span> 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> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> introduces a mechanism to link across bundles (this document).</li>
</ul>
@@ -955,7 +955,7 @@
<p>This <span class="delete">document</span><span class="insert">specification</span> introduces a new concept <a href="#concept-mention" class="internalDFN">Mention</a> allowing an entity to be described as the specialization of another entity, itself described in another bundle. <span class="delete">The document</span><span class="insert">This specification</span> provides not only a conceptual definition of <a href="#concept-mention" class="internalDFN">Mention</a>, but also the corresponding ontological, schema, and notational definitions, for the various representations of PROV. It also includes constraints that apply to this construct specifically. It is our aim to promote interoperability by defining <a href="#concept-mention" class="internalDFN">Mention</a> conceptually and in the representations of PROV.</p>
-<div class="note"><div class="note-title"><span>Note</span></div><div class="">The concept <a href="#concept-mention" class="internalDFN">Mention</a> is experimental, and for this reason was not defined in PROV recommendation-track documents. The Provenance Working Group is seeking feedback from the community on its usefulness in practical scenarios.
+<div class="note"><div class="note-title" role="heading" aria-level="3"><span>Note</span></div><div class="">The concept <a href="#concept-mention" class="internalDFN">Mention</a> is experimental, and for this reason was not defined in PROV recommendation-track documents. The Provenance Working Group is seeking feedback from the community on its usefulness in practical scenarios.
</div></div>
--- a/links/prov-links.html Mon Apr 15 11:33:55 2013 +0200
+++ b/links/prov-links.html Mon Apr 15 11:34:21 2013 +0200
@@ -750,7 +750,7 @@
<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 [[PROV-XML]];</li>
<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-aq-20130430/">PROV-AQ</a> (Note), mechanisms for accessing and querying provenance [[PROV-AQ]]; </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 [[PROV-DICTIONARY]];</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 Dublic Core Terms [[PROV-DC]];</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 [[PROV-DC]];</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 [[PROV-SEM]];</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 (this document).</li>
</ul>
--- a/links/releases/NOTE-prov-links-20130430/Overview.html Mon Apr 15 11:33:55 2013 +0200
+++ b/links/releases/NOTE-prov-links-20130430/Overview.html Mon Apr 15 11:34:21 2013 +0200
@@ -10,7 +10,7 @@
color: #b9ab2d;
}
div.issue-title { color: #e05252; }
-div.note-title { color: #52e052; }
+div.note-title { color: #2b2; }
div.issue-title span, div.note-title span {
text-transform: uppercase;
}
@@ -25,7 +25,7 @@
border-left-style: solid;
}
div.issue, div.note {
- padding: 0.5em;
+ padding: 1em 1.2em 0.5em;
margin: 1em 0;
position: relative;
clear: both;
@@ -838,7 +838,7 @@
<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-dictionary-20130430/">PROV-DICTIONARY</a> (Note) introduces a specific type of collection, consisting of key-entity pairs [<cite><a class="bibref" href="#bib-PROV-DICTIONARY">PROV-DICTIONARY</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 Dublic 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-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 (this document).</li>
</ul>
@@ -931,7 +931,7 @@
<p>This specification introduces a new concept <a href="#concept-mention" class="internalDFN">Mention</a> allowing an entity to be described as the specialization of another entity, itself described in another bundle. This specification provides not only a conceptual definition of <a href="#concept-mention" class="internalDFN">Mention</a>, but also the corresponding ontological, schema, and notational definitions, for the various representations of PROV. It also includes constraints that apply to this construct specifically. It is our aim to promote interoperability by defining <a href="#concept-mention" class="internalDFN">Mention</a> conceptually and in the representations of PROV.</p>
-<div class="note"><div class="note-title"><span>Note</span></div><div class="">The concept <a href="#concept-mention" class="internalDFN">Mention</a> is experimental, and for this reason was not defined in PROV recommendation-track documents. The Provenance Working Group is seeking feedback from the community on its usefulness in practical scenarios.
+<div class="note"><div class="note-title" role="heading" aria-level="3"><span>Note</span></div><div class="">The concept <a href="#concept-mention" class="internalDFN">Mention</a> is experimental, and for this reason was not defined in PROV recommendation-track documents. The Provenance Working Group is seeking feedback from the community on its usefulness in practical scenarios.
</div></div>
--- a/links/releases/NOTE-prov-links-20130430/diff.html Mon Apr 15 11:33:55 2013 +0200
+++ b/links/releases/NOTE-prov-links-20130430/diff.html Mon Apr 15 11:34:21 2013 +0200
@@ -17,7 +17,7 @@
color: #b9ab2d;
}
div.issue-title { color: #e05252; }
-div.note-title { color: #52e052; }
+div.note-title { color: <span class="delete">#52e052;</span><span class="insert">#2b2;</span> }
div.issue-title span, div.note-title span {
text-transform: uppercase;
}
@@ -32,7 +32,7 @@
border-left-style: solid;
}
div.issue, div.note {
- padding: 0.5em;
+ padding:<span class="insert"> 1em 1.2em</span> 0.5em;
margin: 1em 0;
position: relative;
clear: both;
@@ -855,7 +855,7 @@
<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-xml-20130430/">PROV-XML</a> <span class="delete">(To be published as Note),</span><span class="insert">(Note),</span> 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> <span class="delete">(To be published as Note), the</span><span class="insert">(Note),</span> 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-dictionary-20130430/">PROV-DICTIONARY</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> introduces a specific type of collection, consisting of key-entity pairs [<cite><a class="bibref" href="#bib-PROV-DICTIONARY">PROV-DICTIONARY</a></cite>];</li>
-<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-dc-20130430/">PROV-DC</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> provides a mapping between <span class="delete">PROV</span><span class="insert">PROV-O</span> and Dublic 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-dc-20130430/">PROV-DC</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> provides a mapping between <span class="delete">PROV</span><span class="insert">PROV-O</span> and <span class="delete">Dublic</span><span class="insert">Dublin</span> 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> <span class="delete">(To be published as Note),</span><span class="insert">(Note),</span> 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> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> introduces a mechanism to link across bundles (this document).</li>
</ul>
@@ -955,7 +955,7 @@
<p>This <span class="delete">document</span><span class="insert">specification</span> introduces a new concept <a href="#concept-mention" class="internalDFN">Mention</a> allowing an entity to be described as the specialization of another entity, itself described in another bundle. <span class="delete">The document</span><span class="insert">This specification</span> provides not only a conceptual definition of <a href="#concept-mention" class="internalDFN">Mention</a>, but also the corresponding ontological, schema, and notational definitions, for the various representations of PROV. It also includes constraints that apply to this construct specifically. It is our aim to promote interoperability by defining <a href="#concept-mention" class="internalDFN">Mention</a> conceptually and in the representations of PROV.</p>
-<div class="note"><div class="note-title"><span>Note</span></div><div class="">The concept <a href="#concept-mention" class="internalDFN">Mention</a> is experimental, and for this reason was not defined in PROV recommendation-track documents. The Provenance Working Group is seeking feedback from the community on its usefulness in practical scenarios.
+<div class="note"><div class="note-title" role="heading" aria-level="3"><span>Note</span></div><div class="">The concept <a href="#concept-mention" class="internalDFN">Mention</a> is experimental, and for this reason was not defined in PROV recommendation-track documents. The Provenance Working Group is seeking feedback from the community on its usefulness in practical scenarios.
</div></div>
--- a/model/diff-c.html Mon Apr 15 11:33:55 2013 +0200
+++ b/model/diff-c.html Mon Apr 15 11:34:21 2013 +0200
@@ -815,7 +815,7 @@
<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-xml-20130430/">PROV-XML</a> <span class="delete">(To be published as Note),</span><span class="insert">(Note),</span> 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> <span class="delete">(To be published as Note), the</span><span class="insert">(Note),</span> 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-dictionary-20130430/">PROV-DICTIONARY</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> introduces a specific type of collection, consisting of key-entity pairs [<cite><a class="bibref" href="#bib-PROV-DICTIONARY">PROV-DICTIONARY</a></cite>];</li>
-<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-dc-20130430/">PROV-DC</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> provides a mapping between <span class="delete">PROV</span><span class="insert">PROV-O</span> and Dublic 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-dc-20130430/">PROV-DC</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> provides a mapping between <span class="delete">PROV and Dublic</span><span class="insert">PROV-O and Dublin</span> 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> <span class="delete">(To be published as Note),</span><span class="insert">(Note),</span> 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> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> introduces a mechanism to link across bundles [<cite><a class="bibref" href="#bib-PROV-LINKS">PROV-LINKS</a></cite>].</li>
</ul>
@@ -902,7 +902,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<br>
-</a><ul class="toc"><li class="tocline"><a href="#conventions" class="tocxref"><span class="secno">1.1 </span>Conventions</a></li><li class="tocline"><a href="#purpose" class="tocxref"><span class="secno">1.2 </span>Purpose of this document</a></li><li class="tocline"><a href="#structure-of-this-document" class="tocxref"><span class="secno">1.3 </span>Structure of this document</a></li><li class="tocline"><a href="#audience" class="tocxref"><span class="secno">1.4 </span> Audience </a></li></ul></li><li class="tocline"><a href="#rationale" class="tocxref"><span class="secno">2. </span>Rationale (Informative)</a><ul class="toc"><li class="tocline"><a href="#entities-activities-and-agents" class="tocxref"><span class="secno">2.1 </span>Entities, Activities and Agents</a></li><li class="tocline"><a href="#events" class="tocxref"><span class="secno">2.2 </span>Events</a></li><li class="tocline"><a href="#typing-section" class="tocxref"><span class="secno">2.3 </span>Types</a></li><li class="tocline"><a href="#overview" class="tocxref"><span class="secno">2.4 </span>Validation Process Overview</a></li><li class="tocline"><a href="#summary-of-inferences-and-constraints" class="tocxref"><span class="secno">2.5 </span>Summary of inferences and constraints</a></li></ul></li><li class="tocline"><a href="#compliance" class="tocxref"><span class="secno">3. </span>Compliance with this document</a></li><li class="tocline"><a href="#concepts" class="tocxref"><span class="secno">4. </span>Basic concepts</a></li><li class="tocline"><a href="#inferences" class="tocxref"><span class="secno">5. </span>Definitions and Inferences</a><ul class="toc"><li class="tocline"><a href="#optional-identifiers-and-attributes" class="tocxref"><span class="secno">5.1 </span>Optional Identifiers and Attributes</a></li><li class="tocline"><a href="#entities-and-activities" class="tocxref"><span class="secno">5.2 </span>Entities and Activities</a></li><li class="tocline"><a href="#derivations" class="tocxref"><span class="secno">5.3 </span>Derivations</a></li><li class="tocline"><a href="#agents" class="tocxref"><span class="secno">5.4 </span>Agents</a></li><li class="tocline"><a href="#alternate-and-specialized-entities" class="tocxref"><span class="secno">5.5 </span>Alternate and Specialized Entities</a></li></ul></li><li class="tocline"><a href="#constraints" class="tocxref"><span class="secno">6. </span>Constraints</a><ul class="toc"><li class="tocline"><a href="#uniqueness-constraints" class="tocxref"><span class="secno">6.1 </span>Uniqueness Constraints</a></li><li class="tocline"><a href="#event-ordering-constraints" class="tocxref"><span class="secno">6.2 </span>Event Ordering Constraints</a><ul class="toc"><li class="tocline"><a href="#activity-constraints" class="tocxref"><span class="secno">6.2.1 </span>Activity constraints</a></li><li class="tocline"><a href="#entity-constraints" class="tocxref"><span class="secno">6.2.2 </span> Entity constraints</a></li><li class="tocline"><a href="#agent-constraints" class="tocxref"><span class="secno">6.2.3 </span> Agent constraints</a></li></ul></li><li class="tocline"><a href="#type-constraints" class="tocxref"><span class="secno">6.3 </span>Type Constraints</a></li><li class="tocline"><a href="#impossibility-constraints" class="tocxref"><span class="secno">6.4 </span>Impossibility constraints</a></li></ul></li><li class="tocline"><a href="#normalization-validity-equivalence" class="tocxref"><span class="secno">7. </span>Normalization, Validity, and Equivalence</a><ul class="toc"><li class="tocline"><a href="#instances" class="tocxref"><span class="secno">7.1 </span>Instances</a></li><li class="tocline"><a href="#bundle-constraints" class="tocxref"><span class="secno">7.2 </span>Bundles and Documents</a></li></ul></li><li class="tocline"><a href="#glossary" class="tocxref"><span class="secno">8. </span>Glossary</a></li><li class="tocline"><a href="#termination" class="tocxref"><span class="secno">A. </span>Termination of normalization</a></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="#changes-since-proposed-recommendation" class="tocxref"><span class="secno"><span class="insert">B.1 </span></span><span class="insert">Changes since Proposed Recommendation</span></a></li><li class="tocline"><a href="#changes-from-candidate-recommendation-to-this-version" class="tocxref"><span class="secno"><span class="delete">B.1</span><span class="insert">B.2</span> </span>Changes from Candidate Recommendation to this version</a></li><li class="tocline"><a href="#changes-from-last-call-working-draft-to-candidate-recommendation" class="tocxref"><span class="secno"><span class="delete">B.2</span><span class="insert">B.3</span> </span>Changes from Last Call Working Draft to Candidate Recommendation</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="#normative-references" class="tocxref"><span class="secno">D.1 </span>Normative references</a></li><li class="tocline"><a href="#informative-references" class="tocxref"><span class="secno">D.2 </span>Informative references</a></li></ul></li></ul></section>
+</a><ul class="toc"><li class="tocline"><a href="#conventions" class="tocxref"><span class="secno">1.1 </span>Conventions</a></li><li class="tocline"><a href="#purpose" class="tocxref"><span class="secno">1.2 </span>Purpose of this document</a></li><li class="tocline"><a href="#structure-of-this-document" class="tocxref"><span class="secno">1.3 </span>Structure of this document</a></li><li class="tocline"><a href="#audience" class="tocxref"><span class="secno">1.4 </span> Audience </a></li></ul></li><li class="tocline"><a href="#rationale" class="tocxref"><span class="secno">2. </span>Rationale (Informative)</a><ul class="toc"><li class="tocline"><a href="#entities-activities-and-agents" class="tocxref"><span class="secno">2.1 </span>Entities, Activities and Agents</a></li><li class="tocline"><a href="#events" class="tocxref"><span class="secno">2.2 </span>Events</a></li><li class="tocline"><a href="#typing-section" class="tocxref"><span class="secno">2.3 </span>Types</a></li><li class="tocline"><a href="#overview" class="tocxref"><span class="secno">2.4 </span>Validation Process Overview</a></li><li class="tocline"><a href="#summary-of-inferences-and-constraints" class="tocxref"><span class="secno">2.5 </span>Summary of inferences and constraints</a></li></ul></li><li class="tocline"><a href="#compliance" class="tocxref"><span class="secno">3. </span>Compliance with this document</a></li><li class="tocline"><a href="#concepts" class="tocxref"><span class="secno">4. </span>Basic concepts</a></li><li class="tocline"><a href="#inferences" class="tocxref"><span class="secno">5. </span>Definitions and Inferences</a><ul class="toc"><li class="tocline"><a href="#optional-identifiers-and-attributes" class="tocxref"><span class="secno">5.1 </span>Optional Identifiers and Attributes</a></li><li class="tocline"><a href="#entities-and-activities" class="tocxref"><span class="secno">5.2 </span>Entities and Activities</a></li><li class="tocline"><a href="#derivations" class="tocxref"><span class="secno">5.3 </span>Derivations</a></li><li class="tocline"><a href="#agents" class="tocxref"><span class="secno">5.4 </span>Agents</a></li><li class="tocline"><a href="#alternate-and-specialized-entities" class="tocxref"><span class="secno">5.5 </span>Alternate and Specialized Entities</a></li></ul></li><li class="tocline"><a href="#constraints" class="tocxref"><span class="secno">6. </span>Constraints</a><ul class="toc"><li class="tocline"><a href="#uniqueness-constraints" class="tocxref"><span class="secno">6.1 </span>Uniqueness Constraints</a></li><li class="tocline"><a href="#event-ordering-constraints" class="tocxref"><span class="secno">6.2 </span>Event Ordering Constraints</a><ul class="toc"><li class="tocline"><a href="#activity-constraints" class="tocxref"><span class="secno">6.2.1 </span>Activity constraints</a></li><li class="tocline"><a href="#entity-constraints" class="tocxref"><span class="secno">6.2.2 </span> Entity constraints</a></li><li class="tocline"><a href="#agent-constraints" class="tocxref"><span class="secno">6.2.3 </span> Agent constraints</a></li></ul></li><li class="tocline"><a href="#type-constraints" class="tocxref"><span class="secno">6.3 </span>Type Constraints</a></li><li class="tocline"><a href="#impossibility-constraints" class="tocxref"><span class="secno">6.4 </span>Impossibility constraints</a></li></ul></li><li class="tocline"><a href="#normalization-validity-equivalence" class="tocxref"><span class="secno">7. </span>Normalization, Validity, and Equivalence</a><ul class="toc"><li class="tocline"><a href="#instances" class="tocxref"><span class="secno">7.1 </span>Instances</a></li><li class="tocline"><a href="#bundle-constraints" class="tocxref"><span class="secno">7.2 </span>Bundles and Documents</a></li></ul></li><li class="tocline"><a href="#glossary" class="tocxref"><span class="secno">8. </span>Glossary</a></li><li class="tocline"><a href="#termination" class="tocxref"><span class="secno">A. </span>Termination of normalization</a></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="#changes-since-proposed-recommendation" class="tocxref"><span class="secno">B.1 </span>Changes <span class="insert">since Proposed Recommendation</span></a></li><li class="tocline"><a href="#changes-from-candidate-recommendation-to-proposed-recommendation" class="tocxref"><span class="secno"><span class="insert">B.2 </span></span><span class="insert">Changes </span>from Candidate Recommendation to <span class="delete">this version</span><span class="insert">Proposed Recommendation</span></a></li><li class="tocline"><a href="#changes-from-last-call-working-draft-to-candidate-recommendation" class="tocxref"><span class="secno"><span class="delete">B.2</span><span class="insert">B.3</span> </span>Changes from Last Call Working Draft to Candidate Recommendation</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="#normative-references" class="tocxref"><span class="secno">D.1 </span>Normative references</a></li><li class="tocline"><a href="#informative-references" class="tocxref"><span class="secno">D.2 </span>Informative references</a></li></ul></li></ul></section>
@@ -1434,8 +1434,8 @@
implementers, while the procedural approach adopted here immediately demonstrates
implementability and provides an adequate (polynomial-time) default implementation. In
this section we relate the declarative meaning of formulas to their
-procedural meaning. [<cite><a class="bibref" href="#bib-PROV-SEM">PROV-SEM</a></cite>] will provide an alternative,
-declarative characterization of validity and equivalence which could
+procedural meaning. [<cite><a class="bibref" href="#bib-PROV-SEM">PROV-SEM</a></cite>] <span class="delete">will provide</span><span class="insert">provides</span> an alternative,
+declarative characterization of validity<span class="delete"> and equivalence</span> which could
be used as a starting point for other implementation strategies. </p>
@@ -1477,7 +1477,7 @@
</p>
- <h4 id="substitution-1">Substitution</h4><p><em>This section is non-normative.</em></p>
+ <h3 id="substitution-1">Substitution<span class="delete">This section is non-normative.</span></h3>
<p>A <em>substitution</em> is a function that maps variables to terms. Concretely, since we only
need to consider substitutions of finite sets of variables, we can
write substitutions as <span class="math">[x<sub>1</sub> = t<sub>1</sub>,...,x<sub>n</sub>=t<sub>n</sub>]</span>. A substitution
@@ -1499,7 +1499,7 @@
- <h4 id="formulas">Formulas</h4>
+ <h3 id="formulas">Formulas</h3>
<p>
For the purpose of constraint checking, we view PROV statements
(possibly involving existential variables) as
@@ -1514,7 +1514,7 @@
<li>Uniqueness constraints employ atomic equational formulas <span class="math">t =
t'</span>.</li>
<li>Ordering constraints employ atomic precedence relations that can
- be thought of as binary formulas <span class="math">precedes(t,t')</span> or <span class="math">strictly_precedes(t,t')</span>
+ be thought of as binary formulas <span class="math">precedes(t,t')</span> or <span class="math"><span class="delete">strictly_precedes(t,t')</span><span class="insert">strictlyPrecedes(t,t')</span></span>
</li>
<li>Typing constraints <span class="name">'type' ∈ typeOf(id)</span>
can be represented as a atomic formulas <span class="name">typeOf(id,'type')</span>.
@@ -1529,24 +1529,24 @@
background on logical formulas, see a logic textbook such as [<cite><a class="bibref" href="#bib-Logic">Logic</a></cite>].</p>
<ul>
<li>
- A definition of the form <span class="name">A</span> <span class="conditional">IF AND ONLY IF</span> there
- exists <span class="name">y<sub>1</sub></span>...<span class="name">y<sub>m</sub></span> such that <span class="name">B<sub>1</sub></span> and ... and <span class="name">B<sub>k</sub></span>
+ A definition of the form <span class="insert">"</span><span class="name">A</span> <span class="conditional">IF AND ONLY IF</span> there
+ exists <span class="name">y<sub>1</sub></span>...<span class="name">y<sub>m</sub></span> such that <span class="name">B<sub>1</sub></span> and ... and <span class="name">B<sub>k</sub></span><span class="insert">"</span>
can be thought of as a formula <span class="math">∀ x<sub>1</sub>,....,x<sub>n</sub>. A ⇔ ∃ y<sub>1</sub>...y<sub>m</sub> . B<sub>1</sub> ∧ ... ∧ B<sub>k</sub></span>, where <span class="math">x<sub>1</sub></span>...<span class="math">x<sub>n</sub></span> are the
free variables of the definition.
</li>
-<li>An inference of the form <span class="conditional">IF</span> <span class="name">A<sub>1</sub></span> and ... and <span class="name">A<sub>p</sub></span> <span class="conditional">THEN</span> there
- exists <span class="name">y<sub>1</sub></span>...<span class="name">y<sub>m</sub></span> such that <span class="name">B<sub>1</sub></span> and ... and <span class="name">B<sub>k</sub></span> can
+<li>An inference of the form <span class="insert">"</span><span class="conditional">IF</span> <span class="name">A<sub>1</sub></span> and ... and <span class="name">A<sub>p</sub></span> <span class="conditional">THEN</span> there
+ exists <span class="name">y<sub>1</sub></span>...<span class="name">y<sub>m</sub></span> such that <span class="name">B<sub>1</sub></span> and ... and <span class="name">B<sub>k</sub></span><span class="insert">"</span> can
be thought of as a formula <span class="math">∀ x<sub>1</sub>,....,x<sub>n</sub>. A<sub>1</sub> ∧ ... ∧ A<sub>p</sub> ⇒ ∃ y<sub>1</sub>...y<sub>m</sub> . B<sub>1</sub> ∧ ... ∧ B<sub>k</sub></span>, where <span class="math">x<sub>1</sub></span>...<span class="math">x<sub>n</sub></span> are the
free variables of the inference.
</li>
-<li>A uniqueness, ordering, or typing constraint of the form <span class="conditional">IF</span> <span class="name">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> <span class="conditional">THEN</span> <span class="name">C</span> can be viewed as a formula
+<li>A uniqueness, ordering, or typing constraint of the form <span class="insert">"</span><span class="conditional">IF</span> <span class="name">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> <span class="conditional">THEN</span> <span class="name">C</span><span class="insert">"</span> can be viewed as a formula
<span class="math">∀ x<sub>1</sub>...x<sub>n</sub>. A<sub>1</sub> ∧ ... ∧ A<sub>p</sub> ⇒ C</span>. </li>
-<li>A constraint of the form <span class="conditional">IF</span> <span class="name">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> <span class="conditional">THEN INVALID</span> can be viewed as a formula
+<li>A constraint of the form <span class="insert">"</span><span class="conditional">IF</span> <span class="name">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> <span class="conditional">THEN INVALID</span><span class="insert">"</span> can be viewed as a formula
<span class="math">∀ x<sub>1</sub>...x<sub>n</sub>. A<sub>1</sub> ∧ ... ∧ A<sub>p</sub> ⇒ False</span>. </li>
</ul>
- <h4 id="satisfying-definitions-inferences-and-constraints">Satisfying definitions, inferences, and constraints</h4>
+ <h3 id="satisfying-definitions-inferences-and-constraints">Satisfying definitions, inferences, and constraints</h3>
<p>
In logic, a formula's meaning is defined by saying when it is
<em>satisfied</em>. We can view
@@ -1565,7 +1565,7 @@
B<sub>k</sub></span> are either both true or both false.
</li>
<li>A logical implication as used in an inference is
- satisfied with the formula <span class="math">∀
+ satisfied <span class="delete">with</span><span class="insert">when</span> the formula <span class="math">∀
x<sub>1</sub>,....,x<sub>n</sub>. A<sub>1</sub> ∧ ... ∧
A<sub>p</sub> ⇒ ∃ y<sub>1</sub>...y<sub>m</sub> . B<sub>1</sub> ∧
... ∧ B<sub>k</sub></span> holds, that is, for any substitution of
@@ -1586,7 +1586,7 @@
substitution for <span class="math">x<sub>1</sub>...x<sub>n</sub></span> making <span class="math">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> true.
</li></ol>
-<h4 id="unification-and-merging">Unification and Merging</h4>
+<h3 id="unification-and-merging">Unification and Merging</h3>
<p><em>Unification</em> is an operation that takes two terms and compares them to
determine whether they can be made equal by substituting an
@@ -1609,7 +1609,7 @@
- <h4 id="applying-definitions-inferences-and-constraints">Applying definitions, inferences, and constraints</h4>
+ <h3 id="applying-definitions-inferences-and-constraints">Applying definitions, inferences, and constraints</h3>
<p>Formulas can also be interpreted as having computational
content. That is, if an instance does not satisfy a formula, we can
often <em>apply</em> the formula to the instance to produce another
@@ -1635,7 +1635,7 @@
x<sub>1</sub>,....,x<sub>n</sub>. A<sub>1</sub> ∧ ... ∧
A<sub>p</sub> ⇒ ∃ y<sub>1</sub>...y<sub>m</sub> . B<sub>1</sub> ∧
... ∧ B<sub>k</sub></span> can be applied by searching for any occurrences of <span class="math"> A<sub>1</sub> ∧ ... ∧
- A<sub>p</sub></span> in the instance and, for each such match,
+ A<sub>p</sub></span> in the instance and, for each such <span class="delete">match,</span><span class="insert">match</span>
for which the entire conclusion does not already hold (for some <span class="math">y<sub>1</sub>,...,y<sub>m</sub></span>),
adding <span class="math">B<sub>1</sub> ∧
... ∧ B<sub>k</sub></span> to the instance, generating fresh existential
@@ -1682,7 +1682,7 @@
</p>
- <h4 id="termination-1">Termination</h4>
+ <h3 id="termination-1">Termination</h3>
<p>
In general, applying sets of logical formulas of the above
definition, inference, and constraint forms is not guaranteed to
@@ -1745,7 +1745,7 @@
</div>
- <h4 id="checking-ordering-typing-and-impossibility-constraints">Checking ordering, typing, and impossibility constraints</h4>
+ <h3 id="checking-ordering-typing-and-impossibility-constraints">Checking ordering, typing, and impossibility constraints</h3>
<p>
The ordering, typing, and impossibility constraints are checked
rather than applied. This means that they do not generate new
@@ -1811,7 +1811,7 @@
- <h4 id="equivalence-and-isomorphism">Equivalence and Isomorphism</h4>
+ <h3 id="equivalence-and-isomorphism">Equivalence and Isomorphism</h3>
<p> Given two normal forms, a natural question is whether they contain
the same information, that is, whether they are equivalent (if so,
then the original instances are also equivalent.) By analogy with
@@ -1865,7 +1865,7 @@
<li>every pair of invalid instances are equivalent</li>
</ol>
-<h4 id="from-instances-to-bundles-and-documents">From Instances to Bundles and Documents</h4>
+<h3 id="from-instances-to-bundles-and-documents">From Instances to Bundles and Documents</h3>
<p>PROV documents can contain multiple instances: a <a href="#dfn-toplevel-instance" class="internalDFN">toplevel
instance</a>, and
@@ -2501,7 +2501,8 @@
<div class="remark">
- <p>Definitions <a class="rule-ref" href="#optional-identifiers"><span>Definition 1 (optional-identifiers)</span></a> and <a class="rule-ref" href="#optional-attributes"><span>Definition 2 (optional-attributes)</span></a>.
+ <p>Definitions <a class="rule-ref" href="#optional-identifiers"><span>Definition 1 (optional-identifiers)</span></a> and <a class="rule-ref" href="#optional-attributes"><span>Definition 2 (optional-attributes)</span></a><span class="delete">.
+</span>
do not apply to <span class="name">alternateOf</span> and <span class="name">specializationOf</span>, which do not have identifiers and attributes.
</p>
</div>
@@ -2643,7 +2644,7 @@
Essentially, the definitions state that parameters
<span class="name">g,u</span> are expandable only if the activity is specified, i.e., if parameter <span class="name">a</span> is provided.
-The rationale for this is that when a is provided, then there have to be two events, namely <span class="name">u</span> and <span class="name">g</span>, which account for the usage of <span class="name">e1</span> and the generation of <span class="name">e2</span>, respectively, by <span class="name">a</span>. Conversely, if <span class="name">a</span> is not provided, then one cannot tell whether one or more activities are involved in the derivation, and the explicit introduction of such events, which correspond to a single activity, would therefore not be justified. </p>
+The rationale for this is that when <span class="name">a</span> is provided, then there have to be two events, namely <span class="name">u</span> and <span class="name">g</span>, which account for the usage of <span class="name">e1</span> and the generation of <span class="name">e2</span>, respectively, by <span class="name">a</span>. Conversely, if <span class="name">a</span> is not provided, then one cannot tell whether one or more activities are involved in the derivation, and the explicit introduction of such events, which correspond to a single activity, would therefore not be justified. </p>
<p> A later constraint, <a class="rule-ref" href="#impossible-unspecified-derivation-generation-use"><span>Constraint 51 (impossible-unspecified-derivation-generation-use)</span></a>,
@@ -4145,7 +4146,7 @@
That is, <span class="name">typeOf(e)</span> returns the set of types
associated with identifier <span class="name">e</span>. The function
<span class="name">typeOf</span> is not a PROV statement, but a
-construct used only during validation PROV, similar to <a href="#dfn-precedes" class="internalDFN">precedes</a>.
+construct used only during <span class="delete">validation PROV,</span><span class="insert">validation,</span> similar to <a href="#dfn-precedes" class="internalDFN">precedes</a>.
</p>
@@ -4521,10 +4522,23 @@
<a title="equivalence">equivalence</a> of PROV documents and instances. We first define these concepts
for PROV instances and then extend them to PROV documents.</p>
-<section id="instances">
+<div class="remark"><span class="insert">
+ Implementations should expand
+ namespace prefixes and perform any appropriate reasoning about
+ co-reference of identifiers, and rewrite the instance (by
+ replacing co-referent identifiers with a single common identifier) to
+ make this explicit, before doing validation, equivalence checking,
+ or normalization.
+ All of the following definitions assume that the application has
+ already determined which URIs in the PROV instance are co-referent
+ (e.g. </span><span class="name"><span class="insert">owl:sameAs</span></span><span class="insert"> as a result of OWL
+ reasoning).
+ </span></div>
+
+ <section id="instances">
<h3><span class="secno">7.1 </span>Instances</h3>
-<div class="remark">
+<span class="delete">
Before normalization or validation, implementations should expand
namespace prefixes and perform any appropriate reasoning about
co-reference of identifiers, and rewrite the instance (by
@@ -4533,9 +4547,12 @@
or normalization.
All of the following definitions assume that the application has
already determined which URIs in the PROV instance are co-referent
- (e.g. <span class="name">owl:sameAs</span> as a result of OWL
+ (e.g. </span><span class="delete">owl:sameAs</span><span class="delete"> as a result of OWL
reasoning).
- </div>
+ </span>
+
+
+
<p> We define the <dfn id="dfn-normal-form">normal form</dfn> of a PROV instance as the set
of provenance statements resulting from applying all definitions,
@@ -4794,8 +4811,9 @@
attributes would also arise from one with no attributes.
</p>
- <p><b>Termination for instances without attributes.</b> For
+ <p><b>Termination for instances without attributes.</b><span class="delete"> For
these instances, uniqueness and key constraints can be
+ </span>
As shown in [<cite><a class="bibref" href="#bib-DBCONSTRAINTS">DBCONSTRAINTS</a></cite>], termination of normalization can be
shown by checking that the inference rules are <em>weakly
acyclic</em>. In addition, weak acyclicity can be checked
@@ -4923,13 +4941,20 @@
<ul>
<li><span class="insert"> Changed the status of this document section.
</span></li><li><span class="insert"> Changed all URLs to PROV documents.
+ </span></li><li><span class="insert"> Fixed some minor typos in section 2.4.
+ </span></li><li><span class="insert"> Fixed typo in remark after definition 2.
+ </span></li><li><span class="insert"> Fixed typo in paragraph after table 2.
+ </span></li><li><span class="insert"> Fixed typo in sec. 6.3.
+ </span></li><li><span class="insert"> Fixed wording in remark in sec. 7.1, and moved it before
+ section heading.
+ </span></li><li><span class="insert"> Fixed typo in appendix A.
</span></li></ul>
</section>
-<section class="appendix" id="changes-from-candidate-recommendation-to-this-version">
- <h3><span class="secno"><span class="delete">B.1</span><span class="insert">B.2</span> </span>Changes from Candidate Recommendation to this version</h3>
+<section class="appendix" id="changes-from-candidate-recommendation-to-proposed-recommendation">
+ <h3><span class="secno"><span class="delete">B.1</span><span class="insert">B.2</span> </span>Changes from Candidate Recommendation to <span class="delete">this version</span><span class="insert">Proposed Recommendation</span></h3>
<p> Please see the <a href="http://www.w3.org/2011/prov/wiki/ResponsesToPublicCommentsCR">
Responses to Public Comments on the Candidate Recommendation</a>
for more details about the justification of these changes.</p>
--- a/model/diff-n.html Mon Apr 15 11:33:55 2013 +0200
+++ b/model/diff-n.html Mon Apr 15 11:34:21 2013 +0200
@@ -895,7 +895,7 @@
<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-xml-20130430/">PROV-XML</a> <span class="delete">(To be published as Note),</span><span class="insert">(Note),</span> 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> <span class="delete">(To be published as Note), the</span><span class="insert">(Note),</span> 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-dictionary-20130430/">PROV-DICTIONARY</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> introduces a specific type of collection, consisting of key-entity pairs [<cite><a class="bibref" href="#bib-PROV-DICTIONARY">PROV-DICTIONARY</a></cite>];</li>
-<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-dc-20130430/">PROV-DC</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> provides a mapping between <span class="delete">PROV</span><span class="insert">PROV-O</span> and Dublic 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-dc-20130430/">PROV-DC</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> provides a mapping between <span class="delete">PROV</span><span class="insert">PROV-O</span> and <span class="delete">Dublic</span><span class="insert">Dublin</span> 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> <span class="delete">(To be published as Note),</span><span class="insert">(Note),</span> 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> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> introduces a mechanism to link across bundles [<cite><a class="bibref" href="#bib-PROV-LINKS">PROV-LINKS</a></cite>].</li>
</ul>
--- a/model/diff.html Mon Apr 15 11:33:55 2013 +0200
+++ b/model/diff.html Mon Apr 15 11:34:21 2013 +0200
@@ -919,7 +919,7 @@
<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-xml-20130430/">PROV-XML</a> <span class="delete">(To be published as Note),</span><span class="insert">(Note),</span> 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> <span class="delete">(To be published as Note), the</span><span class="insert">(Note),</span> 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-dictionary-20130430/">PROV-DICTIONARY</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> introduces a specific type of collection, consisting of key-entity pairs [<cite><a class="bibref" href="#bib-PROV-DICTIONARY">PROV-DICTIONARY</a></cite>];</li>
-<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-dc-20130430/">PROV-DC</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> provides a mapping between <span class="delete">PROV</span><span class="insert">PROV-O</span> and Dublic 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-dc-20130430/">PROV-DC</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> provides a mapping between <span class="delete">PROV</span><span class="insert">PROV-O</span> and <span class="delete">Dublic</span><span class="insert">Dublin</span> 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> <span class="delete">(To be published as Note),</span><span class="insert">(Note),</span> 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> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> introduces a mechanism to link across bundles [<cite><a class="bibref" href="#bib-PROV-LINKS">PROV-LINKS</a></cite>].</li>
</ul>
--- a/model/prov-constraints.html Mon Apr 15 11:33:55 2013 +0200
+++ b/model/prov-constraints.html Mon Apr 15 11:34:21 2013 +0200
@@ -848,7 +848,7 @@
<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 [[PROV-XML]];</li>
<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-aq-20130430/">PROV-AQ</a> (Note), mechanisms for accessing and querying provenance [[PROV-AQ]]; </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 [[PROV-DICTIONARY]];</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 Dublic Core Terms [[PROV-DC]];</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 [[PROV-DC]];</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 [[PROV-SEM]];</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 [[PROV-LINKS]].</li>
</ul>
@@ -1382,7 +1382,7 @@
</section>
<section id="overview" class="informative">
-<h4>Validation Process Overview</h4>
+<h2>Validation Process Overview</h2>
<p>
@@ -1407,13 +1407,13 @@
implementers, while the procedural approach adopted here immediately demonstrates
implementability and provides an adequate (polynomial-time) default implementation. In
this section we relate the declarative meaning of formulas to their
-procedural meaning. [[PROV-SEM]] will provide an alternative,
-declarative characterization of validity and equivalence which could
+procedural meaning. [[PROV-SEM]] provides an alternative,
+declarative characterization of validity which could
be used as a starting point for other implementation strategies. </p>
- <h4>Constants, Variables and Placeholders</h4>
+ <h3>Constants, Variables and Placeholders</h3>
<p>
PROV statements involve identifiers, literals,
placeholders, and attribute lists. Identifiers are, according to PROV-N, expressed as <a href="http://www.w3.org/TR/2013/REC-prov-n-20130430/#prod-QUALIFIED_NAME">qualified names</a> which can be mapped to URIs [[!RFC3987]].
@@ -1450,7 +1450,7 @@
</p>
- <h4>Substitution</h4>
+ <h3>Substitution</h3>
<p>A <em>substitution</em> is a function that maps variables to terms. Concretely, since we only
need to consider substitutions of finite sets of variables, we can
write substitutions as <span class="math">[x<sub>1</sub> = t<sub>1</sub>,...,x<sub>n</sub>=t<sub>n</sub>]</span>. A substitution
@@ -1482,7 +1482,7 @@
- <h4>Formulas</h4>
+ <h3>Formulas</h3>
<p>
For the purpose of constraint checking, we view PROV statements
(possibly involving existential variables) as
@@ -1497,7 +1497,7 @@
<li>Uniqueness constraints employ atomic equational formulas <span class="math">t =
t'</span>.</li>
<li>Ordering constraints employ atomic precedence relations that can
- be thought of as binary formulas <span class="math">precedes(t,t')</span> or <span class="math">strictly_precedes(t,t')</span>
+ be thought of as binary formulas <span class="math">precedes(t,t')</span> or <span class="math">strictlyPrecedes(t,t')</span>
</li>
<li>Typing constraints <span class="name">'type' ∈ typeOf(id)</span>
can be represented as a atomic formulas <span class="name">typeOf(id,'type')</span>.
@@ -1512,24 +1512,24 @@
background on logical formulas, see a logic textbook such as [[Logic]].</p>
<ul>
<li>
- A definition of the form <span class="name">A</span> <span class="conditional">IF AND ONLY IF</span> there
- exists <span class="name">y<sub>1</sub></span>...<span class="name">y<sub>m</sub></span> such that <span class="name">B<sub>1</sub></span> and ... and <span class="name">B<sub>k</sub></span>
+ A definition of the form "<span class="name">A</span> <span class="conditional">IF AND ONLY IF</span> there
+ exists <span class="name">y<sub>1</sub></span>...<span class="name">y<sub>m</sub></span> such that <span class="name">B<sub>1</sub></span> and ... and <span class="name">B<sub>k</sub></span>"
can be thought of as a formula <span class="math">∀ x<sub>1</sub>,....,x<sub>n</sub>. A ⇔ ∃ y<sub>1</sub>...y<sub>m</sub> . B<sub>1</sub> ∧ ... ∧ B<sub>k</sub></span>, where <span class="math">x<sub>1</sub></span>...<span class="math">x<sub>n</sub></span> are the
free variables of the definition.
</li>
-<li>An inference of the form <span class="conditional">IF</span> <span class="name">A<sub>1</sub></span> and ... and <span class="name">A<sub>p</sub></span> <span class="conditional">THEN</span> there
- exists <span class="name">y<sub>1</sub></span>...<span class="name">y<sub>m</sub></span> such that <span class="name">B<sub>1</sub></span> and ... and <span class="name">B<sub>k</sub></span> can
+<li>An inference of the form "<span class="conditional">IF</span> <span class="name">A<sub>1</sub></span> and ... and <span class="name">A<sub>p</sub></span> <span class="conditional">THEN</span> there
+ exists <span class="name">y<sub>1</sub></span>...<span class="name">y<sub>m</sub></span> such that <span class="name">B<sub>1</sub></span> and ... and <span class="name">B<sub>k</sub></span>" can
be thought of as a formula <span class="math">∀ x<sub>1</sub>,....,x<sub>n</sub>. A<sub>1</sub> ∧ ... ∧ A<sub>p</sub> ⇒ ∃ y<sub>1</sub>...y<sub>m</sub> . B<sub>1</sub> ∧ ... ∧ B<sub>k</sub></span>, where <span class="math">x<sub>1</sub></span>...<span class="math">x<sub>n</sub></span> are the
free variables of the inference.
</li>
-<li>A uniqueness, ordering, or typing constraint of the form <span class="conditional">IF</span> <span class="name">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> <span class="conditional">THEN</span> <span class="name">C</span> can be viewed as a formula
+<li>A uniqueness, ordering, or typing constraint of the form "<span class="conditional">IF</span> <span class="name">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> <span class="conditional">THEN</span> <span class="name">C</span>" can be viewed as a formula
<span class="math">∀ x<sub>1</sub>...x<sub>n</sub>. A<sub>1</sub> ∧ ... ∧ A<sub>p</sub> ⇒ C</span>. </li>
-<li>A constraint of the form <span class="conditional">IF</span> <span class="name">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> <span class="conditional">THEN INVALID</span> can be viewed as a formula
+<li>A constraint of the form "<span class="conditional">IF</span> <span class="name">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> <span class="conditional">THEN INVALID</span>" can be viewed as a formula
<span class="math">∀ x<sub>1</sub>...x<sub>n</sub>. A<sub>1</sub> ∧ ... ∧ A<sub>p</sub> ⇒ False</span>. </li>
</ul>
- <h4>Satisfying definitions, inferences, and constraints</h4>
+ <h3>Satisfying definitions, inferences, and constraints</h3>
<p>
In logic, a formula's meaning is defined by saying when it is
<em>satisfied</em>. We can view
@@ -1548,7 +1548,7 @@
B<sub>k</sub></span> are either both true or both false.
</li>
<li>A logical implication as used in an inference is
- satisfied with the formula <span class="math">∀
+ satisfied when the formula <span class="math">∀
x<sub>1</sub>,....,x<sub>n</sub>. A<sub>1</sub> ∧ ... ∧
A<sub>p</sub> ⇒ ∃ y<sub>1</sub>...y<sub>m</sub> . B<sub>1</sub> ∧
... ∧ B<sub>k</sub></span> holds, that is, for any substitution of
@@ -1569,7 +1569,7 @@
substitution for <span class="math">x<sub>1</sub>...x<sub>n</sub></span> making <span class="math">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> true.
</ol>
-<h4>Unification and Merging</h4>
+<h3>Unification and Merging</h3>
<p><em>Unification</em> is an operation that takes two terms and compares them to
determine whether they can be made equal by substituting an
@@ -1592,7 +1592,7 @@
- <h4>Applying definitions, inferences, and constraints</h4>
+ <h3>Applying definitions, inferences, and constraints</h3>
<p>Formulas can also be interpreted as having computational
content. That is, if an instance does not satisfy a formula, we can
often <em>apply</em> the formula to the instance to produce another
@@ -1621,7 +1621,7 @@
A<sub>p</sub> ⇒ ∃ y<sub>1</sub>...y<sub>m</sub> . B<sub>1</sub> ∧
... ∧ B<sub>k</sub></span> can be applied by searching for any occurrences of <span
class="math"> A<sub>1</sub> ∧ ... ∧
- A<sub>p</sub></span> in the instance and, for each such match,
+ A<sub>p</sub></span> in the instance and, for each such match
for which the entire conclusion does not already hold (for some <span class="math">y<sub>1</sub>,...,y<sub>m</sub></span>),
adding <span class="math">B<sub>1</sub> ∧
... ∧ B<sub>k</sub></span> to the instance, generating fresh existential
@@ -1668,7 +1668,7 @@
</p>
- <h4>Termination</h4>
+ <h3>Termination</h3>
<p>
In general, applying sets of logical formulas of the above
definition, inference, and constraint forms is not guaranteed to
@@ -1735,7 +1735,7 @@
</div>
- <h4>Checking ordering, typing, and impossibility constraints</h4>
+ <h3>Checking ordering, typing, and impossibility constraints</h3>
<p>
The ordering, typing, and impossibility constraints are checked
rather than applied. This means that they do not generate new
@@ -1801,7 +1801,7 @@
- <h4>Equivalence and Isomorphism</h4>
+ <h3>Equivalence and Isomorphism</h3>
<p> Given two normal forms, a natural question is whether they contain
the same information, that is, whether they are equivalent (if so,
then the original instances are also equivalent.) By analogy with
@@ -1858,7 +1858,7 @@
<li>every pair of invalid instances are equivalent</li>
</ol>
-<h4>From Instances to Bundles and Documents</h4>
+<h3>From Instances to Bundles and Documents</h3>
<p>PROV documents can contain multiple instances: a <a>toplevel
instance</a>, and
@@ -1888,7 +1888,7 @@
</section>
<section class="informative">
-<h4>Summary of inferences and constraints</h4>
+<h2>Summary of inferences and constraints</h2>
<p><a href="">Table 2</a> summarizes the inferences, and
constraints specified in this document, broken down by component and
@@ -2542,7 +2542,7 @@
<div class="remark">
- <p>Definitions <a class="rule-ref" href="#optional-identifiers"><span>TBD</span></a> and <a class="rule-ref" href="#optional-attributes"><span>TBD</span></a>.
+ <p>Definitions <a class="rule-ref" href="#optional-identifiers"><span>TBD</span></a> and <a class="rule-ref" href="#optional-attributes"><span>TBD</span></a>
do not apply to <span class="name">alternateOf</span> and <span class="name">specializationOf</span>, which do not have identifiers and attributes.
</p>
</div>
@@ -2722,7 +2722,7 @@
Essentially, the definitions state that parameters
<span class="name">g,u</span> are expandable only if the activity is specified, i.e., if parameter <span class="name">a</span> is provided.
-The rationale for this is that when a is provided, then there have to be two events, namely <span class="name">u</span> and <span class="name">g</span>, which account for the usage of <span class="name">e1</span> and the generation of <span class="name">e2</span>, respectively, by <span class="name">a</span>. Conversely, if <span class="name">a</span> is not provided, then one cannot tell whether one or more activities are involved in the derivation, and the explicit introduction of such events, which correspond to a single activity, would therefore not be justified. </p>
+The rationale for this is that when <span class="name">a</span> is provided, then there have to be two events, namely <span class="name">u</span> and <span class="name">g</span>, which account for the usage of <span class="name">e1</span> and the generation of <span class="name">e2</span>, respectively, by <span class="name">a</span>. Conversely, if <span class="name">a</span> is not provided, then one cannot tell whether one or more activities are involved in the derivation, and the explicit introduction of such events, which correspond to a single activity, would therefore not be justified. </p>
<p> A later constraint, <a class="rule-ref"
@@ -4562,7 +4562,7 @@
That is, <span class="name">typeOf(e)</span> returns the set of types
associated with identifier <span class="name">e</span>. The function
<span class="name">typeOf</span> is not a PROV statement, but a
-construct used only during validation PROV, similar to <a>precedes</a>.
+construct used only during validation, similar to <a>precedes</a>.
</p>
@@ -4982,11 +4982,8 @@
<a title="equivalence">equivalence</a> of PROV documents and instances. We first define these concepts
for PROV instances and then extend them to PROV documents.</p>
-<section id="instances">
- <h2>Instances</h2>
-
<div class="remark">
- Before normalization or validation, implementations should expand
+ Implementations should expand
namespace prefixes and perform any appropriate reasoning about
co-reference of identifiers, and rewrite the instance (by
replacing co-referent identifiers with a single common identifier) to
@@ -4998,6 +4995,10 @@
reasoning).
</div>
+ <section id="instances">
+ <h2>Instances</h2>
+
+
<p> We define the <dfn>normal form</dfn> of a PROV instance as the set
of provenance statements resulting from applying all definitions,
inferences, and uniqueness constraints, obtained as follows:</p>
@@ -5259,8 +5260,7 @@
attributes would also arise from one with no attributes.
</p>
- <p><b>Termination for instances without attributes.</b> For
- these instances, uniqueness and key constraints can be
+ <p><b>Termination for instances without attributes.</b>
As shown in [[DBCONSTRAINTS]], termination of normalization can be
shown by checking that the inference rules are <em>weakly
acyclic</em>. In addition, weak acyclicity can be checked
@@ -5389,13 +5389,20 @@
<ul>
<li> Changed the status of this document section.
<li> Changed all URLs to PROV documents.
+ <li> Fixed some minor typos in section 2.4.
+ <li> Fixed typo in remark after definition 2.
+ <li> Fixed typo in paragraph after table 2.
+ <li> Fixed typo in sec. 6.3.
+ <li> Fixed wording in remark in sec. 7.1, and moved it before
+ section heading.
+ <li> Fixed typo in appendix A.
</ul>
</section>
<section class="appendix">
- <h2>Changes from Candidate Recommendation to this version</h2>
+ <h2>Changes from Candidate Recommendation to Proposed Recommendation</h2>
<p> Please see the <a
href="http://www.w3.org/2011/prov/wiki/ResponsesToPublicCommentsCR">
Responses to Public Comments on the Candidate Recommendation</a>
--- a/model/prov-dm.html Mon Apr 15 11:33:55 2013 +0200
+++ b/model/prov-dm.html Mon Apr 15 11:34:21 2013 +0200
@@ -869,7 +869,7 @@
<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 [[PROV-XML]];</li>
<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-aq-20130430/">PROV-AQ</a> (Note), mechanisms for accessing and querying provenance [[PROV-AQ]]; </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 [[PROV-DICTIONARY]];</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 Dublic Core Terms [[PROV-DC]];</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 [[PROV-DC]];</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 [[PROV-SEM]];</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 [[PROV-LINKS]].</li>
</ul>
--- a/model/prov-n.html Mon Apr 15 11:33:55 2013 +0200
+++ b/model/prov-n.html Mon Apr 15 11:34:21 2013 +0200
@@ -833,7 +833,7 @@
<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 [[PROV-XML]];</li>
<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-aq-20130430/">PROV-AQ</a> (Note), mechanisms for accessing and querying provenance [[PROV-AQ]]; </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 [[PROV-DICTIONARY]];</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 Dublic Core Terms [[PROV-DC]];</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 [[PROV-DC]];</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 [[PROV-SEM]];</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 [[PROV-LINKS]].</li>
</ul>
--- a/model/releases/REC-prov-constraints-20130430/Overview.html Mon Apr 15 11:33:55 2013 +0200
+++ b/model/releases/REC-prov-constraints-20130430/Overview.html Mon Apr 15 11:34:21 2013 +0200
@@ -802,7 +802,7 @@
<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-dictionary-20130430/">PROV-DICTIONARY</a> (Note) introduces a specific type of collection, consisting of key-entity pairs [<cite><a class="bibref" href="#bib-PROV-DICTIONARY">PROV-DICTIONARY</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 Dublic 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-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>
</ul>
@@ -852,7 +852,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<br>
-</a><ul class="toc"><li class="tocline"><a href="#conventions" class="tocxref"><span class="secno">1.1 </span>Conventions</a></li><li class="tocline"><a href="#purpose" class="tocxref"><span class="secno">1.2 </span>Purpose of this document</a></li><li class="tocline"><a href="#structure-of-this-document" class="tocxref"><span class="secno">1.3 </span>Structure of this document</a></li><li class="tocline"><a href="#audience" class="tocxref"><span class="secno">1.4 </span> Audience </a></li></ul></li><li class="tocline"><a href="#rationale" class="tocxref"><span class="secno">2. </span>Rationale (Informative)</a><ul class="toc"><li class="tocline"><a href="#entities-activities-and-agents" class="tocxref"><span class="secno">2.1 </span>Entities, Activities and Agents</a></li><li class="tocline"><a href="#events" class="tocxref"><span class="secno">2.2 </span>Events</a></li><li class="tocline"><a href="#typing-section" class="tocxref"><span class="secno">2.3 </span>Types</a></li><li class="tocline"><a href="#overview" class="tocxref"><span class="secno">2.4 </span>Validation Process Overview</a></li><li class="tocline"><a href="#summary-of-inferences-and-constraints" class="tocxref"><span class="secno">2.5 </span>Summary of inferences and constraints</a></li></ul></li><li class="tocline"><a href="#compliance" class="tocxref"><span class="secno">3. </span>Compliance with this document</a></li><li class="tocline"><a href="#concepts" class="tocxref"><span class="secno">4. </span>Basic concepts</a></li><li class="tocline"><a href="#inferences" class="tocxref"><span class="secno">5. </span>Definitions and Inferences</a><ul class="toc"><li class="tocline"><a href="#optional-identifiers-and-attributes" class="tocxref"><span class="secno">5.1 </span>Optional Identifiers and Attributes</a></li><li class="tocline"><a href="#entities-and-activities" class="tocxref"><span class="secno">5.2 </span>Entities and Activities</a></li><li class="tocline"><a href="#derivations" class="tocxref"><span class="secno">5.3 </span>Derivations</a></li><li class="tocline"><a href="#agents" class="tocxref"><span class="secno">5.4 </span>Agents</a></li><li class="tocline"><a href="#alternate-and-specialized-entities" class="tocxref"><span class="secno">5.5 </span>Alternate and Specialized Entities</a></li></ul></li><li class="tocline"><a href="#constraints" class="tocxref"><span class="secno">6. </span>Constraints</a><ul class="toc"><li class="tocline"><a href="#uniqueness-constraints" class="tocxref"><span class="secno">6.1 </span>Uniqueness Constraints</a></li><li class="tocline"><a href="#event-ordering-constraints" class="tocxref"><span class="secno">6.2 </span>Event Ordering Constraints</a><ul class="toc"><li class="tocline"><a href="#activity-constraints" class="tocxref"><span class="secno">6.2.1 </span>Activity constraints</a></li><li class="tocline"><a href="#entity-constraints" class="tocxref"><span class="secno">6.2.2 </span> Entity constraints</a></li><li class="tocline"><a href="#agent-constraints" class="tocxref"><span class="secno">6.2.3 </span> Agent constraints</a></li></ul></li><li class="tocline"><a href="#type-constraints" class="tocxref"><span class="secno">6.3 </span>Type Constraints</a></li><li class="tocline"><a href="#impossibility-constraints" class="tocxref"><span class="secno">6.4 </span>Impossibility constraints</a></li></ul></li><li class="tocline"><a href="#normalization-validity-equivalence" class="tocxref"><span class="secno">7. </span>Normalization, Validity, and Equivalence</a><ul class="toc"><li class="tocline"><a href="#instances" class="tocxref"><span class="secno">7.1 </span>Instances</a></li><li class="tocline"><a href="#bundle-constraints" class="tocxref"><span class="secno">7.2 </span>Bundles and Documents</a></li></ul></li><li class="tocline"><a href="#glossary" class="tocxref"><span class="secno">8. </span>Glossary</a></li><li class="tocline"><a href="#termination" class="tocxref"><span class="secno">A. </span>Termination of normalization</a></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="#changes-since-proposed-recommendation" class="tocxref"><span class="secno">B.1 </span>Changes since Proposed Recommendation</a></li><li class="tocline"><a href="#changes-from-candidate-recommendation-to-this-version" class="tocxref"><span class="secno">B.2 </span>Changes from Candidate Recommendation to this version</a></li><li class="tocline"><a href="#changes-from-last-call-working-draft-to-candidate-recommendation" class="tocxref"><span class="secno">B.3 </span>Changes from Last Call Working Draft to Candidate Recommendation</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="#normative-references" class="tocxref"><span class="secno">D.1 </span>Normative references</a></li><li class="tocline"><a href="#informative-references" class="tocxref"><span class="secno">D.2 </span>Informative references</a></li></ul></li></ul></section>
+</a><ul class="toc"><li class="tocline"><a href="#conventions" class="tocxref"><span class="secno">1.1 </span>Conventions</a></li><li class="tocline"><a href="#purpose" class="tocxref"><span class="secno">1.2 </span>Purpose of this document</a></li><li class="tocline"><a href="#structure-of-this-document" class="tocxref"><span class="secno">1.3 </span>Structure of this document</a></li><li class="tocline"><a href="#audience" class="tocxref"><span class="secno">1.4 </span> Audience </a></li></ul></li><li class="tocline"><a href="#rationale" class="tocxref"><span class="secno">2. </span>Rationale (Informative)</a><ul class="toc"><li class="tocline"><a href="#entities-activities-and-agents" class="tocxref"><span class="secno">2.1 </span>Entities, Activities and Agents</a></li><li class="tocline"><a href="#events" class="tocxref"><span class="secno">2.2 </span>Events</a></li><li class="tocline"><a href="#typing-section" class="tocxref"><span class="secno">2.3 </span>Types</a></li><li class="tocline"><a href="#overview" class="tocxref"><span class="secno">2.4 </span>Validation Process Overview</a></li><li class="tocline"><a href="#summary-of-inferences-and-constraints" class="tocxref"><span class="secno">2.5 </span>Summary of inferences and constraints</a></li></ul></li><li class="tocline"><a href="#compliance" class="tocxref"><span class="secno">3. </span>Compliance with this document</a></li><li class="tocline"><a href="#concepts" class="tocxref"><span class="secno">4. </span>Basic concepts</a></li><li class="tocline"><a href="#inferences" class="tocxref"><span class="secno">5. </span>Definitions and Inferences</a><ul class="toc"><li class="tocline"><a href="#optional-identifiers-and-attributes" class="tocxref"><span class="secno">5.1 </span>Optional Identifiers and Attributes</a></li><li class="tocline"><a href="#entities-and-activities" class="tocxref"><span class="secno">5.2 </span>Entities and Activities</a></li><li class="tocline"><a href="#derivations" class="tocxref"><span class="secno">5.3 </span>Derivations</a></li><li class="tocline"><a href="#agents" class="tocxref"><span class="secno">5.4 </span>Agents</a></li><li class="tocline"><a href="#alternate-and-specialized-entities" class="tocxref"><span class="secno">5.5 </span>Alternate and Specialized Entities</a></li></ul></li><li class="tocline"><a href="#constraints" class="tocxref"><span class="secno">6. </span>Constraints</a><ul class="toc"><li class="tocline"><a href="#uniqueness-constraints" class="tocxref"><span class="secno">6.1 </span>Uniqueness Constraints</a></li><li class="tocline"><a href="#event-ordering-constraints" class="tocxref"><span class="secno">6.2 </span>Event Ordering Constraints</a><ul class="toc"><li class="tocline"><a href="#activity-constraints" class="tocxref"><span class="secno">6.2.1 </span>Activity constraints</a></li><li class="tocline"><a href="#entity-constraints" class="tocxref"><span class="secno">6.2.2 </span> Entity constraints</a></li><li class="tocline"><a href="#agent-constraints" class="tocxref"><span class="secno">6.2.3 </span> Agent constraints</a></li></ul></li><li class="tocline"><a href="#type-constraints" class="tocxref"><span class="secno">6.3 </span>Type Constraints</a></li><li class="tocline"><a href="#impossibility-constraints" class="tocxref"><span class="secno">6.4 </span>Impossibility constraints</a></li></ul></li><li class="tocline"><a href="#normalization-validity-equivalence" class="tocxref"><span class="secno">7. </span>Normalization, Validity, and Equivalence</a><ul class="toc"><li class="tocline"><a href="#instances" class="tocxref"><span class="secno">7.1 </span>Instances</a></li><li class="tocline"><a href="#bundle-constraints" class="tocxref"><span class="secno">7.2 </span>Bundles and Documents</a></li></ul></li><li class="tocline"><a href="#glossary" class="tocxref"><span class="secno">8. </span>Glossary</a></li><li class="tocline"><a href="#termination" class="tocxref"><span class="secno">A. </span>Termination of normalization</a></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="#changes-since-proposed-recommendation" class="tocxref"><span class="secno">B.1 </span>Changes since Proposed Recommendation</a></li><li class="tocline"><a href="#changes-from-candidate-recommendation-to-proposed-recommendation" class="tocxref"><span class="secno">B.2 </span>Changes from Candidate Recommendation to Proposed Recommendation</a></li><li class="tocline"><a href="#changes-from-last-call-working-draft-to-candidate-recommendation" class="tocxref"><span class="secno">B.3 </span>Changes from Last Call Working Draft to Candidate Recommendation</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="#normative-references" class="tocxref"><span class="secno">D.1 </span>Normative references</a></li><li class="tocline"><a href="#informative-references" class="tocxref"><span class="secno">D.2 </span>Informative references</a></li></ul></li></ul></section>
@@ -1398,8 +1398,8 @@
implementers, while the procedural approach adopted here immediately demonstrates
implementability and provides an adequate (polynomial-time) default implementation. In
this section we relate the declarative meaning of formulas to their
-procedural meaning. [<cite><a class="bibref" href="#bib-PROV-SEM">PROV-SEM</a></cite>] will provide an alternative,
-declarative characterization of validity and equivalence which could
+procedural meaning. [<cite><a class="bibref" href="#bib-PROV-SEM">PROV-SEM</a></cite>] provides an alternative,
+declarative characterization of validity which could
be used as a starting point for other implementation strategies. </p>
@@ -1441,7 +1441,7 @@
</p>
- <h4 id="substitution-1">Substitution</h4><p><em>This section is non-normative.</em></p>
+ <h3 id="substitution-1">Substitution</h3>
<p>A <em>substitution</em> is a function that maps variables to terms. Concretely, since we only
need to consider substitutions of finite sets of variables, we can
write substitutions as <span class="math">[x<sub>1</sub> = t<sub>1</sub>,...,x<sub>n</sub>=t<sub>n</sub>]</span>. A substitution
@@ -1473,7 +1473,7 @@
- <h4 id="formulas">Formulas</h4>
+ <h3 id="formulas">Formulas</h3>
<p>
For the purpose of constraint checking, we view PROV statements
(possibly involving existential variables) as
@@ -1488,7 +1488,7 @@
<li>Uniqueness constraints employ atomic equational formulas <span class="math">t =
t'</span>.</li>
<li>Ordering constraints employ atomic precedence relations that can
- be thought of as binary formulas <span class="math">precedes(t,t')</span> or <span class="math">strictly_precedes(t,t')</span>
+ be thought of as binary formulas <span class="math">precedes(t,t')</span> or <span class="math">strictlyPrecedes(t,t')</span>
</li>
<li>Typing constraints <span class="name">'type' ∈ typeOf(id)</span>
can be represented as a atomic formulas <span class="name">typeOf(id,'type')</span>.
@@ -1503,24 +1503,24 @@
background on logical formulas, see a logic textbook such as [<cite><a class="bibref" href="#bib-Logic">Logic</a></cite>].</p>
<ul>
<li>
- A definition of the form <span class="name">A</span> <span class="conditional">IF AND ONLY IF</span> there
- exists <span class="name">y<sub>1</sub></span>...<span class="name">y<sub>m</sub></span> such that <span class="name">B<sub>1</sub></span> and ... and <span class="name">B<sub>k</sub></span>
+ A definition of the form "<span class="name">A</span> <span class="conditional">IF AND ONLY IF</span> there
+ exists <span class="name">y<sub>1</sub></span>...<span class="name">y<sub>m</sub></span> such that <span class="name">B<sub>1</sub></span> and ... and <span class="name">B<sub>k</sub></span>"
can be thought of as a formula <span class="math">∀ x<sub>1</sub>,....,x<sub>n</sub>. A ⇔ ∃ y<sub>1</sub>...y<sub>m</sub> . B<sub>1</sub> ∧ ... ∧ B<sub>k</sub></span>, where <span class="math">x<sub>1</sub></span>...<span class="math">x<sub>n</sub></span> are the
free variables of the definition.
</li>
-<li>An inference of the form <span class="conditional">IF</span> <span class="name">A<sub>1</sub></span> and ... and <span class="name">A<sub>p</sub></span> <span class="conditional">THEN</span> there
- exists <span class="name">y<sub>1</sub></span>...<span class="name">y<sub>m</sub></span> such that <span class="name">B<sub>1</sub></span> and ... and <span class="name">B<sub>k</sub></span> can
+<li>An inference of the form "<span class="conditional">IF</span> <span class="name">A<sub>1</sub></span> and ... and <span class="name">A<sub>p</sub></span> <span class="conditional">THEN</span> there
+ exists <span class="name">y<sub>1</sub></span>...<span class="name">y<sub>m</sub></span> such that <span class="name">B<sub>1</sub></span> and ... and <span class="name">B<sub>k</sub></span>" can
be thought of as a formula <span class="math">∀ x<sub>1</sub>,....,x<sub>n</sub>. A<sub>1</sub> ∧ ... ∧ A<sub>p</sub> ⇒ ∃ y<sub>1</sub>...y<sub>m</sub> . B<sub>1</sub> ∧ ... ∧ B<sub>k</sub></span>, where <span class="math">x<sub>1</sub></span>...<span class="math">x<sub>n</sub></span> are the
free variables of the inference.
</li>
-<li>A uniqueness, ordering, or typing constraint of the form <span class="conditional">IF</span> <span class="name">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> <span class="conditional">THEN</span> <span class="name">C</span> can be viewed as a formula
+<li>A uniqueness, ordering, or typing constraint of the form "<span class="conditional">IF</span> <span class="name">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> <span class="conditional">THEN</span> <span class="name">C</span>" can be viewed as a formula
<span class="math">∀ x<sub>1</sub>...x<sub>n</sub>. A<sub>1</sub> ∧ ... ∧ A<sub>p</sub> ⇒ C</span>. </li>
-<li>A constraint of the form <span class="conditional">IF</span> <span class="name">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> <span class="conditional">THEN INVALID</span> can be viewed as a formula
+<li>A constraint of the form "<span class="conditional">IF</span> <span class="name">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> <span class="conditional">THEN INVALID</span>" can be viewed as a formula
<span class="math">∀ x<sub>1</sub>...x<sub>n</sub>. A<sub>1</sub> ∧ ... ∧ A<sub>p</sub> ⇒ False</span>. </li>
</ul>
- <h4 id="satisfying-definitions-inferences-and-constraints">Satisfying definitions, inferences, and constraints</h4>
+ <h3 id="satisfying-definitions-inferences-and-constraints">Satisfying definitions, inferences, and constraints</h3>
<p>
In logic, a formula's meaning is defined by saying when it is
<em>satisfied</em>. We can view
@@ -1539,7 +1539,7 @@
B<sub>k</sub></span> are either both true or both false.
</li>
<li>A logical implication as used in an inference is
- satisfied with the formula <span class="math">∀
+ satisfied when the formula <span class="math">∀
x<sub>1</sub>,....,x<sub>n</sub>. A<sub>1</sub> ∧ ... ∧
A<sub>p</sub> ⇒ ∃ y<sub>1</sub>...y<sub>m</sub> . B<sub>1</sub> ∧
... ∧ B<sub>k</sub></span> holds, that is, for any substitution of
@@ -1560,7 +1560,7 @@
substitution for <span class="math">x<sub>1</sub>...x<sub>n</sub></span> making <span class="math">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> true.
</li></ol>
-<h4 id="unification-and-merging">Unification and Merging</h4>
+<h3 id="unification-and-merging">Unification and Merging</h3>
<p><em>Unification</em> is an operation that takes two terms and compares them to
determine whether they can be made equal by substituting an
@@ -1583,7 +1583,7 @@
- <h4 id="applying-definitions-inferences-and-constraints">Applying definitions, inferences, and constraints</h4>
+ <h3 id="applying-definitions-inferences-and-constraints">Applying definitions, inferences, and constraints</h3>
<p>Formulas can also be interpreted as having computational
content. That is, if an instance does not satisfy a formula, we can
often <em>apply</em> the formula to the instance to produce another
@@ -1609,7 +1609,7 @@
x<sub>1</sub>,....,x<sub>n</sub>. A<sub>1</sub> ∧ ... ∧
A<sub>p</sub> ⇒ ∃ y<sub>1</sub>...y<sub>m</sub> . B<sub>1</sub> ∧
... ∧ B<sub>k</sub></span> can be applied by searching for any occurrences of <span class="math"> A<sub>1</sub> ∧ ... ∧
- A<sub>p</sub></span> in the instance and, for each such match,
+ A<sub>p</sub></span> in the instance and, for each such match
for which the entire conclusion does not already hold (for some <span class="math">y<sub>1</sub>,...,y<sub>m</sub></span>),
adding <span class="math">B<sub>1</sub> ∧
... ∧ B<sub>k</sub></span> to the instance, generating fresh existential
@@ -1656,7 +1656,7 @@
</p>
- <h4 id="termination-1">Termination</h4>
+ <h3 id="termination-1">Termination</h3>
<p>
In general, applying sets of logical formulas of the above
definition, inference, and constraint forms is not guaranteed to
@@ -1719,7 +1719,7 @@
</div>
- <h4 id="checking-ordering-typing-and-impossibility-constraints">Checking ordering, typing, and impossibility constraints</h4>
+ <h3 id="checking-ordering-typing-and-impossibility-constraints">Checking ordering, typing, and impossibility constraints</h3>
<p>
The ordering, typing, and impossibility constraints are checked
rather than applied. This means that they do not generate new
@@ -1785,7 +1785,7 @@
- <h4 id="equivalence-and-isomorphism">Equivalence and Isomorphism</h4>
+ <h3 id="equivalence-and-isomorphism">Equivalence and Isomorphism</h3>
<p> Given two normal forms, a natural question is whether they contain
the same information, that is, whether they are equivalent (if so,
then the original instances are also equivalent.) By analogy with
@@ -1842,7 +1842,7 @@
<li>every pair of invalid instances are equivalent</li>
</ol>
-<h4 id="from-instances-to-bundles-and-documents">From Instances to Bundles and Documents</h4>
+<h3 id="from-instances-to-bundles-and-documents">From Instances to Bundles and Documents</h3>
<p>PROV documents can contain multiple instances: a <a href="#dfn-toplevel-instance" class="internalDFN">toplevel
instance</a>, and
@@ -2498,7 +2498,7 @@
<div class="remark">
- <p>Definitions <a class="rule-ref" href="#optional-identifiers"><span>Definition 1 (optional-identifiers)</span></a> and <a class="rule-ref" href="#optional-attributes"><span>Definition 2 (optional-attributes)</span></a>.
+ <p>Definitions <a class="rule-ref" href="#optional-identifiers"><span>Definition 1 (optional-identifiers)</span></a> and <a class="rule-ref" href="#optional-attributes"><span>Definition 2 (optional-attributes)</span></a>
do not apply to <span class="name">alternateOf</span> and <span class="name">specializationOf</span>, which do not have identifiers and attributes.
</p>
</div>
@@ -2670,7 +2670,7 @@
Essentially, the definitions state that parameters
<span class="name">g,u</span> are expandable only if the activity is specified, i.e., if parameter <span class="name">a</span> is provided.
-The rationale for this is that when a is provided, then there have to be two events, namely <span class="name">u</span> and <span class="name">g</span>, which account for the usage of <span class="name">e1</span> and the generation of <span class="name">e2</span>, respectively, by <span class="name">a</span>. Conversely, if <span class="name">a</span> is not provided, then one cannot tell whether one or more activities are involved in the derivation, and the explicit introduction of such events, which correspond to a single activity, would therefore not be justified. </p>
+The rationale for this is that when <span class="name">a</span> is provided, then there have to be two events, namely <span class="name">u</span> and <span class="name">g</span>, which account for the usage of <span class="name">e1</span> and the generation of <span class="name">e2</span>, respectively, by <span class="name">a</span>. Conversely, if <span class="name">a</span> is not provided, then one cannot tell whether one or more activities are involved in the derivation, and the explicit introduction of such events, which correspond to a single activity, would therefore not be justified. </p>
<p> A later constraint, <a class="rule-ref" href="#impossible-unspecified-derivation-generation-use"><span>Constraint 51 (impossible-unspecified-derivation-generation-use)</span></a>,
@@ -4405,7 +4405,7 @@
That is, <span class="name">typeOf(e)</span> returns the set of types
associated with identifier <span class="name">e</span>. The function
<span class="name">typeOf</span> is not a PROV statement, but a
-construct used only during validation PROV, similar to <a href="#dfn-precedes" class="internalDFN">precedes</a>.
+construct used only during validation, similar to <a href="#dfn-precedes" class="internalDFN">precedes</a>.
</p>
@@ -4809,11 +4809,8 @@
<a title="equivalence">equivalence</a> of PROV documents and instances. We first define these concepts
for PROV instances and then extend them to PROV documents.</p>
-<section id="instances">
- <h3><span class="secno">7.1 </span>Instances</h3>
-
<div class="remark">
- Before normalization or validation, implementations should expand
+ Implementations should expand
namespace prefixes and perform any appropriate reasoning about
co-reference of identifiers, and rewrite the instance (by
replacing co-referent identifiers with a single common identifier) to
@@ -4825,6 +4822,10 @@
reasoning).
</div>
+ <section id="instances">
+ <h3><span class="secno">7.1 </span>Instances</h3>
+
+
<p> We define the <dfn id="dfn-normal-form">normal form</dfn> of a PROV instance as the set
of provenance statements resulting from applying all definitions,
inferences, and uniqueness constraints, obtained as follows:</p>
@@ -5082,8 +5083,7 @@
attributes would also arise from one with no attributes.
</p>
- <p><b>Termination for instances without attributes.</b> For
- these instances, uniqueness and key constraints can be
+ <p><b>Termination for instances without attributes.</b>
As shown in [<cite><a class="bibref" href="#bib-DBCONSTRAINTS">DBCONSTRAINTS</a></cite>], termination of normalization can be
shown by checking that the inference rules are <em>weakly
acyclic</em>. In addition, weak acyclicity can be checked
@@ -5211,13 +5211,20 @@
<ul>
<li> Changed the status of this document section.
</li><li> Changed all URLs to PROV documents.
+ </li><li> Fixed some minor typos in section 2.4.
+ </li><li> Fixed typo in remark after definition 2.
+ </li><li> Fixed typo in paragraph after table 2.
+ </li><li> Fixed typo in sec. 6.3.
+ </li><li> Fixed wording in remark in sec. 7.1, and moved it before
+ section heading.
+ </li><li> Fixed typo in appendix A.
</li></ul>
</section>
-<section class="appendix" id="changes-from-candidate-recommendation-to-this-version">
- <h3><span class="secno">B.2 </span>Changes from Candidate Recommendation to this version</h3>
+<section class="appendix" id="changes-from-candidate-recommendation-to-proposed-recommendation">
+ <h3><span class="secno">B.2 </span>Changes from Candidate Recommendation to Proposed Recommendation</h3>
<p> Please see the <a href="http://www.w3.org/2011/prov/wiki/ResponsesToPublicCommentsCR">
Responses to Public Comments on the Candidate Recommendation</a>
for more details about the justification of these changes.</p>
--- a/model/releases/REC-prov-constraints-20130430/diff-c.html Mon Apr 15 11:33:55 2013 +0200
+++ b/model/releases/REC-prov-constraints-20130430/diff-c.html Mon Apr 15 11:34:21 2013 +0200
@@ -815,7 +815,7 @@
<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-xml-20130430/">PROV-XML</a> <span class="delete">(To be published as Note),</span><span class="insert">(Note),</span> 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> <span class="delete">(To be published as Note), the</span><span class="insert">(Note),</span> 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-dictionary-20130430/">PROV-DICTIONARY</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> introduces a specific type of collection, consisting of key-entity pairs [<cite><a class="bibref" href="#bib-PROV-DICTIONARY">PROV-DICTIONARY</a></cite>];</li>
-<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-dc-20130430/">PROV-DC</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> provides a mapping between <span class="delete">PROV</span><span class="insert">PROV-O</span> and Dublic 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-dc-20130430/">PROV-DC</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> provides a mapping between <span class="delete">PROV and Dublic</span><span class="insert">PROV-O and Dublin</span> 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> <span class="delete">(To be published as Note),</span><span class="insert">(Note),</span> 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> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> introduces a mechanism to link across bundles [<cite><a class="bibref" href="#bib-PROV-LINKS">PROV-LINKS</a></cite>].</li>
</ul>
@@ -902,7 +902,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<br>
-</a><ul class="toc"><li class="tocline"><a href="#conventions" class="tocxref"><span class="secno">1.1 </span>Conventions</a></li><li class="tocline"><a href="#purpose" class="tocxref"><span class="secno">1.2 </span>Purpose of this document</a></li><li class="tocline"><a href="#structure-of-this-document" class="tocxref"><span class="secno">1.3 </span>Structure of this document</a></li><li class="tocline"><a href="#audience" class="tocxref"><span class="secno">1.4 </span> Audience </a></li></ul></li><li class="tocline"><a href="#rationale" class="tocxref"><span class="secno">2. </span>Rationale (Informative)</a><ul class="toc"><li class="tocline"><a href="#entities-activities-and-agents" class="tocxref"><span class="secno">2.1 </span>Entities, Activities and Agents</a></li><li class="tocline"><a href="#events" class="tocxref"><span class="secno">2.2 </span>Events</a></li><li class="tocline"><a href="#typing-section" class="tocxref"><span class="secno">2.3 </span>Types</a></li><li class="tocline"><a href="#overview" class="tocxref"><span class="secno">2.4 </span>Validation Process Overview</a></li><li class="tocline"><a href="#summary-of-inferences-and-constraints" class="tocxref"><span class="secno">2.5 </span>Summary of inferences and constraints</a></li></ul></li><li class="tocline"><a href="#compliance" class="tocxref"><span class="secno">3. </span>Compliance with this document</a></li><li class="tocline"><a href="#concepts" class="tocxref"><span class="secno">4. </span>Basic concepts</a></li><li class="tocline"><a href="#inferences" class="tocxref"><span class="secno">5. </span>Definitions and Inferences</a><ul class="toc"><li class="tocline"><a href="#optional-identifiers-and-attributes" class="tocxref"><span class="secno">5.1 </span>Optional Identifiers and Attributes</a></li><li class="tocline"><a href="#entities-and-activities" class="tocxref"><span class="secno">5.2 </span>Entities and Activities</a></li><li class="tocline"><a href="#derivations" class="tocxref"><span class="secno">5.3 </span>Derivations</a></li><li class="tocline"><a href="#agents" class="tocxref"><span class="secno">5.4 </span>Agents</a></li><li class="tocline"><a href="#alternate-and-specialized-entities" class="tocxref"><span class="secno">5.5 </span>Alternate and Specialized Entities</a></li></ul></li><li class="tocline"><a href="#constraints" class="tocxref"><span class="secno">6. </span>Constraints</a><ul class="toc"><li class="tocline"><a href="#uniqueness-constraints" class="tocxref"><span class="secno">6.1 </span>Uniqueness Constraints</a></li><li class="tocline"><a href="#event-ordering-constraints" class="tocxref"><span class="secno">6.2 </span>Event Ordering Constraints</a><ul class="toc"><li class="tocline"><a href="#activity-constraints" class="tocxref"><span class="secno">6.2.1 </span>Activity constraints</a></li><li class="tocline"><a href="#entity-constraints" class="tocxref"><span class="secno">6.2.2 </span> Entity constraints</a></li><li class="tocline"><a href="#agent-constraints" class="tocxref"><span class="secno">6.2.3 </span> Agent constraints</a></li></ul></li><li class="tocline"><a href="#type-constraints" class="tocxref"><span class="secno">6.3 </span>Type Constraints</a></li><li class="tocline"><a href="#impossibility-constraints" class="tocxref"><span class="secno">6.4 </span>Impossibility constraints</a></li></ul></li><li class="tocline"><a href="#normalization-validity-equivalence" class="tocxref"><span class="secno">7. </span>Normalization, Validity, and Equivalence</a><ul class="toc"><li class="tocline"><a href="#instances" class="tocxref"><span class="secno">7.1 </span>Instances</a></li><li class="tocline"><a href="#bundle-constraints" class="tocxref"><span class="secno">7.2 </span>Bundles and Documents</a></li></ul></li><li class="tocline"><a href="#glossary" class="tocxref"><span class="secno">8. </span>Glossary</a></li><li class="tocline"><a href="#termination" class="tocxref"><span class="secno">A. </span>Termination of normalization</a></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="#changes-since-proposed-recommendation" class="tocxref"><span class="secno"><span class="insert">B.1 </span></span><span class="insert">Changes since Proposed Recommendation</span></a></li><li class="tocline"><a href="#changes-from-candidate-recommendation-to-this-version" class="tocxref"><span class="secno"><span class="delete">B.1</span><span class="insert">B.2</span> </span>Changes from Candidate Recommendation to this version</a></li><li class="tocline"><a href="#changes-from-last-call-working-draft-to-candidate-recommendation" class="tocxref"><span class="secno"><span class="delete">B.2</span><span class="insert">B.3</span> </span>Changes from Last Call Working Draft to Candidate Recommendation</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="#normative-references" class="tocxref"><span class="secno">D.1 </span>Normative references</a></li><li class="tocline"><a href="#informative-references" class="tocxref"><span class="secno">D.2 </span>Informative references</a></li></ul></li></ul></section>
+</a><ul class="toc"><li class="tocline"><a href="#conventions" class="tocxref"><span class="secno">1.1 </span>Conventions</a></li><li class="tocline"><a href="#purpose" class="tocxref"><span class="secno">1.2 </span>Purpose of this document</a></li><li class="tocline"><a href="#structure-of-this-document" class="tocxref"><span class="secno">1.3 </span>Structure of this document</a></li><li class="tocline"><a href="#audience" class="tocxref"><span class="secno">1.4 </span> Audience </a></li></ul></li><li class="tocline"><a href="#rationale" class="tocxref"><span class="secno">2. </span>Rationale (Informative)</a><ul class="toc"><li class="tocline"><a href="#entities-activities-and-agents" class="tocxref"><span class="secno">2.1 </span>Entities, Activities and Agents</a></li><li class="tocline"><a href="#events" class="tocxref"><span class="secno">2.2 </span>Events</a></li><li class="tocline"><a href="#typing-section" class="tocxref"><span class="secno">2.3 </span>Types</a></li><li class="tocline"><a href="#overview" class="tocxref"><span class="secno">2.4 </span>Validation Process Overview</a></li><li class="tocline"><a href="#summary-of-inferences-and-constraints" class="tocxref"><span class="secno">2.5 </span>Summary of inferences and constraints</a></li></ul></li><li class="tocline"><a href="#compliance" class="tocxref"><span class="secno">3. </span>Compliance with this document</a></li><li class="tocline"><a href="#concepts" class="tocxref"><span class="secno">4. </span>Basic concepts</a></li><li class="tocline"><a href="#inferences" class="tocxref"><span class="secno">5. </span>Definitions and Inferences</a><ul class="toc"><li class="tocline"><a href="#optional-identifiers-and-attributes" class="tocxref"><span class="secno">5.1 </span>Optional Identifiers and Attributes</a></li><li class="tocline"><a href="#entities-and-activities" class="tocxref"><span class="secno">5.2 </span>Entities and Activities</a></li><li class="tocline"><a href="#derivations" class="tocxref"><span class="secno">5.3 </span>Derivations</a></li><li class="tocline"><a href="#agents" class="tocxref"><span class="secno">5.4 </span>Agents</a></li><li class="tocline"><a href="#alternate-and-specialized-entities" class="tocxref"><span class="secno">5.5 </span>Alternate and Specialized Entities</a></li></ul></li><li class="tocline"><a href="#constraints" class="tocxref"><span class="secno">6. </span>Constraints</a><ul class="toc"><li class="tocline"><a href="#uniqueness-constraints" class="tocxref"><span class="secno">6.1 </span>Uniqueness Constraints</a></li><li class="tocline"><a href="#event-ordering-constraints" class="tocxref"><span class="secno">6.2 </span>Event Ordering Constraints</a><ul class="toc"><li class="tocline"><a href="#activity-constraints" class="tocxref"><span class="secno">6.2.1 </span>Activity constraints</a></li><li class="tocline"><a href="#entity-constraints" class="tocxref"><span class="secno">6.2.2 </span> Entity constraints</a></li><li class="tocline"><a href="#agent-constraints" class="tocxref"><span class="secno">6.2.3 </span> Agent constraints</a></li></ul></li><li class="tocline"><a href="#type-constraints" class="tocxref"><span class="secno">6.3 </span>Type Constraints</a></li><li class="tocline"><a href="#impossibility-constraints" class="tocxref"><span class="secno">6.4 </span>Impossibility constraints</a></li></ul></li><li class="tocline"><a href="#normalization-validity-equivalence" class="tocxref"><span class="secno">7. </span>Normalization, Validity, and Equivalence</a><ul class="toc"><li class="tocline"><a href="#instances" class="tocxref"><span class="secno">7.1 </span>Instances</a></li><li class="tocline"><a href="#bundle-constraints" class="tocxref"><span class="secno">7.2 </span>Bundles and Documents</a></li></ul></li><li class="tocline"><a href="#glossary" class="tocxref"><span class="secno">8. </span>Glossary</a></li><li class="tocline"><a href="#termination" class="tocxref"><span class="secno">A. </span>Termination of normalization</a></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="#changes-since-proposed-recommendation" class="tocxref"><span class="secno">B.1 </span>Changes <span class="insert">since Proposed Recommendation</span></a></li><li class="tocline"><a href="#changes-from-candidate-recommendation-to-proposed-recommendation" class="tocxref"><span class="secno"><span class="insert">B.2 </span></span><span class="insert">Changes </span>from Candidate Recommendation to <span class="delete">this version</span><span class="insert">Proposed Recommendation</span></a></li><li class="tocline"><a href="#changes-from-last-call-working-draft-to-candidate-recommendation" class="tocxref"><span class="secno"><span class="delete">B.2</span><span class="insert">B.3</span> </span>Changes from Last Call Working Draft to Candidate Recommendation</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="#normative-references" class="tocxref"><span class="secno">D.1 </span>Normative references</a></li><li class="tocline"><a href="#informative-references" class="tocxref"><span class="secno">D.2 </span>Informative references</a></li></ul></li></ul></section>
@@ -1434,8 +1434,8 @@
implementers, while the procedural approach adopted here immediately demonstrates
implementability and provides an adequate (polynomial-time) default implementation. In
this section we relate the declarative meaning of formulas to their
-procedural meaning. [<cite><a class="bibref" href="#bib-PROV-SEM">PROV-SEM</a></cite>] will provide an alternative,
-declarative characterization of validity and equivalence which could
+procedural meaning. [<cite><a class="bibref" href="#bib-PROV-SEM">PROV-SEM</a></cite>] <span class="delete">will provide</span><span class="insert">provides</span> an alternative,
+declarative characterization of validity<span class="delete"> and equivalence</span> which could
be used as a starting point for other implementation strategies. </p>
@@ -1477,7 +1477,7 @@
</p>
- <h4 id="substitution-1">Substitution</h4><p><em>This section is non-normative.</em></p>
+ <h3 id="substitution-1">Substitution<span class="delete">This section is non-normative.</span></h3>
<p>A <em>substitution</em> is a function that maps variables to terms. Concretely, since we only
need to consider substitutions of finite sets of variables, we can
write substitutions as <span class="math">[x<sub>1</sub> = t<sub>1</sub>,...,x<sub>n</sub>=t<sub>n</sub>]</span>. A substitution
@@ -1499,7 +1499,7 @@
- <h4 id="formulas">Formulas</h4>
+ <h3 id="formulas">Formulas</h3>
<p>
For the purpose of constraint checking, we view PROV statements
(possibly involving existential variables) as
@@ -1514,7 +1514,7 @@
<li>Uniqueness constraints employ atomic equational formulas <span class="math">t =
t'</span>.</li>
<li>Ordering constraints employ atomic precedence relations that can
- be thought of as binary formulas <span class="math">precedes(t,t')</span> or <span class="math">strictly_precedes(t,t')</span>
+ be thought of as binary formulas <span class="math">precedes(t,t')</span> or <span class="math"><span class="delete">strictly_precedes(t,t')</span><span class="insert">strictlyPrecedes(t,t')</span></span>
</li>
<li>Typing constraints <span class="name">'type' ∈ typeOf(id)</span>
can be represented as a atomic formulas <span class="name">typeOf(id,'type')</span>.
@@ -1529,24 +1529,24 @@
background on logical formulas, see a logic textbook such as [<cite><a class="bibref" href="#bib-Logic">Logic</a></cite>].</p>
<ul>
<li>
- A definition of the form <span class="name">A</span> <span class="conditional">IF AND ONLY IF</span> there
- exists <span class="name">y<sub>1</sub></span>...<span class="name">y<sub>m</sub></span> such that <span class="name">B<sub>1</sub></span> and ... and <span class="name">B<sub>k</sub></span>
+ A definition of the form <span class="insert">"</span><span class="name">A</span> <span class="conditional">IF AND ONLY IF</span> there
+ exists <span class="name">y<sub>1</sub></span>...<span class="name">y<sub>m</sub></span> such that <span class="name">B<sub>1</sub></span> and ... and <span class="name">B<sub>k</sub></span><span class="insert">"</span>
can be thought of as a formula <span class="math">∀ x<sub>1</sub>,....,x<sub>n</sub>. A ⇔ ∃ y<sub>1</sub>...y<sub>m</sub> . B<sub>1</sub> ∧ ... ∧ B<sub>k</sub></span>, where <span class="math">x<sub>1</sub></span>...<span class="math">x<sub>n</sub></span> are the
free variables of the definition.
</li>
-<li>An inference of the form <span class="conditional">IF</span> <span class="name">A<sub>1</sub></span> and ... and <span class="name">A<sub>p</sub></span> <span class="conditional">THEN</span> there
- exists <span class="name">y<sub>1</sub></span>...<span class="name">y<sub>m</sub></span> such that <span class="name">B<sub>1</sub></span> and ... and <span class="name">B<sub>k</sub></span> can
+<li>An inference of the form <span class="insert">"</span><span class="conditional">IF</span> <span class="name">A<sub>1</sub></span> and ... and <span class="name">A<sub>p</sub></span> <span class="conditional">THEN</span> there
+ exists <span class="name">y<sub>1</sub></span>...<span class="name">y<sub>m</sub></span> such that <span class="name">B<sub>1</sub></span> and ... and <span class="name">B<sub>k</sub></span><span class="insert">"</span> can
be thought of as a formula <span class="math">∀ x<sub>1</sub>,....,x<sub>n</sub>. A<sub>1</sub> ∧ ... ∧ A<sub>p</sub> ⇒ ∃ y<sub>1</sub>...y<sub>m</sub> . B<sub>1</sub> ∧ ... ∧ B<sub>k</sub></span>, where <span class="math">x<sub>1</sub></span>...<span class="math">x<sub>n</sub></span> are the
free variables of the inference.
</li>
-<li>A uniqueness, ordering, or typing constraint of the form <span class="conditional">IF</span> <span class="name">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> <span class="conditional">THEN</span> <span class="name">C</span> can be viewed as a formula
+<li>A uniqueness, ordering, or typing constraint of the form <span class="insert">"</span><span class="conditional">IF</span> <span class="name">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> <span class="conditional">THEN</span> <span class="name">C</span><span class="insert">"</span> can be viewed as a formula
<span class="math">∀ x<sub>1</sub>...x<sub>n</sub>. A<sub>1</sub> ∧ ... ∧ A<sub>p</sub> ⇒ C</span>. </li>
-<li>A constraint of the form <span class="conditional">IF</span> <span class="name">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> <span class="conditional">THEN INVALID</span> can be viewed as a formula
+<li>A constraint of the form <span class="insert">"</span><span class="conditional">IF</span> <span class="name">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> <span class="conditional">THEN INVALID</span><span class="insert">"</span> can be viewed as a formula
<span class="math">∀ x<sub>1</sub>...x<sub>n</sub>. A<sub>1</sub> ∧ ... ∧ A<sub>p</sub> ⇒ False</span>. </li>
</ul>
- <h4 id="satisfying-definitions-inferences-and-constraints">Satisfying definitions, inferences, and constraints</h4>
+ <h3 id="satisfying-definitions-inferences-and-constraints">Satisfying definitions, inferences, and constraints</h3>
<p>
In logic, a formula's meaning is defined by saying when it is
<em>satisfied</em>. We can view
@@ -1565,7 +1565,7 @@
B<sub>k</sub></span> are either both true or both false.
</li>
<li>A logical implication as used in an inference is
- satisfied with the formula <span class="math">∀
+ satisfied <span class="delete">with</span><span class="insert">when</span> the formula <span class="math">∀
x<sub>1</sub>,....,x<sub>n</sub>. A<sub>1</sub> ∧ ... ∧
A<sub>p</sub> ⇒ ∃ y<sub>1</sub>...y<sub>m</sub> . B<sub>1</sub> ∧
... ∧ B<sub>k</sub></span> holds, that is, for any substitution of
@@ -1586,7 +1586,7 @@
substitution for <span class="math">x<sub>1</sub>...x<sub>n</sub></span> making <span class="math">A<sub>1</sub> ∧ ... ∧ A<sub>p</sub></span> true.
</li></ol>
-<h4 id="unification-and-merging">Unification and Merging</h4>
+<h3 id="unification-and-merging">Unification and Merging</h3>
<p><em>Unification</em> is an operation that takes two terms and compares them to
determine whether they can be made equal by substituting an
@@ -1609,7 +1609,7 @@
- <h4 id="applying-definitions-inferences-and-constraints">Applying definitions, inferences, and constraints</h4>
+ <h3 id="applying-definitions-inferences-and-constraints">Applying definitions, inferences, and constraints</h3>
<p>Formulas can also be interpreted as having computational
content. That is, if an instance does not satisfy a formula, we can
often <em>apply</em> the formula to the instance to produce another
@@ -1635,7 +1635,7 @@
x<sub>1</sub>,....,x<sub>n</sub>. A<sub>1</sub> ∧ ... ∧
A<sub>p</sub> ⇒ ∃ y<sub>1</sub>...y<sub>m</sub> . B<sub>1</sub> ∧
... ∧ B<sub>k</sub></span> can be applied by searching for any occurrences of <span class="math"> A<sub>1</sub> ∧ ... ∧
- A<sub>p</sub></span> in the instance and, for each such match,
+ A<sub>p</sub></span> in the instance and, for each such <span class="delete">match,</span><span class="insert">match</span>
for which the entire conclusion does not already hold (for some <span class="math">y<sub>1</sub>,...,y<sub>m</sub></span>),
adding <span class="math">B<sub>1</sub> ∧
... ∧ B<sub>k</sub></span> to the instance, generating fresh existential
@@ -1682,7 +1682,7 @@
</p>
- <h4 id="termination-1">Termination</h4>
+ <h3 id="termination-1">Termination</h3>
<p>
In general, applying sets of logical formulas of the above
definition, inference, and constraint forms is not guaranteed to
@@ -1745,7 +1745,7 @@
</div>
- <h4 id="checking-ordering-typing-and-impossibility-constraints">Checking ordering, typing, and impossibility constraints</h4>
+ <h3 id="checking-ordering-typing-and-impossibility-constraints">Checking ordering, typing, and impossibility constraints</h3>
<p>
The ordering, typing, and impossibility constraints are checked
rather than applied. This means that they do not generate new
@@ -1811,7 +1811,7 @@
- <h4 id="equivalence-and-isomorphism">Equivalence and Isomorphism</h4>
+ <h3 id="equivalence-and-isomorphism">Equivalence and Isomorphism</h3>
<p> Given two normal forms, a natural question is whether they contain
the same information, that is, whether they are equivalent (if so,
then the original instances are also equivalent.) By analogy with
@@ -1865,7 +1865,7 @@
<li>every pair of invalid instances are equivalent</li>
</ol>
-<h4 id="from-instances-to-bundles-and-documents">From Instances to Bundles and Documents</h4>
+<h3 id="from-instances-to-bundles-and-documents">From Instances to Bundles and Documents</h3>
<p>PROV documents can contain multiple instances: a <a href="#dfn-toplevel-instance" class="internalDFN">toplevel
instance</a>, and
@@ -2501,7 +2501,8 @@
<div class="remark">
- <p>Definitions <a class="rule-ref" href="#optional-identifiers"><span>Definition 1 (optional-identifiers)</span></a> and <a class="rule-ref" href="#optional-attributes"><span>Definition 2 (optional-attributes)</span></a>.
+ <p>Definitions <a class="rule-ref" href="#optional-identifiers"><span>Definition 1 (optional-identifiers)</span></a> and <a class="rule-ref" href="#optional-attributes"><span>Definition 2 (optional-attributes)</span></a><span class="delete">.
+</span>
do not apply to <span class="name">alternateOf</span> and <span class="name">specializationOf</span>, which do not have identifiers and attributes.
</p>
</div>
@@ -2643,7 +2644,7 @@
Essentially, the definitions state that parameters
<span class="name">g,u</span> are expandable only if the activity is specified, i.e., if parameter <span class="name">a</span> is provided.
-The rationale for this is that when a is provided, then there have to be two events, namely <span class="name">u</span> and <span class="name">g</span>, which account for the usage of <span class="name">e1</span> and the generation of <span class="name">e2</span>, respectively, by <span class="name">a</span>. Conversely, if <span class="name">a</span> is not provided, then one cannot tell whether one or more activities are involved in the derivation, and the explicit introduction of such events, which correspond to a single activity, would therefore not be justified. </p>
+The rationale for this is that when <span class="name">a</span> is provided, then there have to be two events, namely <span class="name">u</span> and <span class="name">g</span>, which account for the usage of <span class="name">e1</span> and the generation of <span class="name">e2</span>, respectively, by <span class="name">a</span>. Conversely, if <span class="name">a</span> is not provided, then one cannot tell whether one or more activities are involved in the derivation, and the explicit introduction of such events, which correspond to a single activity, would therefore not be justified. </p>
<p> A later constraint, <a class="rule-ref" href="#impossible-unspecified-derivation-generation-use"><span>Constraint 51 (impossible-unspecified-derivation-generation-use)</span></a>,
@@ -4145,7 +4146,7 @@
That is, <span class="name">typeOf(e)</span> returns the set of types
associated with identifier <span class="name">e</span>. The function
<span class="name">typeOf</span> is not a PROV statement, but a
-construct used only during validation PROV, similar to <a href="#dfn-precedes" class="internalDFN">precedes</a>.
+construct used only during <span class="delete">validation PROV,</span><span class="insert">validation,</span> similar to <a href="#dfn-precedes" class="internalDFN">precedes</a>.
</p>
@@ -4521,10 +4522,23 @@
<a title="equivalence">equivalence</a> of PROV documents and instances. We first define these concepts
for PROV instances and then extend them to PROV documents.</p>
-<section id="instances">
+<div class="remark"><span class="insert">
+ Implementations should expand
+ namespace prefixes and perform any appropriate reasoning about
+ co-reference of identifiers, and rewrite the instance (by
+ replacing co-referent identifiers with a single common identifier) to
+ make this explicit, before doing validation, equivalence checking,
+ or normalization.
+ All of the following definitions assume that the application has
+ already determined which URIs in the PROV instance are co-referent
+ (e.g. </span><span class="name"><span class="insert">owl:sameAs</span></span><span class="insert"> as a result of OWL
+ reasoning).
+ </span></div>
+
+ <section id="instances">
<h3><span class="secno">7.1 </span>Instances</h3>
-<div class="remark">
+<span class="delete">
Before normalization or validation, implementations should expand
namespace prefixes and perform any appropriate reasoning about
co-reference of identifiers, and rewrite the instance (by
@@ -4533,9 +4547,12 @@
or normalization.
All of the following definitions assume that the application has
already determined which URIs in the PROV instance are co-referent
- (e.g. <span class="name">owl:sameAs</span> as a result of OWL
+ (e.g. </span><span class="delete">owl:sameAs</span><span class="delete"> as a result of OWL
reasoning).
- </div>
+ </span>
+
+
+
<p> We define the <dfn id="dfn-normal-form">normal form</dfn> of a PROV instance as the set
of provenance statements resulting from applying all definitions,
@@ -4794,8 +4811,9 @@
attributes would also arise from one with no attributes.
</p>
- <p><b>Termination for instances without attributes.</b> For
+ <p><b>Termination for instances without attributes.</b><span class="delete"> For
these instances, uniqueness and key constraints can be
+ </span>
As shown in [<cite><a class="bibref" href="#bib-DBCONSTRAINTS">DBCONSTRAINTS</a></cite>], termination of normalization can be
shown by checking that the inference rules are <em>weakly
acyclic</em>. In addition, weak acyclicity can be checked
@@ -4923,13 +4941,20 @@
<ul>
<li><span class="insert"> Changed the status of this document section.
</span></li><li><span class="insert"> Changed all URLs to PROV documents.
+ </span></li><li><span class="insert"> Fixed some minor typos in section 2.4.
+ </span></li><li><span class="insert"> Fixed typo in remark after definition 2.
+ </span></li><li><span class="insert"> Fixed typo in paragraph after table 2.
+ </span></li><li><span class="insert"> Fixed typo in sec. 6.3.
+ </span></li><li><span class="insert"> Fixed wording in remark in sec. 7.1, and moved it before
+ section heading.
+ </span></li><li><span class="insert"> Fixed typo in appendix A.
</span></li></ul>
</section>
-<section class="appendix" id="changes-from-candidate-recommendation-to-this-version">
- <h3><span class="secno"><span class="delete">B.1</span><span class="insert">B.2</span> </span>Changes from Candidate Recommendation to this version</h3>
+<section class="appendix" id="changes-from-candidate-recommendation-to-proposed-recommendation">
+ <h3><span class="secno"><span class="delete">B.1</span><span class="insert">B.2</span> </span>Changes from Candidate Recommendation to <span class="delete">this version</span><span class="insert">Proposed Recommendation</span></h3>
<p> Please see the <a href="http://www.w3.org/2011/prov/wiki/ResponsesToPublicCommentsCR">
Responses to Public Comments on the Candidate Recommendation</a>
for more details about the justification of these changes.</p>
--- a/model/releases/REC-prov-dm-20130430/Overview.html Mon Apr 15 11:33:55 2013 +0200
+++ b/model/releases/REC-prov-dm-20130430/Overview.html Mon Apr 15 11:34:21 2013 +0200
@@ -906,7 +906,7 @@
<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-dictionary-20130430/">PROV-DICTIONARY</a> (Note) introduces a specific type of collection, consisting of key-entity pairs [<cite><a class="bibref" href="#bib-PROV-DICTIONARY">PROV-DICTIONARY</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 Dublic 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-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>
</ul>
--- a/model/releases/REC-prov-dm-20130430/diff.html Mon Apr 15 11:33:55 2013 +0200
+++ b/model/releases/REC-prov-dm-20130430/diff.html Mon Apr 15 11:34:21 2013 +0200
@@ -919,7 +919,7 @@
<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-xml-20130430/">PROV-XML</a> <span class="delete">(To be published as Note),</span><span class="insert">(Note),</span> 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> <span class="delete">(To be published as Note), the</span><span class="insert">(Note),</span> 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-dictionary-20130430/">PROV-DICTIONARY</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> introduces a specific type of collection, consisting of key-entity pairs [<cite><a class="bibref" href="#bib-PROV-DICTIONARY">PROV-DICTIONARY</a></cite>];</li>
-<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-dc-20130430/">PROV-DC</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> provides a mapping between <span class="delete">PROV</span><span class="insert">PROV-O</span> and Dublic 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-dc-20130430/">PROV-DC</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> provides a mapping between <span class="delete">PROV</span><span class="insert">PROV-O</span> and <span class="delete">Dublic</span><span class="insert">Dublin</span> 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> <span class="delete">(To be published as Note),</span><span class="insert">(Note),</span> 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> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> introduces a mechanism to link across bundles [<cite><a class="bibref" href="#bib-PROV-LINKS">PROV-LINKS</a></cite>].</li>
</ul>
--- a/model/releases/REC-prov-n-20130430/Overview.html Mon Apr 15 11:33:55 2013 +0200
+++ b/model/releases/REC-prov-n-20130430/Overview.html Mon Apr 15 11:34:21 2013 +0200
@@ -882,7 +882,7 @@
<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-dictionary-20130430/">PROV-DICTIONARY</a> (Note) introduces a specific type of collection, consisting of key-entity pairs [<cite><a class="bibref" href="#bib-PROV-DICTIONARY">PROV-DICTIONARY</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 Dublic 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-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>
</ul>
--- a/model/releases/REC-prov-n-20130430/diff-n.html Mon Apr 15 11:33:55 2013 +0200
+++ b/model/releases/REC-prov-n-20130430/diff-n.html Mon Apr 15 11:34:21 2013 +0200
@@ -895,7 +895,7 @@
<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-xml-20130430/">PROV-XML</a> <span class="delete">(To be published as Note),</span><span class="insert">(Note),</span> 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> <span class="delete">(To be published as Note), the</span><span class="insert">(Note),</span> 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-dictionary-20130430/">PROV-DICTIONARY</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> introduces a specific type of collection, consisting of key-entity pairs [<cite><a class="bibref" href="#bib-PROV-DICTIONARY">PROV-DICTIONARY</a></cite>];</li>
-<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-dc-20130430/">PROV-DC</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> provides a mapping between <span class="delete">PROV</span><span class="insert">PROV-O</span> and Dublic 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-dc-20130430/">PROV-DC</a> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> provides a mapping between <span class="delete">PROV</span><span class="insert">PROV-O</span> and <span class="delete">Dublic</span><span class="insert">Dublin</span> 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> <span class="delete">(To be published as Note),</span><span class="insert">(Note),</span> 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> <span class="delete">(To be published as Note)</span><span class="insert">(Note)</span> introduces a mechanism to link across bundles [<cite><a class="bibref" href="#bib-PROV-LINKS">PROV-LINKS</a></cite>].</li>
</ul>
--- a/paq/css/prov-aq.css Mon Apr 15 11:33:55 2013 +0200
+++ b/paq/css/prov-aq.css Mon Apr 15 11:34:21 2013 +0200
@@ -10,6 +10,11 @@
color: #224433;
}
+td code {
+ font-family: monospace;
+ color: #224433;
+}
+
div code {
font-family: monospace;
color: #224433;
--- a/paq/prov-aq.html Mon Apr 15 11:33:55 2013 +0200
+++ b/paq/prov-aq.html Mon Apr 15 11:34:21 2013 +0200
@@ -387,9 +387,6 @@
<section>
<h2>URI types and dereferencing</h2>
- <p class="TODO">
- Proposed to drop Target-URI entry from this section.
- </p>
<p>
A number of resource types are described above in <a href="#concepts" class="sectionRef"></a>. The table below summarizes what these various URIs are intended to denote, and the kind of information that should be returned if they are dereferenced:
</p>
@@ -402,7 +399,10 @@
<tr style="vertical-align: top;">
<td><a class="internalDFN">Target-URI</a></td>
<td>Any resource that is described by some provenance - typically an <a class="externalRef" href="http://www.w3.org/TR/prov-dm/#section-entity-activity">entity</a> (in the sense of [[PROV-DM]]), but may be of another type (such as [[PROV-DM]] activity).</td>
- <td>If the URI is dereferencable, it should return a representation or description of the resource for which provenance is provided.</td>
+ <td>
+ Not specified (the URI is not even required to be dereferencable).
+ <!-- If the URI is dereferencable, it should return a representation or description of the resource for which provenance is provided. -->
+ </td>
</tr>
<tr style="vertical-align: top;">
<td><a class="internalDFN">Provenance-URI</a></td>
@@ -966,9 +966,6 @@
<section>
<h2>Provenance pingback</h2>
- <p class="TODO">
- REVIEW. This section describes an "at-risk" feature whose final inclusion in this document is undecided. Does the use of a "ping-back" for discovering additional provenance fall under the remit of "provenance access and query"? Is it a useful feature to define?
- </p>
<p>
This section describes a mechanism that may be used to discover related provenance information that the publisher of a resource does not otherwise know about; e.g. provenance describing how it is used after it has been created.
</p>
@@ -1001,20 +998,20 @@
For example, consider a resource that is published by <code>acme.example.com</code>, and is subsequently used by <code>coyote.example.org</code> in the construction of some new entity; we might see an exchange along the following lines. We start with <code>coyote.example.org</code> retrieving a copy of <code>acme.example.org</code>'s resource:
</p>
<pre class="example code">
- C: GET http://acme.example.org/super-widget HTTP/1.1
+ C: GET http://acme.example.org/super-widget123 HTTP/1.1
S: 200 OK
- S: Link: <http://acme.example.org/super-widget/provenance>;
+ S: Link: <http://acme.example.org/super-widget123/provenance>;
rel="http://www.w3.org/ns/prov#has_provenance"
- S: Link: <http://acme.example.org/super-widget/pingback>;
+ S: Link: <http://acme.example.org/super-widget123/pingback>;
rel="http://www.w3.org/ns/prov#pingback"
:
- (super-widget resource data)</pre>
+ (super-widget123 resource data)</pre>
<p>
- The first of the links in the response is a <code>has_provenance</code> link with a <a class="internalDFN">provenance-URI</a> that has been described previously (<a href="#resource-accessed-by-http" class="sectionRef"></a>). The second is a distinct resource that exists to receive provenance pingbacks. Later, when a new resource has been created or some related action performed based upon the <code>acme.example.org/super-widget</code>, a client may post a pingback request to any supplied <code>pingback</code> URI:
+ The first of the links in the response is a <code>has_provenance</code> link with a <a class="internalDFN">provenance-URI</a> that has been described previously (<a href="#resource-accessed-by-http" class="sectionRef"></a>). The second is a distinct resource that exists to receive provenance pingbacks. Later, when a new resource has been created or some related action performed based upon the <code>acme.example.org/super-widget123</code>, a client may post a pingback request to the supplied <code>pingback</code> URI:
</p>
<pre class="example code">
- C: POST http://acme.example.org/super-widget/pingback HTTP/1.1
+ C: POST http://acme.example.org/super-widget123/pingback HTTP/1.1
C: Content-Type: text/uri-list
C:
C: http://coyote.example.org/contraption/provenance
@@ -1033,10 +1030,10 @@
The only defined operation on a pingback-URI is POST, which supplies links to provenance information or services as described above. A pingback-URI MAY respond to other requests, but no requirements are imposed on how it responds. In particular, it is not specified here how a pingback resource should respond to an HTTP GET request.
</p>
<p>
- The pingback client MAY include extra <code>has_provenance</code> links to indicate provenance records related to a different resources, specified with correspondingly different anchor URIs. For example:
+ The pingback client MAY include extra <code>has_provenance</code> links to indicate provenance records related to a different resources, specified with correspondingly different anchor URIs. These MAY indicate further provenance about existing resources, or about new resources (such as new entities derived or specialized from that for which the pingback URI was provided). For example:
</p>
<pre class="example code">
- C: POST http://acme.example.org/super-widget/pingback HTTP/1.1
+ C: POST http://acme.example.org/super-widget123/pingback HTTP/1.1
C: Link: <http://coyote.example.org/extra/provenance>;
rel="http://www.w3.org/ns/prov#has_provenance";
anchor="http://acme.example.org/extra-widget"
@@ -1049,13 +1046,13 @@
S: 204 No Content
</pre>
<p>
- The client MAY also supply <code>has_query_service</code> links indicating provenance query services that can describe the target-URI. The anchor MUST be included, and SHOULD be either the target-URI of the resource for which the pingback URI was provided (from the examples above, that would be <code>http://acme.example.org/super-widget</code>), or some related resource with relevant provenance. For example:
+ The client MAY also supply <code>has_query_service</code> links indicating provenance query services that can describe the target-URI. The anchor MUST be included, and SHOULD be either the target-URI of the resource for which the pingback URI was provided (from the examples above, that would be <code>http://acme.example.org/super-widget123</code>), or some related resource with relevant provenance. For example:
</p>
<pre class="example code">
- C: POST http://acme.example.org/super-widget/pingback HTTP/1.1
+ C: POST http://acme.example.org/super-widget123/pingback HTTP/1.1
C: Link: <http://coyote.example.org/sparql>;
rel="http://www.w3.org/ns/prov#has_query_service";
- anchor="http://acme.example.org/super-widget"
+ anchor="http://acme.example.org/super-widget123"
C: Content-Type: text/uri-list
C: Content-Length: 0
C:
@@ -1063,7 +1060,7 @@
S: 204 No Content
</pre>
<p>
- Here, the pingback client has supplied a query service URI, but did not submit any provenance-URIs and the URI list is therefore empty. The <code>Link</code> header field indicates that the resource <code>http://acme.example.org/super-widget/provenance</code> contains provenance information relating to <code>http://acme.example.org/super-widget</code> (that being the URI of the resource for which the pingback URI was provided).
+ Here, the pingback client has supplied a query service URI, but did not submit any provenance-URIs and the URI list is therefore empty. The <code>Link</code> header field indicates that the resource <code>http://acme.example.org/super-widget123/provenance</code> contains provenance information relating to <code>http://acme.example.org/super-widget123</code> (that being the URI of the resource for which the pingback URI was provided).
</p>
<!-- also in Stian's proposal
@@ -1268,6 +1265,10 @@
prov-aq.html
-->
<dl>
+<dt>2013-04-12 12:07 +0100 dae5268c75c0 Graham Klyne</dt><dd>Add some text clarifying that pingback provenance may be about new entities; result of dereferencing 'target-URI' not specified</dd>
+<dt>2013-04-12 11:32 +0100 a89cc91fa022 Graham Klyne</dt><dd>Remove 'at risk' note from section on pingback</dd>
+<dt>2013-04-12 11:31 +0100 318ae02bca82 Graham Klyne</dt><dd>Change example URIs in pingback description to make it clearer they are instances (e.g. http://acme.example.org/super-widget123)</dd>
+<dt>2013-04-08 10:33 +0100 3ddca8678084 Graham Klyne</dt><dd>Update change log</dd>
<dt>2013-04-08 10:30 +0100 2de1db892bfc Graham Klyne</dt><dd>Various editorial fixes; drop note about possibility of service document description from LDP WG.</dd>
<dt>2013-04-05 18:20 +0100 8b6a3e6e27c8 Graham Klyne</dt><dd>Additions and TODO in acknowledgements section.</dd>
<dt>2013-04-05 18:15 +0100 2072b00f4563 Graham Klyne</dt><dd>Fix typo</dd>
--- a/primer/NOTE-prov-primer-20130430/Overview.html Mon Apr 15 11:33:55 2013 +0200
+++ b/primer/NOTE-prov-primer-20130430/Overview.html Mon Apr 15 11:34:21 2013 +0200
@@ -242,7 +242,7 @@
<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-dictionary-20130430/">PROV-DICTIONARY</a> (Note) introduces a specific type of collection, consisting of key-entity pairs [<cite><a class="bibref" href="#bib-PROV-DICTIONARY">PROV-DICTIONARY</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 Dublic 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-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>
</ul>
--- a/primer/Primer.html Mon Apr 15 11:33:55 2013 +0200
+++ b/primer/Primer.html Mon Apr 15 11:34:21 2013 +0200
@@ -154,7 +154,7 @@
<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 [[PROV-XML]];</li>
<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-aq-20130430/">PROV-AQ</a> (Note), mechanisms for accessing and querying provenance [[PROV-AQ]]; </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 [[PROV-DICTIONARY]];</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 Dublic Core Terms [[PROV-DC]];</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 [[PROV-DC]];</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 [[PROV-SEM]];</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 [[PROV-LINKS]].</li>
</ul>
--- a/provenance/prov-dm.ttl Mon Apr 15 11:33:55 2013 +0200
+++ b/provenance/prov-dm.ttl Mon Apr 15 11:34:21 2013 +0200
@@ -2,6 +2,6 @@
@prefix prov: <http://www.w3.org/ns/prov#> .
-<http://www.w3.org/TR/prov-dm/> a prov:Entity.
+<http://www.w3.org/TR/prov-dm> a prov:Entity.
--- a/reports/NOTE-prov-implementations-20130430/Overview.html Mon Apr 15 11:33:55 2013 +0200
+++ b/reports/NOTE-prov-implementations-20130430/Overview.html Mon Apr 15 11:34:21 2013 +0200
@@ -718,7 +718,7 @@
</tr>
<tr id="65">
<td>65</td>
- <th scope="row"><a href="http://provenance.ecs.soton.ac.uk/validator/validator.html">ProvValidator</a></th>
+ <th scope="row"><a href="http://provenance.ecs.soton.ac.uk/validator/validator.html">Prov-Validator</a></th>
<td>Validator</td>
<td>PROV-O, PROV-N, PROV-XML, PROV-JSON</td>
</tr>
@@ -3523,9 +3523,9 @@
</caption>
<tbody><tr>
<th scope="col">Constraint</th>
- <th scope="col"> <a href="#64" title="prov-check">#62</a></th>
- <th scope="col"><a href="#65" title="checker.pl">#63</a></th>
- <th scope="col"><a href="#66" title="ProvValidator">#64</a></th>
+ <th scope="col"> <a href="#64" title="prov-check">#64</a></th>
+ <th scope="col"><a href="#65" title="Prov-Validator">#65</a></th>
+ <th scope="col"><a href="#66" title="checker.pl">#66</a></th>
</tr>
<tr>
<td class="feature"><a href="http://dvcs.w3.org/hg/prov/raw-file/default/model/prov-constraints.html#key-object">Constraint 22 (key-object)</a></td>
@@ -3760,7 +3760,7 @@
<th scope="col">Provenenane Server</th>
<th scope="col">APROVeD</th>
<th scope="col">PROV Python</th>
- <th scope="col">ProvValidator</th>
+ <th scope="col">Prov-Validator</th>
<th scope="col">PROV-DM</th>
</tr>
<tr><td colspan="9"></td></tr>
@@ -3776,7 +3776,7 @@
<td> </td>
</tr>
<tr>
- <th scope="row"><a href="#65">ProvValidator</a></th>
+ <th scope="row"><a href="#65">Prov-Validator</a></th>
<td> </td>
<td><span class="independent-impl">All (PROV-O)</span></td>
<td><span class="independent-codebase">All (PROV-N)</span></td>
@@ -3799,8 +3799,8 @@
</tbody></table>
<p>Summary:</p>
<ul>
- <li>The Provenance Server (University of Southampton, Python code base) consumes provenance documents deposited by the ProvToolbox Converter and ProvValidator (University of Southampton, Java code base)</li>
- <li>The ProvValidator (University of Southampton) validates:
+ <li>The Provenance Server (University of Southampton, Python code base) consumes provenance documents deposited by the ProvToolbox Converter and Prov-Validator (University of Southampton, Java code base)</li>
+ <li>The Prov-Validator (University of Southampton) validates:
<ul>
<li>All PROV-O terms generated by PROVoKing (King's College London)</li>
<li>All PROV-N terms generated by the Provenance Server and the PROV-Python library (University of Southampton, Python code base)</li>
@@ -3827,11 +3827,11 @@
</tr>
<tr>
<th scope="col">Consumer:</th>
- <th scope="col"><a href="#65" title="ProvValidator">#65</a></th>
+ <th scope="col"><a href="#65" title="Prov-Validator">#65</a></th>
<th scope="col"><a href="#64" title="prov-check">#64</a></th>
- <th scope="col"><a href="#65" title="ProvValidator">#65</a></th>
- <th scope="col"><a href="#65" title="ProvValidator">#65</a></th>
- <th scope="col"><a href="#65" title="ProvValidator">#65</a></th>
+ <th scope="col"><a href="#65" title="Prov-Validator">#65</a></th>
+ <th scope="col"><a href="#65" title="Prov-Validator">#65</a></th>
+ <th scope="col"><a href="#65" title="Prov-Validator">#65</a></th>
</tr>
<tr>
<th scope="col">Term</th>
@@ -4186,7 +4186,7 @@
<td>2</td>
</tr>
</tbody></table>
- <div class="note"><div class="note-title"><span>Note</span></div><p class="">Although the Provenance Server (#17) and the ProvValidator (#65) are from the same institution (i.e. University of Southampton), it is worth noting that they were built from two independent code bases (one in Python and the other in Java)</p></div>
+ <div class="note"><div class="note-title"><span>Note</span></div><p class="">Although the Provenance Server (#17) and the Prov-Validator (#65) are from the same institution (i.e. University of Southampton), it is worth noting that they were built from two independent code bases (one in Python and the other in Java)</p></div>
</section>
<section class="appendix" id="acknowledgements">
--- a/reports/prov-implementations.html Mon Apr 15 11:33:55 2013 +0200
+++ b/reports/prov-implementations.html Mon Apr 15 11:34:21 2013 +0200
@@ -527,7 +527,7 @@
</tr>
<tr id="65">
<td>65</td>
- <th scope="row"><a href="http://provenance.ecs.soton.ac.uk/validator/validator.html">ProvValidator</a></th>
+ <th scope="row"><a href="http://provenance.ecs.soton.ac.uk/validator/validator.html">Prov-Validator</a></th>
<td>Validator</td>
<td>PROV-O, PROV-N, PROV-XML, PROV-JSON</td>
</tr>
@@ -3332,9 +3332,9 @@
</caption>
<tr>
<th scope="col">Constraint</th>
- <th scope="col"> <a href="#64" title="prov-check">#62</a></th>
- <th scope="col"><a href="#65" title="checker.pl">#63</a></th>
- <th scope="col"><a href="#66" title="ProvValidator">#64</a></th>
+ <th scope="col"> <a href="#64" title="prov-check">#64</a></th>
+ <th scope="col"><a href="#65" title="Prov-Validator">#65</a></th>
+ <th scope="col"><a href="#66" title="checker.pl">#66</a></th>
</tr>
<tr>
<td class="feature"><a href="http://dvcs.w3.org/hg/prov/raw-file/default/model/prov-constraints.html#key-object">Constraint 22 (key-object)</a></td>
@@ -3569,7 +3569,7 @@
<th scope="col">Provenenane Server</th>
<th scope="col">APROVeD</th>
<th scope="col">PROV Python</th>
- <th scope="col">ProvValidator</th>
+ <th scope="col">Prov-Validator</th>
<th scope="col">PROV-DM</th>
</tr>
<tr><td colspan=9></td></tr>
@@ -3585,7 +3585,7 @@
<td> </td>
</tr>
<tr>
- <th scope="row"><a href="#65">ProvValidator</a></th>
+ <th scope="row"><a href="#65">Prov-Validator</a></th>
<td> </td>
<td><span class="independent-impl">All (PROV-O)</span></td>
<td><span class="independent-codebase">All (PROV-N)</span></td>
@@ -3608,8 +3608,8 @@
</table>
<p>Summary:</p>
<ul>
- <li>The Provenance Server (University of Southampton, Python code base) consumes provenance documents deposited by the ProvToolbox Converter and ProvValidator (University of Southampton, Java code base)</li>
- <li>The ProvValidator (University of Southampton) validates:
+ <li>The Provenance Server (University of Southampton, Python code base) consumes provenance documents deposited by the ProvToolbox Converter and Prov-Validator (University of Southampton, Java code base)</li>
+ <li>The Prov-Validator (University of Southampton) validates:
<ul>
<li>All PROV-O terms generated by PROVoKing (King's College London)</li>
<li>All PROV-N terms generated by the Provenance Server and the PROV-Python library (University of Southampton, Python code base)</li>
@@ -3636,11 +3636,11 @@
</tr>
<tr>
<th scope="col">Consumer:</th>
- <th scope="col"><a href="#65" title="ProvValidator">#65</a></th>
+ <th scope="col"><a href="#65" title="Prov-Validator">#65</a></th>
<th scope="col"><a href="#64" title="prov-check">#64</a></th>
- <th scope="col"><a href="#65" title="ProvValidator">#65</a></th>
- <th scope="col"><a href="#65" title="ProvValidator">#65</a></th>
- <th scope="col"><a href="#65" title="ProvValidator">#65</a></th>
+ <th scope="col"><a href="#65" title="Prov-Validator">#65</a></th>
+ <th scope="col"><a href="#65" title="Prov-Validator">#65</a></th>
+ <th scope="col"><a href="#65" title="Prov-Validator">#65</a></th>
</tr>
<tr>
<th scope="col">Term</th>
@@ -3995,7 +3995,7 @@
<td>2</td>
</tr>
</table>
- <p class="note">Although the Provenance Server (#17) and the ProvValidator (#65) are from the same institution (i.e. University of Southampton), it is worth noting that they were built from two independent code bases (one in Python and the other in Java)</p>
+ <p class="note">Although the Provenance Server (#17) and the Prov-Validator (#65) are from the same institution (i.e. University of Southampton), it is worth noting that they were built from two independent code bases (one in Python and the other in Java)</p>
</section>
<section class="appendix">
--- a/semantics/prov-sem.html Mon Apr 15 11:33:55 2013 +0200
+++ b/semantics/prov-sem.html Mon Apr 15 11:34:21 2013 +0200
@@ -943,7 +943,7 @@
// only "name" is required
editors: [
{ name: "James Cheney", url:
- "http://homepages.inf.ed.ac.uk/jcheney", company:
+ "http://homepages.inf.ed.ac.uk/jcheney/", company:
"University of Edinburgh" },
],
@@ -1026,7 +1026,7 @@
<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 [[PROV-XML]];</li>
<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-aq-20130430/">PROV-AQ</a> (Note), the mechanisms for accessing and querying provenance [[PROV-AQ]]; </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 [[PROV-DICTIONARY]];</li>
-<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-dc-20130430/">PROV-DC</a> (Note) provides a mapping between PROV and Dublic Core Terms [[PROV-DC]];</li>
+<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-dc-20130430/">PROV-DC</a> (Note) provides a mapping between PROV and Dublin Core Terms [[PROV-DC]];</li>
<li> <a
href="http://www.w3.org/TR/2013/NOTE-prov-sem-20130430/">PROV-SEM</a>
(Note), a declarative specification in terms of
@@ -1034,6 +1034,15 @@
<li> <a href="http://www.w3.org/TR/2013/NOTE-prov-links-20130430/">PROV-LINKS</a> (Note) introduces a mechanism to link across bundles [[PROV-LINKS]].</li>
</ul>
+<h4>Implementations Encouraged</h4>
+<p>
+The Provenance Working Group encourages implementations that make use
+of or extend the semantics in this document.
+Although work on this document by the Provenance Working Group is complete,
+errors may be recorded in the <a href="http://www.w3.org/2011/prov/errata.html">errata</a> or and these may be addressed in future revisions.
+</p>
+
+<h4>Please Send Comments</h4>
</section>
@@ -4404,9 +4413,13 @@
contents reflect extensive discussion within the Working Group
as a whole. Thanks specifically to Khalid Belhajjame, Tom De
Nies, Paolo
- Missier, Simon Miles, Luc Moreau, Satya Sahoo, Joachim Van
- Herwegen for detailed feedback.
+ Missier, Simon Miles, Luc Moreau, Satya Sahoo, Jan van den
+ Bussche, and Joachim Van
+ Herwegen for detailed feedback.</p>
+<p>
+We would also like to acknowledge <a href="http://www.dagstuhl.de">Schloss Dagstuhl - Leibniz Center for Informatics</a>, because significant progress was made on this document at <a href="http://www.dagstuhl.de/en/program/calendar/semhp/?semnr=12091">Dagstuhl Seminar 12091 (Principles of Provenance)</a> that took place from February 26 to March 2, 2012.
</p>
+
<p>Thanks also to Robin Berjon for the ReSPec.js specification writing
tool and to MathJax for their LaTeX-to-HTML conversion tools, both of
which aided in the preparation of this document.</p>
--- a/semantics/releases/NOTE-prov-sem-20130430/Overview.html Mon Apr 15 11:33:55 2013 +0200
+++ b/semantics/releases/NOTE-prov-sem-20130430/Overview.html Mon Apr 15 11:34:21 2013 +0200
@@ -606,8 +606,8 @@
<style type="text/css">.MathJax_Hover_Frame {border-radius: .25em; -webkit-border-radius: .25em; -moz-border-radius: .25em; -khtml-border-radius: .25em; box-shadow: 0px 0px 15px #83A; -webkit-box-shadow: 0px 0px 15px #83A; -moz-box-shadow: 0px 0px 15px #83A; -khtml-box-shadow: 0px 0px 15px #83A; border: 1px solid #A6D ! important; display: inline-block; position: absolute}
.MathJax_Hover_Arrow {position: absolute; width: 15px; height: 11px; cursor: pointer}
-</style><style type="text/css">#MathJax_About {position: fixed; left: 50%; width: auto; text-align: center; border: 3px outset; padding: 1em 2em; background-color: #DDDDDD; color: black; cursor: default; font-family: message-box; font-size: 120%; font-style: normal; text-indent: 0; text-transform: none; line-height: normal; letter-spacing: normal; word-spacing: normal; word-wrap: normal; white-space: nowrap; float: none; z-index: 201; border-radius: 15px; -webkit-border-radius: 15px; -moz-border-radius: 15px; -khtml-border-radius: 15px; box-shadow: 0px 10px 20px #808080; -webkit-box-shadow: 0px 10px 20px #808080; -moz-box-shadow: 0px 10px 20px #808080; -khtml-box-shadow: 0px 10px 20px #808080; filter: progid:DXImageTransform.Microsoft.dropshadow(OffX=2, OffY=2, Color='gray', Positive='true')}
-.MathJax_Menu {position: absolute; background-color: white; color: black; width: auto; padding: 5px 0px; border: 1px solid #CCCCCC; margin: 0; cursor: default; font: menu; text-align: left; text-indent: 0; text-transform: none; line-height: normal; letter-spacing: normal; word-spacing: normal; word-wrap: normal; white-space: nowrap; float: none; z-index: 201; border-radius: 5px; -webkit-border-radius: 5px; -moz-border-radius: 5px; -khtml-border-radius: 5px; box-shadow: 0px 10px 20px #808080; -webkit-box-shadow: 0px 10px 20px #808080; -moz-box-shadow: 0px 10px 20px #808080; -khtml-box-shadow: 0px 10px 20px #808080; filter: progid:DXImageTransform.Microsoft.dropshadow(OffX=2, OffY=2, Color='gray', Positive='true')}
+</style><style type="text/css">#MathJax_About {position: fixed; left: 50%; width: auto; text-align: center; border: 3px outset; padding: 1em 2em; background-color: #DDDDDD; color: black; cursor: default; font-family: message-box; font-size: 120%; font-style: normal; text-indent: 0; text-transform: none; line-height: normal; letter-spacing: normal; word-spacing: normal; word-wrap: normal; white-space: nowrap; float: none; z-index: 201; border-radius: 15px; -webkit-border-radius: 15px; -moz-border-radius: 15px; -khtml-border-radius: 15px; box-shadow: 0px 10px 20px #808080; -webkit-box-shadow: 0px 10px 20px #808080; -moz-box-shadow: 0px 10px 20px #808080; -khtml-box-shadow: 0px 10px 20px #808080;}
+.MathJax_Menu {position: absolute; background-color: white; color: black; width: auto; padding: 5px 0px; border: 1px solid #CCCCCC; margin: 0; cursor: default; font: menu; text-align: left; text-indent: 0; text-transform: none; line-height: normal; letter-spacing: normal; word-spacing: normal; word-wrap: normal; white-space: nowrap; float: none; z-index: 201; border-radius: 5px; -webkit-border-radius: 5px; -moz-border-radius: 5px; -khtml-border-radius: 5px; box-shadow: 0px 10px 20px #808080; -webkit-box-shadow: 0px 10px 20px #808080; -moz-box-shadow: 0px 10px 20px #808080; -khtml-box-shadow: 0px 10px 20px #808080;}
.MathJax_MenuItem {padding: 1px 2em; background: transparent}
.MathJax_MenuTitle {background-color: #CCCCCC; margin: -5px 0 0 0; text-align: center; font-style: italic; font-size: 80%; color: #444444; padding: 2px 0; overflow: hidden}
.MathJax_MenuArrow {position: absolute; right: .5em; color: #666666}
@@ -619,9 +619,9 @@
.MathJax_MenuDisabled {color: GrayText}
.MathJax_MenuActive {background-color: #606872; color: white}
.MathJax_Menu_Close {position: absolute; width: 31px; height: 31px; top: -15px; left: -15px}
-</style><style type="text/css">#MathJax_Zoom {position: absolute; background-color: #F0F0F0; overflow: auto; display: block; z-index: 301; padding: .5em; border: 1px solid black; margin: 0; font-weight: normal; font-style: normal; text-align: left; text-indent: 0; text-transform: none; line-height: normal; letter-spacing: normal; word-spacing: normal; word-wrap: normal; white-space: nowrap; float: none; box-shadow: 5px 5px 15px #AAAAAA; -webkit-box-shadow: 5px 5px 15px #AAAAAA; -moz-box-shadow: 5px 5px 15px #AAAAAA; -khtml-box-shadow: 5px 5px 15px #AAAAAA; filter: progid:DXImageTransform.Microsoft.dropshadow(OffX=2, OffY=2, Color='gray', Positive='true')}
-#MathJax_ZoomOverlay {position: absolute; left: 0; top: 0; z-index: 300; display: inline-block; width: 100%; height: 100%; border: 0; padding: 0; margin: 0; background-color: white; opacity: 0; filter: alpha(opacity=0)}
-#MathJax_ZoomEventTrap {position: absolute; left: 0; top: 0; z-index: 302; display: inline-block; border: 0; padding: 0; margin: 0; background-color: white; opacity: 0; filter: alpha(opacity=0)}
+</style><style type="text/css">#MathJax_Zoom {position: absolute; background-color: #F0F0F0; overflow: auto; display: block; z-index: 301; padding: .5em; border: 1px solid black; margin: 0; font-weight: normal; font-style: normal; text-align: left; text-indent: 0; text-transform: none; line-height: normal; letter-spacing: normal; word-spacing: normal; word-wrap: normal; white-space: nowrap; float: none; box-shadow: 5px 5px 15px #AAAAAA; -webkit-box-shadow: 5px 5px 15px #AAAAAA; -moz-box-shadow: 5px 5px 15px #AAAAAA; -khtml-box-shadow: 5px 5px 15px #AAAAAA;}
+#MathJax_ZoomOverlay {position: absolute; left: 0; top: 0; z-index: 300; display: inline-block; width: 100%; height: 100%; border: 0; padding: 0; margin: 0; background-color: white; opacity: 0; }
+#MathJax_ZoomEventTrap {position: absolute; left: 0; top: 0; z-index: 302; display: inline-block; border: 0; padding: 0; margin: 0; background-color: white; opacity: 0; }
</style><style type="text/css">.MathJax_Preview {color: #888}
#MathJax_Message {position: fixed; left: 1px; bottom: 2px; background-color: #E6E6E6; border: 1px solid #959595; margin: 0px; padding: 2px 8px; z-index: 102; color: black; font-size: 80%; width: auto; white-space: nowrap}
#MathJax_MSIE_Frame {position: absolute; top: 0; left: 0; width: 0px; z-index: 101; border: 0px; margin: 0px; padding: 0px}
@@ -747,7 +747,7 @@
div.MathJax_MathML {display: block}
.MathJax_mmlExBox {display: block; overflow: hidden; height: 1px; width: 60ex; padding: 0; border: 0; margin: 0}
</style><!--[if lt IE 9]><script src='http://www.w3.org/2008/site/js/html5shiv.js'></script><![endif]--></head>
- <body><div id="MathJax_Message" style="display: none; "></div><div class="head">
+ <body><div class="head">
<p>
<a href="http://www.w3.org/"><img width="72" height="48" src="http://www.w3.org/Icons/w3c_home" alt="W3C"></a>
@@ -773,7 +773,7 @@
<dt>Editor:</dt>
- <dd><a href="http://homepages.inf.ed.ac.uk/jcheney">James Cheney</a>, University of Edinburgh</dd>
+ <dd><a href="http://homepages.inf.ed.ac.uk/jcheney/">James Cheney</a>, University of Edinburgh</dd>
</dl>
@@ -803,9 +803,8 @@
</p>
- <hr>
-</div>
-
+</div><div id="MathJax_Message" style="display: none; "></div>
+<hr />
<section id="abstract" class="introductory"><h2>Abstract</h2>
<p>
Provenance is information about entities, activities, and people
@@ -859,13 +858,22 @@
<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), the 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-dictionary-20130430/">PROV-DICTIONARY</a> (Note) introduces a specific type of collection, consisting of key-entity pairs [<cite><a class="bibref" href="#bib-PROV-DICTIONARY">PROV-DICTIONARY</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 and Dublic 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-dc-20130430/">PROV-DC</a> (Note) provides a mapping between PROV 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 (this document);</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>
</ul>
+<h4 id="implementations-encouraged">Implementations Encouraged</h4>
+<p>
+The Provenance Working Group encourages implementations that make use
+of or extend the semantics in this document.
+Although work on this document by the Provenance Working Group is complete,
+errors may be recorded in the <a href="http://www.w3.org/2011/prov/errata.html">errata</a> or and these may be addressed in future revisions.
+</p>
+
+<h4 id="please-send-comments">Please Send Comments</h4>
<p>
@@ -4270,9 +4278,13 @@
contents reflect extensive discussion within the Working Group
as a whole. Thanks specifically to Khalid Belhajjame, Tom De
Nies, Paolo
- Missier, Simon Miles, Luc Moreau, Satya Sahoo, Joachim Van
- Herwegen for detailed feedback.
+ Missier, Simon Miles, Luc Moreau, Satya Sahoo, Jan van den
+ Bussche, and Joachim Van
+ Herwegen for detailed feedback.</p>
+<p>
+We would also like to acknowledge <a href="http://www.dagstuhl.de">Schloss Dagstuhl - Leibniz Center for Informatics</a>, because significant progress was made on this document at <a href="http://www.dagstuhl.de/en/program/calendar/semhp/?semnr=12091">Dagstuhl Seminar 12091 (Principles of Provenance)</a> that took place from February 26 to March 2, 2012.
</p>
+
<p>Thanks also to Robin Berjon for the ReSPec.js specification writing
tool and to MathJax for their LaTeX-to-HTML conversion tools, both of
which aided in the preparation of this document.</p>
Binary file semantics/releases/NOTE-prov-sem-20130430/prov-sem.pdf has changed
--- a/semantics/review/final-luc.txt Mon Apr 15 11:33:55 2013 +0200
+++ b/semantics/review/final-luc.txt Mon Apr 15 11:34:21 2013 +0200
@@ -6,7 +6,7 @@
> - sotd paragraph: add the paragraph about feedback and errata.
>
-TODO
+Done
> - section 1: paragraph 1: definition of provenance: cite prov-dm.
>
@@ -58,7 +58,7 @@
> - section 4.3.2. How is \rho(st) defined? what it 'st' is a constant
> or an identifier?
-"st" is an ordinary parameter, i.e. either a time value constant or an identifier denoting an unknown time. TODO
+"st" is an ordinary parameter, i.e. either a time value constant or an identifier denoting an unknown time.
>
> - section 6.2: for the reader, can you make explicit why this is "WEAK completness".