fixed url in prov-c staged document
authorLuc Moreau <l.moreau@ecs.soton.ac.uk>
Fri, 08 Mar 2013 16:12:27 +0000 (2013-03-08)
changeset 5925 ccbbb3812dc2
parent 5924 41794c87d1ec
child 5928 c066c8077923
child 5930 2eea265c70d7
fixed url in prov-c staged document
model/diff-c.html
model/prov-constraints.html
model/releases/PR-prov-constraints-20130312/Overview.html
model/releases/PR-prov-constraints-20130312/diff-c.html
--- a/model/diff-c.html	Fri Mar 08 15:50:02 2013 +0000
+++ b/model/diff-c.html	Fri Mar 08 16:12:27 2013 +0000
@@ -790,7 +790,7 @@
 <a title="equivalence">equivalent</a>.  Validity and equivalence are also defined for PROV
 bundles (that is, named instances) and documents (that is, a toplevel
 instance together with zero or more bundles).</p>
-<p>The <a href="http://www.w3.org/TR/2012/WD-prov-overview-20130312/">PROV Document Overview</a> describes the overall state of PROV, and should be read before other PROV documents.</p>
+<p>The <a href="http://www.w3.org/TR/2013/WD-prov-overview-20130312/">PROV Document Overview</a> describes the overall state of PROV, and should be read before other PROV documents.</p>
 </section><section id="sotd" class="introductory"><h2>Status of This Document</h2>
   
     
@@ -950,10 +950,10 @@
 
 
 
-<p>The key words "<em class="rfc2119" title="must">must</em>", "<em class="rfc2119" title="must not">must not</em>", "<em class="rfc2119" title="required">required</em>", "<em class="rfc2119" title="shall">shall</em>", "<em class="rfc2119" title="shall
-      not">shall
-      not</em>", "<em class="rfc2119" title="should">should</em>", "<em class="rfc2119" title="should not">should not</em>", "<em class="rfc2119" title="recommended">recommended</em>",  "<em class="rfc2119" title="may">may</em>", and
-      "<em class="rfc2119" title="optional">optional</em>" in this document are to be interpreted as described in
+<p>The key words "<span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em>", "<span class="delete">must not</span><em class="rfc2119" title="MUST NOT"><span class="insert">MUST NOT</span></em>", "<span class="delete">required</span><em class="rfc2119" title="REQUIRED"><span class="insert">REQUIRED</span></em>", "<span class="delete">shall</span><em class="rfc2119" title="SHALL"><span class="insert">SHALL</span></em>", "<span class="delete">shall</span><em class="rfc2119" title="SHALL
+      NOT"><span class="insert">SHALL</span>
+      <span class="delete">not</span><span class="insert">NOT</span></em>", "<span class="delete">should</span><em class="rfc2119" title="SHOULD"><span class="insert">SHOULD</span></em>", "<span class="delete">should not</span><em class="rfc2119" title="SHOULD NOT"><span class="insert">SHOULD NOT</span></em>", "<span class="delete">recommended</span><em class="rfc2119" title="RECOMMENDED"><span class="insert">RECOMMENDED</span></em>",  "<span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em>", and
+      "<span class="delete">optional</span><em class="rfc2119" title="OPTIONAL"><span class="insert">OPTIONAL</span></em>" in this document are to be interpreted as described in
       [<cite><a class="bibref" href="#bib-RFC2119">RFC2119</a></cite>].</p>
 
 <p>In this document, logical formulas contain variables written as
@@ -991,7 +991,7 @@
 
 <p> This document specifies <em>definitions</em> of some
 provenance statements in terms of others, <em>inferences</em> over PROV instances
-that applications <em class="rfc2119" title="may">may</em> employ, and also defines a class of
+that applications <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> employ, and also defines a class of
 <a href="#dfn-valid" class="internalDFN">valid</a> PROV instances by specifying <em>constraints</em> that
 <a href="#dfn-valid" class="internalDFN">valid</a> PROV instances must satisfy. There are four kinds of
 constraints: <em>uniqueness constraints</em>, <em>event ordering
@@ -1016,20 +1016,20 @@
 <p>
 This specification defines
 validity and equivalence procedurally, via an algorithm based on
-<a title="normal form" href="#dfn-normal-form" class="internalDFN">normalization</a>.  Applications <em class="rfc2119" title="may">may</em> implement
+<a title="normal form" href="#dfn-normal-form" class="internalDFN">normalization</a>.  Applications <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> implement
 validity and equivalence checking using normalization, as outlined
-here.  Applications <em class="rfc2119" title="may">may</em> also implement validation and equivalence
+here.  Applications <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> also implement validation and equivalence
 checking in
 any other way as long as the same instances or documents are considered valid or
 equivalent, respectively.
 </p>
 
-<p> Checking validity or equivalence are <em class="rfc2119" title="recommended">recommended</em>, but not required, for
+<p> Checking validity or equivalence are <span class="delete">recommended</span><em class="rfc2119" title="RECOMMENDED"><span class="insert">RECOMMENDED</span></em>, but not required, for
 applications compliant with PROV.  
-Applications producing provenance <em class="rfc2119" title="should">should</em> ensure that it is
-<a href="#dfn-valid" class="internalDFN">valid</a>, and similarly applications consuming provenance <em class="rfc2119" title="may">may</em> reject provenance that is not <a href="#dfn-valid" class="internalDFN">valid</a>.  Applications
+Applications producing provenance <span class="delete">should</span><em class="rfc2119" title="SHOULD"><span class="insert">SHOULD</span></em> ensure that it is
+<a href="#dfn-valid" class="internalDFN">valid</a>, and similarly applications consuming provenance <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> reject provenance that is not <a href="#dfn-valid" class="internalDFN">valid</a>.  Applications
 that are determining whether PROV instances or documents convey the same
-information <em class="rfc2119" title="should">should</em> check equivalence as specified here.  As a
+information <span class="delete">should</span><em class="rfc2119" title="SHOULD"><span class="insert">SHOULD</span></em> check equivalence as specified here.  As a
 guideline, applications should 
 treat equivalent instances or documents in the same way.  This is a
 guideline only, because meaning of "in the same way" is
@@ -1083,7 +1083,7 @@
 and users who wish to create, process, share or integrate provenance
 records on the (Semantic) Web.  Not all PROV-compliant applications
 need to perform inferences or check validity when processing provenance.
-However, applications that create or transform provenance <em class="rfc2119" title="should">should</em>
+However, applications that create or transform provenance <span class="delete">should</span><em class="rfc2119" title="SHOULD"><span class="insert">SHOULD</span></em>
 attempt to produce valid provenance, to make it more useful to other
 applications by ruling out nonsensical or inconsistent information.
 </p>
@@ -1468,7 +1468,7 @@
  <h3 id="constants-variables-and-placeholders">Constants, Variables and Placeholders</h3>
   <p>
   PROV statements involve identifiers, literals, 
- placeholders, and attribute lists.  Identifiers are, according to PROV-N, expressed as <a href="http://www.w3.org/TR/2012/PR-prov-n-20130312/#prod-QUALIFIED_NAME">qualified names</a> which can be mapped to URIs [<cite><a class="bibref" href="#bib-RFC3987">RFC3987</a></cite>].
+ placeholders, and attribute lists.  Identifiers are, according to PROV-N, expressed as <a href="http://www.w3.org/TR/2013/PR-prov-n-20130312/#prod-QUALIFIED_NAME">qualified names</a> which can be mapped to URIs [<cite><a class="bibref" href="#bib-RFC3987">RFC3987</a></cite>].
  However, in order to specify
   constraints over PROV instances, we also need <em>variables</em>
   that represent unknown identifiers, literals, or placeholders.
@@ -2202,22 +2202,22 @@
 
  To be compliant:
   </p><ol><li>When processing provenance, an
-    application <em class="rfc2119" title="may">may</em> apply the inferences and definitions in <a href="#inferences" class="sectionRef sec-ref">section 5. Definitions and Inferences</a>.</li>
+    application <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> apply the inferences and definitions in <a href="#inferences" class="sectionRef sec-ref">section 5. Definitions and Inferences</a>.</li>
    <li>If determining whether a PROV instance or document is <a href="#dfn-valid" class="internalDFN">valid</a>, an
-    application <em class="rfc2119" title="must">must</em> determine whether all of the
+    application <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> determine whether all of the
     constraints of <a href="#constraints" class="sectionRef sec-ref">section 6. Constraints</a> are
   satisfied on
   the <a href="#dfn-normal-form" class="internalDFN">normal form</a> of the instance or document.  </li>
    <li> If producing provenance meant for other applications to
-    use, the application <em class="rfc2119" title="should">should</em> produce <a href="#dfn-valid" class="internalDFN">valid</a> provenance, as specified in <a href="#normalization-validity-equivalence" class="sectionRef sec-ref">section 7. Normalization, Validity, and Equivalence</a>. </li>
+    use, the application <span class="delete">should</span><em class="rfc2119" title="SHOULD"><span class="insert">SHOULD</span></em> produce <a href="#dfn-valid" class="internalDFN">valid</a> provenance, as specified in <a href="#normalization-validity-equivalence" class="sectionRef sec-ref">section 7. Normalization, Validity, and Equivalence</a>. </li>
     <li>If determining whether two PROV instances or documents are
-  <a href="#dfn-equivalent" class="internalDFN">equivalent</a>, an application <em class="rfc2119" title="must">must</em> determine whether their
+  <a href="#dfn-equivalent" class="internalDFN">equivalent</a>, an application <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> determine whether their
   normal forms are equal, as specified in <a href="#normalization-validity-equivalence" class="sectionRef sec-ref">section 7. Normalization, Validity, and Equivalence</a>.
   </li></ol>
 
   <p>This specification defines validity and equivalence procedurally
   via reduction to normal forms.  If checking validity or equivalence, the
