Mercurial > hg > prov / changeset
summary | shortlog | changelog | graph | tags | bookmarks | branches | files | changeset
fixed typos and restaged
authorLuc Moreau <l.moreau@ecs.soton.ac.uk>
Fri, 12 Apr 2013 13:11:06 +0100
changeset 6141 14108b18020b
parent 6140 2681ddfee394
child 6142 4e1863c03a26
child 6144 8789c7a3b614
fixed typos and restaged
links/diff.html
links/prov-links.html
links/releases/NOTE-prov-links-20130430/Overview.html
links/releases/NOTE-prov-links-20130430/diff.html
model/diff-c.html
model/diff-n.html
model/diff.html
model/prov-constraints.html
model/prov-dm.html
model/prov-n.html
model/releases/REC-prov-constraints-20130430/Overview.html
model/releases/REC-prov-constraints-20130430/diff-c.html
model/releases/REC-prov-dm-20130430/Overview.html
model/releases/REC-prov-dm-20130430/diff.html
model/releases/REC-prov-n-20130430/Overview.html
model/releases/REC-prov-n-20130430/diff-n.html 
--- a/links/diff.html	Fri Apr 12 12:15:32 2013 +0100
+++ b/links/diff.html	Fri Apr 12 13:11:06 2013 +0100
@@ -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	Fri Apr 12 12:15:32 2013 +0100
+++ b/links/prov-links.html	Fri Apr 12 13:11:06 2013 +0100
@@ -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	Fri Apr 12 12:15:32 2013 +0100
+++ b/links/releases/NOTE-prov-links-20130430/Overview.html	Fri Apr 12 13:11:06 2013 +0100
@@ -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	Fri Apr 12 12:15:32 2013 +0100
+++ b/links/releases/NOTE-prov-links-20130430/diff.html	Fri Apr 12 13:11:06 2013 +0100
@@ -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	Fri Apr 12 12:15:32 2013 +0100
+++ b/model/diff-c.html	Fri Apr 12 13:11:06 2013 +0100
@@ -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	Fri Apr 12 12:15:32 2013 +0100
+++ b/model/diff-n.html	Fri Apr 12 13:11:06 2013 +0100
@@ -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	Fri Apr 12 12:15:32 2013 +0100
+++ b/model/diff.html	Fri Apr 12 13:11:06 2013 +0100
@@ -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	Fri Apr 12 12:15:32 2013 +0100
+++ b/model/prov-constraints.html	Fri Apr 12 13:11:06 2013 +0100
@@ -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>
--- a/model/prov-dm.html	Fri Apr 12 12:15:32 2013 +0100
+++ b/model/prov-dm.html	Fri Apr 12 13:11:06 2013 +0100
@@ -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	Fri Apr 12 12:15:32 2013 +0100
+++ b/model/prov-n.html	Fri Apr 12 13:11:06 2013 +0100
@@ -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	Fri Apr 12 12:15:32 2013 +0100
+++ b/model/releases/REC-prov-constraints-20130430/Overview.html	Fri Apr 12 13:11:06 2013 +0100
@@ -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	Fri Apr 12 12:15:32 2013 +0100
+++ b/model/releases/REC-prov-constraints-20130430/diff-c.html	Fri Apr 12 13:11:06 2013 +0100
@@ -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	Fri Apr 12 12:15:32 2013 +0100
+++ b/model/releases/REC-prov-dm-20130430/Overview.html	Fri Apr 12 13:11:06 2013 +0100
@@ -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	Fri Apr 12 12:15:32 2013 +0100
+++ b/model/releases/REC-prov-dm-20130430/diff.html	Fri Apr 12 13:11:06 2013 +0100
@@ -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	Fri Apr 12 12:15:32 2013 +0100
+++ b/model/releases/REC-prov-n-20130430/Overview.html	Fri Apr 12 13:11:06 2013 +0100
@@ -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	Fri Apr 12 12:15:32 2013 +0100
+++ b/model/releases/REC-prov-n-20130430/diff-n.html	Fri Apr 12 13:11:06 2013 +0100
@@ -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>
prov

Hosted by W3C Systems Team, please report bugs to sysreq@w3.org