-  results <em class="rfc2119" title="must">must</em> be the same as would be obtained by computing normal
+  results <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> be the same as would be obtained by computing normal
   forms as defined in this specification.  Applications that explicitly compute
   normal forms, following the implementation strategy suggested by
   this specification, are by definition compliant.  However,
@@ -2358,7 +2358,7 @@
 <section id="inferences">
 <h2><span class="secno">5. </span>Definitions and Inferences</h2>
 <p>
-This section  describes <a title="definition" href="#dfn-definition" class="internalDFN">definitions</a> and <a title="inference" href="#inference" class="internalDFN">inferences</a> that <em class="rfc2119" title="may">may</em> be used on
+This section  describes <a title="definition" href="#dfn-definition" class="internalDFN">definitions</a> and <a title="inference" href="#inference" class="internalDFN">inferences</a> that <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> be used on
   provenance data, and that preserve <a title="equivalent" href="#dfn-equivalent" class="internalDFN">equivalence</a> on <a href="#dfn-valid" class="internalDFN">valid</a>
 PROV instances (as detailed in <a href="#normalization-validity-equivalence" class="sectionRef sec-ref">section 7. Normalization, Validity, and Equivalence</a>).
 A <dfn id="dfn-definition">definition</dfn> is a rule that can be applied to
@@ -2685,10 +2685,10 @@
   <div class="definition" id="optional-placeholders"><div class="ruleTitle"><a id="4"></a><a class="internalDFN" href="#optional-placeholders">Definition 4 (optional-placeholders)</a></div>
     <ol><li>
       <span class="name">activity(id,-,t2,attrs)</span> <span class="conditional">IF AND ONLY
-   IF</span> there exists <span class="name">t1</span> such that <span class="name">activity(id,t1,t2,attrs)</span>. Here, <span class="name">t2</span> <em class="rfc2119" title="may">may</em> be a placeholder.
+   IF</span> there exists <span class="name">t1</span> such that <span class="name">activity(id,t1,t2,attrs)</span>. Here, <span class="name">t2</span> <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> be a placeholder.
   </li>
 <li>  <span class="name">activity(id,t1,-,attrs)</span> <span class="conditional">IF AND ONLY
-   IF</span> there exists <span class="name">t2</span> such that <span class="name">activity(id,t1,t2,attrs)</span>. Here, <span class="name">t1</span> <em class="rfc2119" title="may">may</em> be a placeholder.
+   IF</span> there exists <span class="name">t2</span> such that <span class="name">activity(id,t1,t2,attrs)</span>. Here, <span class="name">t1</span> <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> be a placeholder.
 </li>
 
     <li>For each  <span class="name">r</span> in { 
@@ -2892,7 +2892,7 @@
 linked  by a revision are also alternates.</p>
  
 <div class="inference" id="revision-is-alternate-inference"><div class="ruleTitle"><a id="12"></a><a class="internalDFN" href="#revision-is-alternate-inference">Inference 12 (revision-is-alternate-inference)</a></div>
-  <p>In this inference, any of <span class="name">_a</span>, <span class="name">_g</span> or <span class="name">_u</span> <em class="rfc2119" title="may">may</em> be placeholders.</p>
+  <p>In this inference, any of <span class="name">_a</span>, <span class="name">_g</span> or <span class="name">_u</span> <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> be placeholders.</p>
 <p>
   <span class="conditional">IF</span> <span class="name">wasDerivedFrom(_id; e2,e1,_a,_g,_u,[prov:type='prov:Revision'])</span>, <span class="conditional">THEN</span> <span class="name">alternateOf(e2,e1)</span>.  
 </p>
@@ -3003,14 +3003,14 @@
   </li>
  <li>
     <span class="conditional">IF</span> <span class="name">wasDerivedFrom(id;  e2, e1, <span class="delete">a, g, u,</span><span class="insert">_a, _g, _u,</span> attrs)</span> <span class="conditional">THEN</span> <span class="name">wasInfluencedBy(id;  e2, e1, attrs)</span>.  Here,
-  <span class="name"><span class="delete">a</span><span class="insert">_a</span></span>, <span class="name"><span class="delete">g</span><span class="insert">_g</span></span>, <span class="name"><span class="delete">u</span><span class="insert">_u</span></span> <em class="rfc2119" title="may">may</em> be placeholders <span class="name">-</span>.
+  <span class="name"><span class="delete">a</span><span class="insert">_a</span></span>, <span class="name"><span class="delete">g</span><span class="insert">_g</span></span>, <span class="name"><span class="delete">u</span> <span class="delete">may</span><span class="insert">_u</span></span> <em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> be placeholders <span class="name">-</span>.
   </li>
 <li>
     <span class="conditional">IF</span> <span class="name">wasAttributedTo(id; e,ag,attrs)</span> <span class="conditional">THEN</span> <span class="name">wasInfluencedBy(id; e, ag, attrs)</span>.
   </li>
   <li>
     <span class="conditional">IF</span> <span class="name">wasAssociatedWith(id; a,ag,_pl,attrs)</span> <span class="conditional">THEN</span> <span class="name">wasInfluencedBy(id;  a, ag, attrs)</span>.  Here,
-  <span class="name">_pl</span> <em class="rfc2119" title="may">may</em> be a placeholder <span class="name">-</span>.
+  <span class="name">_pl</span> <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> be a placeholder <span class="name">-</span>.
   </li>
   <li>
     <span class="conditional">IF</span> <span class="name">actedOnBehalfOf(id; ag2,ag1,_a,attrs)</span> <span class="conditional">THEN</span> <span class="name">wasInfluencedBy(id;  ag2, ag1, attrs)</span>.
@@ -3245,7 +3245,7 @@
 <p>
 </p><hr>
 
-  <p id="key-object_text">The various identified objects of PROV <em class="rfc2119" title="must">must</em> have
+  <p id="key-object_text">The various identified objects of PROV <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> have
   unique statements describing them within a valid PROV instance.
   This is enforced through
   the following key constraints:
@@ -3395,7 +3395,7 @@
 
 
 
- <p id="unique-startTime_text">An <a href="#dfn-start-event" class="internalDFN">activity start event</a> is the <a title="instantaneous event" href="#dfn-event" class="internalDFN">instantaneous event</a> that marks the instant an activity starts. It allows for an optional time attribute.  <span id="optional-start-time">Activities also allow for an optional start time attribute.  If both are specified, they <em class="rfc2119" title="must">must</em> be the same, as expressed by the following constraint.</span>
+ <p id="unique-startTime_text">An <a href="#dfn-start-event" class="internalDFN">activity start event</a> is the <a title="instantaneous event" href="#dfn-event" class="internalDFN">instantaneous event</a> that marks the instant an activity starts. It allows for an optional time attribute.  <span id="optional-start-time">Activities also allow for an optional start time attribute.  If both are specified, they <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> be the same, as expressed by the following constraint.</span>
 </p>
 
 <div class="constraint" id="unique-startTime"><div class="ruleTitle"><a id="28"></a><a class="internalDFN" href="#unique-startTime">Constraint 28 (unique-startTime)</a></div>
@@ -3405,7 +3405,7 @@
 
 <hr>
 
-<p id="unique-endTime_text">An <a href="#dfn-end-event" class="internalDFN">activity end event</a> is the <a title="instantaneous event" href="#dfn-event" class="internalDFN">instantaneous event</a> that marks the instant an activity ends. It allows for an optional time attribute.  <span id="optional-end-time">Activities also allow for an optional end time attribute.  If both are specified, they <em class="rfc2119" title="must">must</em> be the same, as expressed by the following constraint.</span>
+<p id="unique-endTime_text">An <a href="#dfn-end-event" class="internalDFN">activity end event</a> is the <a title="instantaneous event" href="#dfn-event" class="internalDFN">instantaneous event</a> that marks the instant an activity ends. It allows for an optional time attribute.  <span id="optional-end-time">Activities also allow for an optional end time attribute.  If both are specified, they <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> be the same, as expressed by the following constraint.</span>
 </p>
 
 <div class="constraint" id="unique-endTime"><div class="ruleTitle"><a id="29"></a><a class="internalDFN" href="#unique-endTime">Constraint 29 (unique-endTime)</a></div>
@@ -3430,7 +3430,7 @@
 
 
 <p>Given that provenance consists of a description of past entities
-and activities, <a href="#dfn-valid" class="internalDFN">valid</a> provenance instances <em class="rfc2119" title="must">must</em>
+and activities, <a href="#dfn-valid" class="internalDFN">valid</a> provenance instances <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em>
 satisfy <em>ordering constraints</em> between instantaneous events, which are introduced in
 this section.  For instance, an entity can only be used after it was
 generated; in other words, an entity's <a title="entity generation
@@ -3472,9 +3472,9 @@
 (e.g. different time zones) leading to apparent inconsistencies.  For
 the purpose of checking ordering constraints, the times associated
 with events are irrelevant; thus, there is no inference that time ordering
-implies event ordering, or vice versa.  However, an application <em class="rfc2119" title="may">may</em> flag time values
+implies event ordering, or vice versa.  However, an application <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> flag time values
 that appear inconsistent with the event ordering as possible
-inconsistencies.  When generating provenance, an application <em class="rfc2119" title="should">should</em>
+inconsistencies.  When generating provenance, an application <span class="delete">should</span><em class="rfc2119" title="SHOULD"><span class="insert">SHOULD</span></em>
 use a consistent timeline for related PROV statements within an
 instance.</p>
 
@@ -3845,7 +3845,7 @@
 
 <div class="constraint" id="derivation-usage-generation-ordering"><div class="ruleTitle"><a id="41"></a><a class="internalDFN" href="#derivation-usage-generation-ordering">Constraint 41 (derivation-usage-generation-ordering)</a></div>
   <p>
-  In this constraint, <span class="name">_a</span>, <span class="name">gen2</span>, <span class="name">use1</span> <em class="rfc2119" title="must not">must not</em> be placeholders.</p>
+  In this constraint, <span class="name">_a</span>, <span class="name">gen2</span>, <span class="name">use1</span> <span class="delete">must not</span><em class="rfc2119" title="MUST NOT"><span class="insert">MUST NOT</span></em> be placeholders.</p>
 <p>
       <span class="conditional">IF</span>
 <span class="name">wasDerivedFrom(_d; _e2,_e1,_a,gen2,use1,_attrs)</span> 
@@ -3865,7 +3865,7 @@
 
 <div class="constraint" id="derivation-generation-generation-ordering"><div class="ruleTitle"><a id="42"></a><a class="internalDFN" href="#derivation-generation-generation-ordering">Constraint 42 (derivation-generation-generation-ordering)</a></div>
   <p>
-In this constraint, any of <span class="name">_a</span>, <span class="name">_g</span>, <span class="name">_u</span> <em class="rfc2119" title="may">may</em> be placeholders.</p>
+In this constraint, any of <span class="name">_a</span>, <span class="name">_g</span>, <span class="name">_u</span> <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> be placeholders.</p>
 <p>
  <span class="conditional">IF</span>
 <span class="name">wasDerivedFrom(_d; e2,e1,_a,_g,_u,attrs)</span>
@@ -4024,15 +4024,15 @@
 
 <p id="wasAssociatedWith-ordering_text">An activity that was
 associated with an agent must have some overlap with the agent. The
-agent <em class="rfc2119" title="must">must</em> have been generated (or started), or <em class="rfc2119" title="must">must</em> have become
-associated with the activity, after the activity start: so, the agent <em class="rfc2119" title="must">must</em> exist before the activity end. Likewise, the agent may be destructed (or ended), or may terminate its association with the activity, before the activity end: hence, the agent invalidation (or end) is required to happen after the activity start.
+agent <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> have been generated (or started), or <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> have become
+associated with the activity, after the activity start: so, the agent <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> exist before the activity end. Likewise, the agent may be destructed (or ended), or may terminate its association with the activity, before the activity end: hence, the agent invalidation (or end) is required to happen after the activity start.
 This is illustrated by <a href="#ordering-agents">Figure 6</a> (a) and  expressed by <a class="rule-ref" href="#wasAssociatedWith-ordering"><span>Constraint 47 (wasAssociatedWith-ordering)</span></a>.</p>
 
 
 
 <div class="constraint" id="wasAssociatedWith-ordering"><div class="ruleTitle"><a id="47"></a><a class="internalDFN" href="#wasAssociatedWith-ordering">Constraint 47 (wasAssociatedWith-ordering)</a></div>
   <p>
-In the following inferences, <span class="name">_pl</span> <em class="rfc2119" title="may">may</em> be
+In the following inferences, <span class="name">_pl</span> <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> be
  a placeholder <span class="name">-</span>.
   </p><ol>    <li>
     <span class="conditional">IF</span>
@@ -4097,7 +4097,7 @@
 
 </p><hr>
 
-<p id="wasAttributedTo-ordering_text">An agent to which an entity was attributed, <em class="rfc2119" title="must">must</em> exist before this entity was generated.
+<p id="wasAttributedTo-ordering_text">An agent to which an entity was attributed, <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> exist before this entity was generated.
 This is
 illustrated by <a href="#ordering-agents">Figure 6</a> (b) and  expressed by  <a class="rule-ref" href="#wasAttributedTo-ordering"><span>Constraint 48 (wasAttributedTo-ordering)</span></a>.</p>
 
@@ -4288,7 +4288,7 @@
 <span class="name">'entity' ∈ typeOf(e2)</span> AND
 <span class="name">'entity' ∈ typeOf(e1)</span> AND
 <span class="name">'activity' ∈ typeOf(a)</span>.
-   In this constraint, <span class="name">a</span>, <span class="name">g2</span>, and <span class="name">u1</span> <em class="rfc2119" title="must not">must not</em> be placeholders.
+   In this constraint, <span class="name">a</span>, <span class="name">g2</span>, and <span class="name">u1</span> <span class="delete">must not</span><em class="rfc2119" title="MUST NOT"><span class="insert">MUST NOT</span></em> be placeholders.
 
 </li><li>
 <span class="conditional">IF</span> 
@@ -4312,7 +4312,7 @@
 <span class="name">'activity' ∈ typeOf(a)</span> AND
 <span class="name">'agent' ∈ typeOf(ag)</span> AND
 <span class="name">'entity' ∈ typeOf(pl)</span>.  In this
-constraint, <span class="name">pl</span> <em class="rfc2119" title="must not">must not</em> be a placeholder.
+constraint, <span class="name">pl</span> <span class="delete">must not</span><em class="rfc2119" title="MUST NOT"><span class="insert">MUST NOT</span></em> be a placeholder.
 
 </li><li>
 <span class="conditional">IF</span> 
@@ -4404,7 +4404,7 @@
     event without specifying the activity.</p>
 
         <div class="constraint" id="impossible-unspecified-derivation-generation-use"><div class="ruleTitle"><a id="51"></a><a class="internalDFN" href="#impossible-unspecified-derivation-generation-use">Constraint 51 (impossible-unspecified-derivation-generation-use)</a></div>
-<p> In the following rules, <span class="name">g</span> and <span class="name">u</span> <em class="rfc2119" title="must not">must not</em> be <span class="name">-</span>.</p>
+<p> In the following rules, <span class="name">g</span> and <span class="name">u</span> <span class="delete">must not</span><em class="rfc2119" title="MUST NOT"><span class="insert">MUST NOT</span></em> be <span class="name">-</span>.</p>
 	  <ol>
   <li> <span class="conditional">IF</span>
 	    <span class="name">wasDerivedFrom(_id;_e2,_e1,-,g,-,attrs)</span>
@@ -4699,7 +4699,7 @@
   normal form up to isomorphism [<cite><a class="bibref" href="#bib-DBCONSTRAINTS">DBCONSTRAINTS</a></cite>]). </li>
 </ul>
 
-<p> An application that processes PROV data <em class="rfc2119" title="should">should</em> handle
+<p> An application that processes PROV data <span class="delete">should</span><em class="rfc2119" title="SHOULD"><span class="insert">SHOULD</span></em> handle
 equivalent instances in the same way.  This guideline is necessarily
 imprecise because "in the same way" is application-specific.
 Common exceptions to this guideline
--- a/model/prov-constraints.html	Fri Mar 08 15:50:02 2013 +0000
+++ b/model/prov-constraints.html	Fri Mar 08 16:12:27 2013 +0000
@@ -827,7 +827,7 @@
 <a title="equivalence">equivalent</a>.  Validity and equivalence are also defined for PROV
 bundles (that is, named instances) and documents (that is, a toplevel
 instance together with zero or more bundles).</p>
-<p>The <a href="http://www.w3.org/TR/2012/WD-prov-overview-20130312/">PROV Document Overview</a> describes the overall state of PROV, and should be read before other PROV documents.</p>
+<p>The <a href="http://www.w3.org/TR/2013/WD-prov-overview-20130312/">PROV Document Overview</a> describes the overall state of PROV, and should be read before other PROV documents.</p>
 </section>
 
 <section id="sotd">
@@ -1418,7 +1418,7 @@
  <h4>Constants, Variables and Placeholders</h4>
   <p>
   PROV statements involve identifiers, literals, 
- placeholders, and attribute lists.  Identifiers are, according to PROV-N, expressed as <a href="http://www.w3.org/TR/2012/PR-prov-n-20130312/#prod-QUALIFIED_NAME">qualified names</a> which can be mapped to URIs [[!RFC3987]].
+ placeholders, and attribute lists.  Identifiers are, according to PROV-N, expressed as <a href="http://www.w3.org/TR/2013/PR-prov-n-20130312/#prod-QUALIFIED_NAME">qualified names</a> which can be mapped to URIs [[!RFC3987]].
  However, in order to specify
   constraints over PROV instances, we also need <em>variables</em>
   that represent unknown identifiers, literals, or placeholders.
--- a/model/releases/PR-prov-constraints-20130312/Overview.html	Fri Mar 08 15:50:02 2013 +0000
+++ b/model/releases/PR-prov-constraints-20130312/Overview.html	Fri Mar 08 16:12:27 2013 +0000
@@ -768,7 +768,7 @@
 <a title="equivalence">equivalent</a>.  Validity and equivalence are also defined for PROV
 bundles (that is, named instances) and documents (that is, a toplevel
 instance together with zero or more bundles).</p>
-<p>The <a href="http://www.w3.org/TR/2012/WD-prov-overview-20130312/">PROV Document Overview</a> describes the overall state of PROV, and should be read before other PROV documents.</p>
+<p>The <a href="http://www.w3.org/TR/2013/WD-prov-overview-20130312/">PROV Document Overview</a> describes the overall state of PROV, and should be read before other PROV documents.</p>
 </section><section id="sotd" class="introductory"><h2>Status of This Document</h2>
   
     
@@ -887,10 +887,10 @@
 
 
 
-<p>The key words "<em class="rfc2119" title="must">must</em>", "<em class="rfc2119" title="must not">must not</em>", "<em class="rfc2119" title="required">required</em>", "<em class="rfc2119" title="shall">shall</em>", "<em class="rfc2119" title="shall
-      not">shall
-      not</em>", "<em class="rfc2119" title="should">should</em>", "<em class="rfc2119" title="should not">should not</em>", "<em class="rfc2119" title="recommended">recommended</em>",  "<em class="rfc2119" title="may">may</em>", and
-      "<em class="rfc2119" title="optional">optional</em>" in this document are to be interpreted as described in
+<p>The key words "<em class="rfc2119" title="MUST">MUST</em>", "<em class="rfc2119" title="MUST NOT">MUST NOT</em>", "<em class="rfc2119" title="REQUIRED">REQUIRED</em>", "<em class="rfc2119" title="SHALL">SHALL</em>", "<em class="rfc2119" title="SHALL
+      NOT">SHALL
+      NOT</em>", "<em class="rfc2119" title="SHOULD">SHOULD</em>", "<em class="rfc2119" title="SHOULD NOT">SHOULD NOT</em>", "<em class="rfc2119" title="RECOMMENDED">RECOMMENDED</em>",  "<em class="rfc2119" title="MAY">MAY</em>", and
+      "<em class="rfc2119" title="OPTIONAL">OPTIONAL</em>" in this document are to be interpreted as described in
       [<cite><a class="bibref" href="#bib-RFC2119">RFC2119</a></cite>].</p>
 
 <p>In this document, logical formulas contain variables written as
@@ -928,7 +928,7 @@
 
 <p> This document specifies <em>definitions</em> of some
 provenance statements in terms of others, <em>inferences</em> over PROV instances
-that applications <em class="rfc2119" title="may">may</em> employ, and also defines a class of
+that applications <em class="rfc2119" title="MAY">MAY</em> employ, and also defines a class of
 <a href="#dfn-valid" class="internalDFN">valid</a> PROV instances by specifying <em>constraints</em> that
 <a href="#dfn-valid" class="internalDFN">valid</a> PROV instances must satisfy. There are four kinds of
 constraints: <em>uniqueness constraints</em>, <em>event ordering
@@ -953,20 +953,20 @@
 <p>
 This specification defines
 validity and equivalence procedurally, via an algorithm based on
-<a title="normal form" href="#dfn-normal-form" class="internalDFN">normalization</a>.  Applications <em class="rfc2119" title="may">may</em> implement
+<a title="normal form" href="#dfn-normal-form" class="internalDFN">normalization</a>.  Applications <em class="rfc2119" title="MAY">MAY</em> implement
 validity and equivalence checking using normalization, as outlined
-here.  Applications <em class="rfc2119" title="may">may</em> also implement validation and equivalence
+here.  Applications <em class="rfc2119" title="MAY">MAY</em> also implement validation and equivalence
 checking in
 any other way as long as the same instances or documents are considered valid or
 equivalent, respectively.
 </p>
 
-<p> Checking validity or equivalence are <em class="rfc2119" title="recommended">recommended</em>, but not required, for
+<p> Checking validity or equivalence are <em class="rfc2119" title="RECOMMENDED">RECOMMENDED</em>, but not required, for
 applications compliant with PROV.  
-Applications producing provenance <em class="rfc2119" title="should">should</em> ensure that it is
-<a href="#dfn-valid" class="internalDFN">valid</a>, and similarly applications consuming provenance <em class="rfc2119" title="may">may</em> reject provenance that is not <a href="#dfn-valid" class="internalDFN">valid</a>.  Applications
+Applications producing provenance <em class="rfc2119" title="SHOULD">SHOULD</em> ensure that it is
+<a href="#dfn-valid" class="internalDFN">valid</a>, and similarly applications consuming provenance <em class="rfc2119" title="MAY">MAY</em> reject provenance that is not <a href="#dfn-valid" class="internalDFN">valid</a>.  Applications
 that are determining whether PROV instances or documents convey the same
-information <em class="rfc2119" title="should">should</em> check equivalence as specified here.  As a
+information <em class="rfc2119" title="SHOULD">SHOULD</em> check equivalence as specified here.  As a
 guideline, applications should 
 treat equivalent instances or documents in the same way.  This is a
 guideline only, because meaning of "in the same way" is
@@ -1020,7 +1020,7 @@
 and users who wish to create, process, share or integrate provenance
 records on the (Semantic) Web.  Not all PROV-compliant applications
 need to perform inferences or check validity when processing provenance.
-However, applications that create or transform provenance <em class="rfc2119" title="should">should</em>
+However, applications that create or transform provenance <em class="rfc2119" title="SHOULD">SHOULD</em>
 attempt to produce valid provenance, to make it more useful to other
 applications by ruling out nonsensical or inconsistent information.
 </p>
@@ -1419,7 +1419,7 @@
  <h3 id="constants-variables-and-placeholders">Constants, Variables and Placeholders</h3>
   <p>
   PROV statements involve identifiers, literals, 
- placeholders, and attribute lists.  Identifiers are, according to PROV-N, expressed as <a href="http://www.w3.org/TR/2012/PR-prov-n-20130312/#prod-QUALIFIED_NAME">qualified names</a> which can be mapped to URIs [<cite><a class="bibref" href="#bib-RFC3987">RFC3987</a></cite>].
+ placeholders, and attribute lists.  Identifiers are, according to PROV-N, expressed as <a href="http://www.w3.org/TR/2013/PR-prov-n-20130312/#prod-QUALIFIED_NAME">qualified names</a> which can be mapped to URIs [<cite><a class="bibref" href="#bib-RFC3987">RFC3987</a></cite>].
  However, in order to specify
   constraints over PROV instances, we also need <em>variables</em>
   that represent unknown identifiers, literals, or placeholders.
@@ -2177,22 +2177,22 @@
 
  To be compliant:
   </p><ol><li>When processing provenance, an
-    application <em class="rfc2119" title="may">may</em> apply the inferences and definitions in <a href="#inferences" class="sectionRef sec-ref">section 5. Definitions and Inferences</a>.</li>
+    application <em class="rfc2119" title="MAY">MAY</em> apply the inferences and definitions in <a href="#inferences" class="sectionRef sec-ref">section 5. Definitions and Inferences</a>.</li>
    <li>If determining whether a PROV instance or document is <a href="#dfn-valid" class="internalDFN">valid</a>, an
-    application <em class="rfc2119" title="must">must</em> determine whether all of the
+    application <em class="rfc2119" title="MUST">MUST</em> determine whether all of the
     constraints of <a href="#constraints" class="sectionRef sec-ref">section 6. Constraints</a> are
   satisfied on
   the <a href="#dfn-normal-form" class="internalDFN">normal form</a> of the instance or document.  </li>
    <li> If producing provenance meant for other applications to
-    use, the application <em class="rfc2119" title="should">should</em> produce <a href="#dfn-valid" class="internalDFN">valid</a> provenance, as specified in <a href="#normalization-validity-equivalence" class="sectionRef sec-ref">section 7. Normalization, Validity, and Equivalence</a>. </li>
+    use, the application <em class="rfc2119" title="SHOULD">SHOULD</em> produce <a href="#dfn-valid" class="internalDFN">valid</a> provenance, as specified in <a href="#normalization-validity-equivalence" class="sectionRef sec-ref">section 7. Normalization, Validity, and Equivalence</a>. </li>
     <li>If determining whether two PROV instances or documents are
-  <a href="#dfn-equivalent" class="internalDFN">equivalent</a>, an application <em class="rfc2119" title="must">must</em> determine whether their
+  <a href="#dfn-equivalent" class="internalDFN">equivalent</a>, an application <em class="rfc2119" title="MUST">MUST</em> determine whether their
   normal forms are equal, as specified in <a href="#normalization-validity-equivalence" class="sectionRef sec-ref">section 7. Normalization, Validity, and Equivalence</a>.
   </li></ol>
 
   <p>This specification defines validity and equivalence procedurally
   via reduction to normal forms.  If checking validity or equivalence, the
-  results <em class="rfc2119" title="must">must</em> be the same as would be obtained by computing normal
+  results <em class="rfc2119" title="MUST">MUST</em> be the same as would be obtained by computing normal
   forms as defined in this specification.  Applications that explicitly compute
   normal forms, following the implementation strategy suggested by
   this specification, are by definition compliant.  However,
@@ -2331,7 +2331,7 @@
 <section id="inferences">
 <!--OddPage--><h2><span class="secno">5. </span>Definitions and Inferences</h2>
 <p>
-This section  describes <a title="definition" href="#dfn-definition" class="internalDFN">definitions</a> and <a title="inference" href="#inference" class="internalDFN">inferences</a> that <em class="rfc2119" title="may">may</em> be used on
+This section  describes <a title="definition" href="#dfn-definition" class="internalDFN">definitions</a> and <a title="inference" href="#inference" class="internalDFN">inferences</a> that <em class="rfc2119" title="MAY">MAY</em> be used on
   provenance data, and that preserve <a title="equivalent" href="#dfn-equivalent" class="internalDFN">equivalence</a> on <a href="#dfn-valid" class="internalDFN">valid</a>
 PROV instances (as detailed in <a href="#normalization-validity-equivalence" class="sectionRef sec-ref">section 7. Normalization, Validity, and Equivalence</a>).
 A <dfn id="dfn-definition">definition</dfn> is a rule that can be applied to
@@ -2692,10 +2692,10 @@
   <div class="definition" id="optional-placeholders"><div class="ruleTitle"><a id="4"></a><a class="internalDFN" href="#optional-placeholders">Definition 4 (optional-placeholders)</a></div>
     <ol><li>
       <span class="name">activity(id,-,t2,attrs)</span> <span class="conditional">IF AND ONLY
-   IF</span> there exists <span class="name">t1</span> such that <span class="name">activity(id,t1,t2,attrs)</span>. Here, <span class="name">t2</span> <em class="rfc2119" title="may">may</em> be a placeholder.
+   IF</span> there exists <span class="name">t1</span> such that <span class="name">activity(id,t1,t2,attrs)</span>. Here, <span class="name">t2</span> <em class="rfc2119" title="MAY">MAY</em> be a placeholder.
   </li>
 <li>  <span class="name">activity(id,t1,-,attrs)</span> <span class="conditional">IF AND ONLY
-   IF</span> there exists <span class="name">t2</span> such that <span class="name">activity(id,t1,t2,attrs)</span>. Here, <span class="name">t1</span> <em class="rfc2119" title="may">may</em> be a placeholder.
+   IF</span> there exists <span class="name">t2</span> such that <span class="name">activity(id,t1,t2,attrs)</span>. Here, <span class="name">t1</span> <em class="rfc2119" title="MAY">MAY</em> be a placeholder.
 </li>
 <!--
 <li>For each <span class="name">r</span> in {<span
@@ -3012,7 +3012,7 @@
 linked  by a revision are also alternates.</p>
  
 <div class="inference" id="revision-is-alternate-inference"><div class="ruleTitle"><a id="12"></a><a class="internalDFN" href="#revision-is-alternate-inference">Inference 12 (revision-is-alternate-inference)</a></div>
-  <p>In this inference, any of <span class="name">_a</span>, <span class="name">_g</span> or <span class="name">_u</span> <em class="rfc2119" title="may">may</em> be placeholders.</p>
+  <p>In this inference, any of <span class="name">_a</span>, <span class="name">_g</span> or <span class="name">_u</span> <em class="rfc2119" title="MAY">MAY</em> be placeholders.</p>
 <p>
   <span class="conditional">IF</span> <span class="name">wasDerivedFrom(_id; e2,e1,_a,_g,_u,[prov:type='prov:Revision'])</span>, <span class="conditional">THEN</span> <span class="name">alternateOf(e2,e1)</span>.  
 </p>
@@ -3159,14 +3159,14 @@
   </li>
  <li>
     <span class="conditional">IF</span> <span class="name">wasDerivedFrom(id;  e2, e1, _a, _g, _u, attrs)</span> <span class="conditional">THEN</span> <span class="name">wasInfluencedBy(id;  e2, e1, attrs)</span>.  Here,
-  <span class="name">_a</span>, <span class="name">_g</span>, <span class="name">_u</span> <em class="rfc2119" title="may">may</em> be placeholders <span class="name">-</span>.
+  <span class="name">_a</span>, <span class="name">_g</span>, <span class="name">_u</span> <em class="rfc2119" title="MAY">MAY</em> be placeholders <span class="name">-</span>.
   </li>
 <li>
     <span class="conditional">IF</span> <span class="name">wasAttributedTo(id; e,ag,attrs)</span> <span class="conditional">THEN</span> <span class="name">wasInfluencedBy(id; e, ag, attrs)</span>.
   </li>
   <li>
     <span class="conditional">IF</span> <span class="name">wasAssociatedWith(id; a,ag,_pl,attrs)</span> <span class="conditional">THEN</span> <span class="name">wasInfluencedBy(id;  a, ag, attrs)</span>.  Here,
-  <span class="name">_pl</span> <em class="rfc2119" title="may">may</em> be a placeholder <span class="name">-</span>.
+  <span class="name">_pl</span> <em class="rfc2119" title="MAY">MAY</em> be a placeholder <span class="name">-</span>.
   </li>
   <li>
     <span class="conditional">IF</span> <span class="name">actedOnBehalfOf(id; ag2,ag1,_a,attrs)</span> <span class="conditional">THEN</span> <span class="name">wasInfluencedBy(id;  ag2, ag1, attrs)</span>.
@@ -3418,7 +3418,7 @@
 <p>
 </p><hr>
 
-  <p id="key-object_text">The various identified objects of PROV <em class="rfc2119" title="must">must</em> have
+  <p id="key-object_text">The various identified objects of PROV <em class="rfc2119" title="MUST">MUST</em> have
   unique statements describing them within a valid PROV instance.
   This is enforced through
   the following key constraints:
@@ -3575,7 +3575,7 @@
 
 
 
- <p id="unique-startTime_text">An <a href="#dfn-start-event" class="internalDFN">activity start event</a> is the <a title="instantaneous event" href="#dfn-event" class="internalDFN">instantaneous event</a> that marks the instant an activity starts. It allows for an optional time attribute.  <span id="optional-start-time">Activities also allow for an optional start time attribute.  If both are specified, they <em class="rfc2119" title="must">must</em> be the same, as expressed by the following constraint.</span>
+ <p id="unique-startTime_text">An <a href="#dfn-start-event" class="internalDFN">activity start event</a> is the <a title="instantaneous event" href="#dfn-event" class="internalDFN">instantaneous event</a> that marks the instant an activity starts. It allows for an optional time attribute.  <span id="optional-start-time">Activities also allow for an optional start time attribute.  If both are specified, they <em class="rfc2119" title="MUST">MUST</em> be the same, as expressed by the following constraint.</span>
 </p>
 
 <div class="constraint" id="unique-startTime"><div class="ruleTitle"><a id="28"></a><a class="internalDFN" href="#unique-startTime">Constraint 28 (unique-startTime)</a></div>
@@ -3585,7 +3585,7 @@
 
 <hr>
 
-<p id="unique-endTime_text">An <a href="#dfn-end-event" class="internalDFN">activity end event</a> is the <a title="instantaneous event" href="#dfn-event" class="internalDFN">instantaneous event</a> that marks the instant an activity ends. It allows for an optional time attribute.  <span id="optional-end-time">Activities also allow for an optional end time attribute.  If both are specified, they <em class="rfc2119" title="must">must</em> be the same, as expressed by the following constraint.</span>
+<p id="unique-endTime_text">An <a href="#dfn-end-event" class="internalDFN">activity end event</a> is the <a title="instantaneous event" href="#dfn-event" class="internalDFN">instantaneous event</a> that marks the instant an activity ends. It allows for an optional time attribute.  <span id="optional-end-time">Activities also allow for an optional end time attribute.  If both are specified, they <em class="rfc2119" title="MUST">MUST</em> be the same, as expressed by the following constraint.</span>
 </p>
 
 <div class="constraint" id="unique-endTime"><div class="ruleTitle"><a id="29"></a><a class="internalDFN" href="#unique-endTime">Constraint 29 (unique-endTime)</a></div>
@@ -3627,7 +3627,7 @@
 
 
 <p>Given that provenance consists of a description of past entities
-and activities, <a href="#dfn-valid" class="internalDFN">valid</a> provenance instances <em class="rfc2119" title="must">must</em>
+and activities, <a href="#dfn-valid" class="internalDFN">valid</a> provenance instances <em class="rfc2119" title="MUST">MUST</em>
 satisfy <em>ordering constraints</em> between instantaneous events, which are introduced in
 this section.  For instance, an entity can only be used after it was
 generated; in other words, an entity's <a title="entity generation
@@ -3669,9 +3669,9 @@
 (e.g. different time zones) leading to apparent inconsistencies.  For
 the purpose of checking ordering constraints, the times associated
 with events are irrelevant; thus, there is no inference that time ordering
-implies event ordering, or vice versa.  However, an application <em class="rfc2119" title="may">may</em> flag time values
+implies event ordering, or vice versa.  However, an application <em class="rfc2119" title="MAY">MAY</em> flag time values
 that appear inconsistent with the event ordering as possible
-inconsistencies.  When generating provenance, an application <em class="rfc2119" title="should">should</em>
+inconsistencies.  When generating provenance, an application <em class="rfc2119" title="SHOULD">SHOULD</em>
 use a consistent timeline for related PROV statements within an
 instance.</p>
 
@@ -4085,7 +4085,7 @@
 
 <div class="constraint" id="derivation-usage-generation-ordering"><div class="ruleTitle"><a id="41"></a><a class="internalDFN" href="#derivation-usage-generation-ordering">Constraint 41 (derivation-usage-generation-ordering)</a></div>
   <p>
-  In this constraint, <span class="name">_a</span>, <span class="name">gen2</span>, <span class="name">use1</span> <em class="rfc2119" title="must not">must not</em> be placeholders.</p>
+  In this constraint, <span class="name">_a</span>, <span class="name">gen2</span>, <span class="name">use1</span> <em class="rfc2119" title="MUST NOT">MUST NOT</em> be placeholders.</p>
 <p>
       <span class="conditional">IF</span>
 <span class="name">wasDerivedFrom(_d; _e2,_e1,_a,gen2,use1,_attrs)</span> 
@@ -4105,7 +4105,7 @@
 
 <div class="constraint" id="derivation-generation-generation-ordering"><div class="ruleTitle"><a id="42"></a><a class="internalDFN" href="#derivation-generation-generation-ordering">Constraint 42 (derivation-generation-generation-ordering)</a></div>
   <p>
-In this constraint, any of <span class="name">_a</span>, <span class="name">_g</span>, <span class="name">_u</span> <em class="rfc2119" title="may">may</em> be placeholders.</p>
+In this constraint, any of <span class="name">_a</span>, <span class="name">_g</span>, <span class="name">_u</span> <em class="rfc2119" title="MAY">MAY</em> be placeholders.</p>
 <p>
  <span class="conditional">IF</span>
 <span class="name">wasDerivedFrom(_d; e2,e1,_a,_g,_u,attrs)</span>
@@ -4264,15 +4264,15 @@
 
 <p id="wasAssociatedWith-ordering_text">An activity that was
 associated with an agent must have some overlap with the agent. The
-agent <em class="rfc2119" title="must">must</em> have been generated (or started), or <em class="rfc2119" title="must">must</em> have become
-associated with the activity, after the activity start: so, the agent <em class="rfc2119" title="must">must</em> exist before the activity end. Likewise, the agent may be destructed (or ended), or may terminate its association with the activity, before the activity end: hence, the agent invalidation (or end) is required to happen after the activity start.
+agent <em class="rfc2119" title="MUST">MUST</em> have been generated (or started), or <em class="rfc2119" title="MUST">MUST</em> have become
+associated with the activity, after the activity start: so, the agent <em class="rfc2119" title="MUST">MUST</em> exist before the activity end. Likewise, the agent may be destructed (or ended), or may terminate its association with the activity, before the activity end: hence, the agent invalidation (or end) is required to happen after the activity start.
 This is illustrated by <a href="#ordering-agents">Figure 6</a> (a) and  expressed by <a class="rule-ref" href="#wasAssociatedWith-ordering"><span>Constraint 47 (wasAssociatedWith-ordering)</span></a>.</p>
 
 
 
 <div class="constraint" id="wasAssociatedWith-ordering"><div class="ruleTitle"><a id="47"></a><a class="internalDFN" href="#wasAssociatedWith-ordering">Constraint 47 (wasAssociatedWith-ordering)</a></div>
   <p>
-In the following inferences, <span class="name">_pl</span> <em class="rfc2119" title="may">may</em> be
+In the following inferences, <span class="name">_pl</span> <em class="rfc2119" title="MAY">MAY</em> be
  a placeholder <span class="name">-</span>.
   </p><ol>    <li>
     <span class="conditional">IF</span>
@@ -4334,7 +4334,7 @@
 
 </p><hr>
 
-<p id="wasAttributedTo-ordering_text">An agent to which an entity was attributed, <em class="rfc2119" title="must">must</em> exist before this entity was generated.
+<p id="wasAttributedTo-ordering_text">An agent to which an entity was attributed, <em class="rfc2119" title="MUST">MUST</em> exist before this entity was generated.
 This is
 illustrated by <a href="#ordering-agents">Figure 6</a> (b) and  expressed by  <a class="rule-ref" href="#wasAttributedTo-ordering"><span>Constraint 48 (wasAttributedTo-ordering)</span></a>.</p>
 
@@ -4525,7 +4525,7 @@
 <span class="name">'entity' ∈ typeOf(e2)</span> AND
 <span class="name">'entity' ∈ typeOf(e1)</span> AND
 <span class="name">'activity' ∈ typeOf(a)</span>.
-   In this constraint, <span class="name">a</span>, <span class="name">g2</span>, and <span class="name">u1</span> <em class="rfc2119" title="must not">must not</em> be placeholders.
+   In this constraint, <span class="name">a</span>, <span class="name">g2</span>, and <span class="name">u1</span> <em class="rfc2119" title="MUST NOT">MUST NOT</em> be placeholders.
 
 </li><li>
 <span class="conditional">IF</span> 
@@ -4549,7 +4549,7 @@
 <span class="name">'activity' ∈ typeOf(a)</span> AND
 <span class="name">'agent' ∈ typeOf(ag)</span> AND
 <span class="name">'entity' ∈ typeOf(pl)</span>.  In this
-constraint, <span class="name">pl</span> <em class="rfc2119" title="must not">must not</em> be a placeholder.
+constraint, <span class="name">pl</span> <em class="rfc2119" title="MUST NOT">MUST NOT</em> be a placeholder.
 
 </li><li>
 <span class="conditional">IF</span> 
@@ -4649,7 +4649,7 @@
     event without specifying the activity.</p>
 
         <div class="constraint" id="impossible-unspecified-derivation-generation-use"><div class="ruleTitle"><a id="51"></a><a class="internalDFN" href="#impossible-unspecified-derivation-generation-use">Constraint 51 (impossible-unspecified-derivation-generation-use)</a></div>
-<p> In the following rules, <span class="name">g</span> and <span class="name">u</span> <em class="rfc2119" title="must not">must not</em> be <span class="name">-</span>.</p>
+<p> In the following rules, <span class="name">g</span> and <span class="name">u</span> <em class="rfc2119" title="MUST NOT">MUST NOT</em> be <span class="name">-</span>.</p>
 	  <ol>
   <li> <span class="conditional">IF</span>
 	    <span class="name">wasDerivedFrom(_id;_e2,_e1,-,g,-,attrs)</span>
@@ -4964,7 +4964,7 @@
   normal form up to isomorphism [<cite><a class="bibref" href="#bib-DBCONSTRAINTS">DBCONSTRAINTS</a></cite>]). </li>
 </ul>
 
-<p> An application that processes PROV data <em class="rfc2119" title="should">should</em> handle
+<p> An application that processes PROV data <em class="rfc2119" title="SHOULD">SHOULD</em> handle
 equivalent instances in the same way.  This guideline is necessarily
 imprecise because "in the same way" is application-specific.
 Common exceptions to this guideline
--- a/model/releases/PR-prov-constraints-20130312/diff-c.html	Fri Mar 08 15:50:02 2013 +0000
+++ b/model/releases/PR-prov-constraints-20130312/diff-c.html	Fri Mar 08 16:12:27 2013 +0000
@@ -790,7 +790,7 @@
 <a title="equivalence">equivalent</a>.  Validity and equivalence are also defined for PROV
 bundles (that is, named instances) and documents (that is, a toplevel
 instance together with zero or more bundles).</p>
-<p>The <a href="http://www.w3.org/TR/2012/WD-prov-overview-20130312/">PROV Document Overview</a> describes the overall state of PROV, and should be read before other PROV documents.</p>
+<p>The <a href="http://www.w3.org/TR/2013/WD-prov-overview-20130312/">PROV Document Overview</a> describes the overall state of PROV, and should be read before other PROV documents.</p>
 </section><section id="sotd" class="introductory"><h2>Status of This Document</h2>
   
     
@@ -950,10 +950,10 @@
 
 
 
-<p>The key words "<em class="rfc2119" title="must">must</em>", "<em class="rfc2119" title="must not">must not</em>", "<em class="rfc2119" title="required">required</em>", "<em class="rfc2119" title="shall">shall</em>", "<em class="rfc2119" title="shall
-      not">shall
-      not</em>", "<em class="rfc2119" title="should">should</em>", "<em class="rfc2119" title="should not">should not</em>", "<em class="rfc2119" title="recommended">recommended</em>",  "<em class="rfc2119" title="may">may</em>", and
-      "<em class="rfc2119" title="optional">optional</em>" in this document are to be interpreted as described in
+<p>The key words "<span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em>", "<span class="delete">must not</span><em class="rfc2119" title="MUST NOT"><span class="insert">MUST NOT</span></em>", "<span class="delete">required</span><em class="rfc2119" title="REQUIRED"><span class="insert">REQUIRED</span></em>", "<span class="delete">shall</span><em class="rfc2119" title="SHALL"><span class="insert">SHALL</span></em>", "<span class="delete">shall</span><em class="rfc2119" title="SHALL
+      NOT"><span class="insert">SHALL</span>
+      <span class="delete">not</span><span class="insert">NOT</span></em>", "<span class="delete">should</span><em class="rfc2119" title="SHOULD"><span class="insert">SHOULD</span></em>", "<span class="delete">should not</span><em class="rfc2119" title="SHOULD NOT"><span class="insert">SHOULD NOT</span></em>", "<span class="delete">recommended</span><em class="rfc2119" title="RECOMMENDED"><span class="insert">RECOMMENDED</span></em>",  "<span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em>", and
+      "<span class="delete">optional</span><em class="rfc2119" title="OPTIONAL"><span class="insert">OPTIONAL</span></em>" in this document are to be interpreted as described in
       [<cite><a class="bibref" href="#bib-RFC2119">RFC2119</a></cite>].</p>
 
 <p>In this document, logical formulas contain variables written as
@@ -991,7 +991,7 @@
 
 <p> This document specifies <em>definitions</em> of some
 provenance statements in terms of others, <em>inferences</em> over PROV instances
-that applications <em class="rfc2119" title="may">may</em> employ, and also defines a class of
+that applications <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> employ, and also defines a class of
 <a href="#dfn-valid" class="internalDFN">valid</a> PROV instances by specifying <em>constraints</em> that
 <a href="#dfn-valid" class="internalDFN">valid</a> PROV instances must satisfy. There are four kinds of
 constraints: <em>uniqueness constraints</em>, <em>event ordering
@@ -1016,20 +1016,20 @@
 <p>
 This specification defines
 validity and equivalence procedurally, via an algorithm based on
-<a title="normal form" href="#dfn-normal-form" class="internalDFN">normalization</a>.  Applications <em class="rfc2119" title="may">may</em> implement
+<a title="normal form" href="#dfn-normal-form" class="internalDFN">normalization</a>.  Applications <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> implement
 validity and equivalence checking using normalization, as outlined
-here.  Applications <em class="rfc2119" title="may">may</em> also implement validation and equivalence
+here.  Applications <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> also implement validation and equivalence
 checking in
 any other way as long as the same instances or documents are considered valid or
 equivalent, respectively.
 </p>
 
-<p> Checking validity or equivalence are <em class="rfc2119" title="recommended">recommended</em>, but not required, for
+<p> Checking validity or equivalence are <span class="delete">recommended</span><em class="rfc2119" title="RECOMMENDED"><span class="insert">RECOMMENDED</span></em>, but not required, for
 applications compliant with PROV.  
-Applications producing provenance <em class="rfc2119" title="should">should</em> ensure that it is
-<a href="#dfn-valid" class="internalDFN">valid</a>, and similarly applications consuming provenance <em class="rfc2119" title="may">may</em> reject provenance that is not <a href="#dfn-valid" class="internalDFN">valid</a>.  Applications
+Applications producing provenance <span class="delete">should</span><em class="rfc2119" title="SHOULD"><span class="insert">SHOULD</span></em> ensure that it is
+<a href="#dfn-valid" class="internalDFN">valid</a>, and similarly applications consuming provenance <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> reject provenance that is not <a href="#dfn-valid" class="internalDFN">valid</a>.  Applications
 that are determining whether PROV instances or documents convey the same
-information <em class="rfc2119" title="should">should</em> check equivalence as specified here.  As a
+information <span class="delete">should</span><em class="rfc2119" title="SHOULD"><span class="insert">SHOULD</span></em> check equivalence as specified here.  As a
 guideline, applications should 
 treat equivalent instances or documents in the same way.  This is a
 guideline only, because meaning of "in the same way" is
@@ -1083,7 +1083,7 @@
 and users who wish to create, process, share or integrate provenance
 records on the (Semantic) Web.  Not all PROV-compliant applications
 need to perform inferences or check validity when processing provenance.
-However, applications that create or transform provenance <em class="rfc2119" title="should">should</em>
+However, applications that create or transform provenance <span class="delete">should</span><em class="rfc2119" title="SHOULD"><span class="insert">SHOULD</span></em>
 attempt to produce valid provenance, to make it more useful to other
 applications by ruling out nonsensical or inconsistent information.
 </p>
@@ -1468,7 +1468,7 @@
  <h3 id="constants-variables-and-placeholders">Constants, Variables and Placeholders</h3>
   <p>
   PROV statements involve identifiers, literals, 
- placeholders, and attribute lists.  Identifiers are, according to PROV-N, expressed as <a href="http://www.w3.org/TR/2012/PR-prov-n-20130312/#prod-QUALIFIED_NAME">qualified names</a> which can be mapped to URIs [<cite><a class="bibref" href="#bib-RFC3987">RFC3987</a></cite>].
+ placeholders, and attribute lists.  Identifiers are, according to PROV-N, expressed as <a href="http://www.w3.org/TR/2013/PR-prov-n-20130312/#prod-QUALIFIED_NAME">qualified names</a> which can be mapped to URIs [<cite><a class="bibref" href="#bib-RFC3987">RFC3987</a></cite>].
  However, in order to specify
   constraints over PROV instances, we also need <em>variables</em>
   that represent unknown identifiers, literals, or placeholders.
@@ -2202,22 +2202,22 @@
 
  To be compliant:
   </p><ol><li>When processing provenance, an
-    application <em class="rfc2119" title="may">may</em> apply the inferences and definitions in <a href="#inferences" class="sectionRef sec-ref">section 5. Definitions and Inferences</a>.</li>
+    application <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> apply the inferences and definitions in <a href="#inferences" class="sectionRef sec-ref">section 5. Definitions and Inferences</a>.</li>
    <li>If determining whether a PROV instance or document is <a href="#dfn-valid" class="internalDFN">valid</a>, an
-    application <em class="rfc2119" title="must">must</em> determine whether all of the
+    application <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> determine whether all of the
     constraints of <a href="#constraints" class="sectionRef sec-ref">section 6. Constraints</a> are
   satisfied on
   the <a href="#dfn-normal-form" class="internalDFN">normal form</a> of the instance or document.  </li>
    <li> If producing provenance meant for other applications to
-    use, the application <em class="rfc2119" title="should">should</em> produce <a href="#dfn-valid" class="internalDFN">valid</a> provenance, as specified in <a href="#normalization-validity-equivalence" class="sectionRef sec-ref">section 7. Normalization, Validity, and Equivalence</a>. </li>
+    use, the application <span class="delete">should</span><em class="rfc2119" title="SHOULD"><span class="insert">SHOULD</span></em> produce <a href="#dfn-valid" class="internalDFN">valid</a> provenance, as specified in <a href="#normalization-validity-equivalence" class="sectionRef sec-ref">section 7. Normalization, Validity, and Equivalence</a>. </li>
     <li>If determining whether two PROV instances or documents are
-  <a href="#dfn-equivalent" class="internalDFN">equivalent</a>, an application <em class="rfc2119" title="must">must</em> determine whether their
+  <a href="#dfn-equivalent" class="internalDFN">equivalent</a>, an application <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> determine whether their
   normal forms are equal, as specified in <a href="#normalization-validity-equivalence" class="sectionRef sec-ref">section 7. Normalization, Validity, and Equivalence</a>.
   </li></ol>
 
   <p>This specification defines validity and equivalence procedurally
   via reduction to normal forms.  If checking validity or equivalence, the
-  results <em class="rfc2119" title="must">must</em> be the same as would be obtained by computing normal
+  results <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> be the same as would be obtained by computing normal
   forms as defined in this specification.  Applications that explicitly compute
   normal forms, following the implementation strategy suggested by
   this specification, are by definition compliant.  However,
@@ -2358,7 +2358,7 @@
 <section id="inferences">
 <h2><span class="secno">5. </span>Definitions and Inferences</h2>
 <p>
-This section  describes <a title="definition" href="#dfn-definition" class="internalDFN">definitions</a> and <a title="inference" href="#inference" class="internalDFN">inferences</a> that <em class="rfc2119" title="may">may</em> be used on
+This section  describes <a title="definition" href="#dfn-definition" class="internalDFN">definitions</a> and <a title="inference" href="#inference" class="internalDFN">inferences</a> that <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> be used on
   provenance data, and that preserve <a title="equivalent" href="#dfn-equivalent" class="internalDFN">equivalence</a> on <a href="#dfn-valid" class="internalDFN">valid</a>
 PROV instances (as detailed in <a href="#normalization-validity-equivalence" class="sectionRef sec-ref">section 7. Normalization, Validity, and Equivalence</a>).
 A <dfn id="dfn-definition">definition</dfn> is a rule that can be applied to
@@ -2685,10 +2685,10 @@
   <div class="definition" id="optional-placeholders"><div class="ruleTitle"><a id="4"></a><a class="internalDFN" href="#optional-placeholders">Definition 4 (optional-placeholders)</a></div>
     <ol><li>
       <span class="name">activity(id,-,t2,attrs)</span> <span class="conditional">IF AND ONLY
-   IF</span> there exists <span class="name">t1</span> such that <span class="name">activity(id,t1,t2,attrs)</span>. Here, <span class="name">t2</span> <em class="rfc2119" title="may">may</em> be a placeholder.
+   IF</span> there exists <span class="name">t1</span> such that <span class="name">activity(id,t1,t2,attrs)</span>. Here, <span class="name">t2</span> <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> be a placeholder.
   </li>
 <li>  <span class="name">activity(id,t1,-,attrs)</span> <span class="conditional">IF AND ONLY
-   IF</span> there exists <span class="name">t2</span> such that <span class="name">activity(id,t1,t2,attrs)</span>. Here, <span class="name">t1</span> <em class="rfc2119" title="may">may</em> be a placeholder.
+   IF</span> there exists <span class="name">t2</span> such that <span class="name">activity(id,t1,t2,attrs)</span>. Here, <span class="name">t1</span> <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> be a placeholder.
 </li>
 
     <li>For each  <span class="name">r</span> in { 
@@ -2892,7 +2892,7 @@
 linked  by a revision are also alternates.</p>
  
 <div class="inference" id="revision-is-alternate-inference"><div class="ruleTitle"><a id="12"></a><a class="internalDFN" href="#revision-is-alternate-inference">Inference 12 (revision-is-alternate-inference)</a></div>
-  <p>In this inference, any of <span class="name">_a</span>, <span class="name">_g</span> or <span class="name">_u</span> <em class="rfc2119" title="may">may</em> be placeholders.</p>
+  <p>In this inference, any of <span class="name">_a</span>, <span class="name">_g</span> or <span class="name">_u</span> <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> be placeholders.</p>
 <p>
   <span class="conditional">IF</span> <span class="name">wasDerivedFrom(_id; e2,e1,_a,_g,_u,[prov:type='prov:Revision'])</span>, <span class="conditional">THEN</span> <span class="name">alternateOf(e2,e1)</span>.  
 </p>
@@ -3003,14 +3003,14 @@
   </li>
  <li>
     <span class="conditional">IF</span> <span class="name">wasDerivedFrom(id;  e2, e1, <span class="delete">a, g, u,</span><span class="insert">_a, _g, _u,</span> attrs)</span> <span class="conditional">THEN</span> <span class="name">wasInfluencedBy(id;  e2, e1, attrs)</span>.  Here,
-  <span class="name"><span class="delete">a</span><span class="insert">_a</span></span>, <span class="name"><span class="delete">g</span><span class="insert">_g</span></span>, <span class="name"><span class="delete">u</span><span class="insert">_u</span></span> <em class="rfc2119" title="may">may</em> be placeholders <span class="name">-</span>.
+  <span class="name"><span class="delete">a</span><span class="insert">_a</span></span>, <span class="name"><span class="delete">g</span><span class="insert">_g</span></span>, <span class="name"><span class="delete">u</span> <span class="delete">may</span><span class="insert">_u</span></span> <em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> be placeholders <span class="name">-</span>.
   </li>
 <li>
     <span class="conditional">IF</span> <span class="name">wasAttributedTo(id; e,ag,attrs)</span> <span class="conditional">THEN</span> <span class="name">wasInfluencedBy(id; e, ag, attrs)</span>.
   </li>
   <li>
     <span class="conditional">IF</span> <span class="name">wasAssociatedWith(id; a,ag,_pl,attrs)</span> <span class="conditional">THEN</span> <span class="name">wasInfluencedBy(id;  a, ag, attrs)</span>.  Here,
-  <span class="name">_pl</span> <em class="rfc2119" title="may">may</em> be a placeholder <span class="name">-</span>.
+  <span class="name">_pl</span> <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> be a placeholder <span class="name">-</span>.
   </li>
   <li>
     <span class="conditional">IF</span> <span class="name">actedOnBehalfOf(id; ag2,ag1,_a,attrs)</span> <span class="conditional">THEN</span> <span class="name">wasInfluencedBy(id;  ag2, ag1, attrs)</span>.
@@ -3245,7 +3245,7 @@
 <p>
 </p><hr>
 
-  <p id="key-object_text">The various identified objects of PROV <em class="rfc2119" title="must">must</em> have
+  <p id="key-object_text">The various identified objects of PROV <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> have
   unique statements describing them within a valid PROV instance.
   This is enforced through
   the following key constraints:
@@ -3395,7 +3395,7 @@
 
 
 
- <p id="unique-startTime_text">An <a href="#dfn-start-event" class="internalDFN">activity start event</a> is the <a title="instantaneous event" href="#dfn-event" class="internalDFN">instantaneous event</a> that marks the instant an activity starts. It allows for an optional time attribute.  <span id="optional-start-time">Activities also allow for an optional start time attribute.  If both are specified, they <em class="rfc2119" title="must">must</em> be the same, as expressed by the following constraint.</span>
+ <p id="unique-startTime_text">An <a href="#dfn-start-event" class="internalDFN">activity start event</a> is the <a title="instantaneous event" href="#dfn-event" class="internalDFN">instantaneous event</a> that marks the instant an activity starts. It allows for an optional time attribute.  <span id="optional-start-time">Activities also allow for an optional start time attribute.  If both are specified, they <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> be the same, as expressed by the following constraint.</span>
 </p>
 
 <div class="constraint" id="unique-startTime"><div class="ruleTitle"><a id="28"></a><a class="internalDFN" href="#unique-startTime">Constraint 28 (unique-startTime)</a></div>
@@ -3405,7 +3405,7 @@
 
 <hr>
 
-<p id="unique-endTime_text">An <a href="#dfn-end-event" class="internalDFN">activity end event</a> is the <a title="instantaneous event" href="#dfn-event" class="internalDFN">instantaneous event</a> that marks the instant an activity ends. It allows for an optional time attribute.  <span id="optional-end-time">Activities also allow for an optional end time attribute.  If both are specified, they <em class="rfc2119" title="must">must</em> be the same, as expressed by the following constraint.</span>
+<p id="unique-endTime_text">An <a href="#dfn-end-event" class="internalDFN">activity end event</a> is the <a title="instantaneous event" href="#dfn-event" class="internalDFN">instantaneous event</a> that marks the instant an activity ends. It allows for an optional time attribute.  <span id="optional-end-time">Activities also allow for an optional end time attribute.  If both are specified, they <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> be the same, as expressed by the following constraint.</span>
 </p>
 
 <div class="constraint" id="unique-endTime"><div class="ruleTitle"><a id="29"></a><a class="internalDFN" href="#unique-endTime">Constraint 29 (unique-endTime)</a></div>
@@ -3430,7 +3430,7 @@
 
 
 <p>Given that provenance consists of a description of past entities
-and activities, <a href="#dfn-valid" class="internalDFN">valid</a> provenance instances <em class="rfc2119" title="must">must</em>
+and activities, <a href="#dfn-valid" class="internalDFN">valid</a> provenance instances <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em>
 satisfy <em>ordering constraints</em> between instantaneous events, which are introduced in
 this section.  For instance, an entity can only be used after it was
 generated; in other words, an entity's <a title="entity generation
@@ -3472,9 +3472,9 @@
 (e.g. different time zones) leading to apparent inconsistencies.  For
 the purpose of checking ordering constraints, the times associated
 with events are irrelevant; thus, there is no inference that time ordering
-implies event ordering, or vice versa.  However, an application <em class="rfc2119" title="may">may</em> flag time values
+implies event ordering, or vice versa.  However, an application <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> flag time values
 that appear inconsistent with the event ordering as possible
-inconsistencies.  When generating provenance, an application <em class="rfc2119" title="should">should</em>
+inconsistencies.  When generating provenance, an application <span class="delete">should</span><em class="rfc2119" title="SHOULD"><span class="insert">SHOULD</span></em>
 use a consistent timeline for related PROV statements within an
 instance.</p>
 
@@ -3845,7 +3845,7 @@
 
 <div class="constraint" id="derivation-usage-generation-ordering"><div class="ruleTitle"><a id="41"></a><a class="internalDFN" href="#derivation-usage-generation-ordering">Constraint 41 (derivation-usage-generation-ordering)</a></div>
   <p>
-  In this constraint, <span class="name">_a</span>, <span class="name">gen2</span>, <span class="name">use1</span> <em class="rfc2119" title="must not">must not</em> be placeholders.</p>
+  In this constraint, <span class="name">_a</span>, <span class="name">gen2</span>, <span class="name">use1</span> <span class="delete">must not</span><em class="rfc2119" title="MUST NOT"><span class="insert">MUST NOT</span></em> be placeholders.</p>
 <p>
       <span class="conditional">IF</span>
 <span class="name">wasDerivedFrom(_d; _e2,_e1,_a,gen2,use1,_attrs)</span> 
@@ -3865,7 +3865,7 @@
 
 <div class="constraint" id="derivation-generation-generation-ordering"><div class="ruleTitle"><a id="42"></a><a class="internalDFN" href="#derivation-generation-generation-ordering">Constraint 42 (derivation-generation-generation-ordering)</a></div>
   <p>
-In this constraint, any of <span class="name">_a</span>, <span class="name">_g</span>, <span class="name">_u</span> <em class="rfc2119" title="may">may</em> be placeholders.</p>
+In this constraint, any of <span class="name">_a</span>, <span class="name">_g</span>, <span class="name">_u</span> <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> be placeholders.</p>
 <p>
  <span class="conditional">IF</span>
 <span class="name">wasDerivedFrom(_d; e2,e1,_a,_g,_u,attrs)</span>
@@ -4024,15 +4024,15 @@
 
 <p id="wasAssociatedWith-ordering_text">An activity that was
 associated with an agent must have some overlap with the agent. The
-agent <em class="rfc2119" title="must">must</em> have been generated (or started), or <em class="rfc2119" title="must">must</em> have become
-associated with the activity, after the activity start: so, the agent <em class="rfc2119" title="must">must</em> exist before the activity end. Likewise, the agent may be destructed (or ended), or may terminate its association with the activity, before the activity end: hence, the agent invalidation (or end) is required to happen after the activity start.
+agent <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> have been generated (or started), or <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> have become
+associated with the activity, after the activity start: so, the agent <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> exist before the activity end. Likewise, the agent may be destructed (or ended), or may terminate its association with the activity, before the activity end: hence, the agent invalidation (or end) is required to happen after the activity start.
 This is illustrated by <a href="#ordering-agents">Figure 6</a> (a) and  expressed by <a class="rule-ref" href="#wasAssociatedWith-ordering"><span>Constraint 47 (wasAssociatedWith-ordering)</span></a>.</p>
 
 
 
 <div class="constraint" id="wasAssociatedWith-ordering"><div class="ruleTitle"><a id="47"></a><a class="internalDFN" href="#wasAssociatedWith-ordering">Constraint 47 (wasAssociatedWith-ordering)</a></div>
   <p>
-In the following inferences, <span class="name">_pl</span> <em class="rfc2119" title="may">may</em> be
+In the following inferences, <span class="name">_pl</span> <span class="delete">may</span><em class="rfc2119" title="MAY"><span class="insert">MAY</span></em> be
  a placeholder <span class="name">-</span>.
   </p><ol>    <li>
     <span class="conditional">IF</span>
@@ -4097,7 +4097,7 @@
 
 </p><hr>
 
-<p id="wasAttributedTo-ordering_text">An agent to which an entity was attributed, <em class="rfc2119" title="must">must</em> exist before this entity was generated.
+<p id="wasAttributedTo-ordering_text">An agent to which an entity was attributed, <span class="delete">must</span><em class="rfc2119" title="MUST"><span class="insert">MUST</span></em> exist before this entity was generated.
 This is
 illustrated by <a href="#ordering-agents">Figure 6</a> (b) and  expressed by  <a class="rule-ref" href="#wasAttributedTo-ordering"><span>Constraint 48 (wasAttributedTo-ordering)</span></a>.</p>
 
@@ -4288,7 +4288,7 @@
 <span class="name">'entity' ∈ typeOf(e2)</span> AND
 <span class="name">'entity' ∈ typeOf(e1)</span> AND
 <span class="name">'activity' ∈ typeOf(a)</span>.
-   In this constraint, <span class="name">a</span>, <span class="name">g2</span>, and <span class="name">u1</span> <em class="rfc2119" title="must not">must not</em> be placeholders.
+   In this constraint, <span class="name">a</span>, <span class="name">g2</span>, and <span class="name">u1</span> <span class="delete">must not</span><em class="rfc2119" title="MUST NOT"><span class="insert">MUST NOT</span></em> be placeholders.
 
 </li><li>
 <span class="conditional">IF</span> 
@@ -4312,7 +4312,7 @@
 <span class="name">'activity' ∈ typeOf(a)</span> AND
 <span class="name">'agent' ∈ typeOf(ag)</span> AND
 <span class="name">'entity' ∈ typeOf(pl)</span>.  In this
-constraint, <span class="name">pl</span> <em class="rfc2119" title="must not">must not</em> be a placeholder.
+constraint, <span class="name">pl</span> <span class="delete">must not</span><em class="rfc2119" title="MUST NOT"><span class="insert">MUST NOT</span></em> be a placeholder.
 
 </li><li>
 <span class="conditional">IF</span> 
@@ -4404,7 +4404,7 @@
     event without specifying the activity.</p>
 
         <div class="constraint" id="impossible-unspecified-derivation-generation-use"><div class="ruleTitle"><a id="51"></a><a class="internalDFN" href="#impossible-unspecified-derivation-generation-use">Constraint 51 (impossible-unspecified-derivation-generation-use)</a></div>
-<p> In the following rules, <span class="name">g</span> and <span class="name">u</span> <em class="rfc2119" title="must not">must not</em> be <span class="name">-</span>.</p>
+<p> In the following rules, <span class="name">g</span> and <span class="name">u</span> <span class="delete">must not</span><em class="rfc2119" title="MUST NOT"><span class="insert">MUST NOT</span></em> be <span class="name">-</span>.</p>
 	  <ol>
   <li> <span class="conditional">IF</span>
 	    <span class="name">wasDerivedFrom(_id;_e2,_e1,-,g,-,attrs)</span>
@@ -4699,7 +4699,7 @@
   normal form up to isomorphism [<cite><a class="bibref" href="#bib-DBCONSTRAINTS">DBCONSTRAINTS</a></cite>]). </li>
 </ul>
 
-<p> An application that processes PROV data <em class="rfc2119" title="should">should</em> handle
+<p> An application that processes PROV data <span class="delete">should</span><em class="rfc2119" title="SHOULD"><span class="insert">SHOULD</span></em> handle
 equivalent instances in the same way.  This guideline is necessarily
 imprecise because "in the same way" is application-specific.
 Common exceptions to this guideline