pubrules
authorLuc Moreau <l.moreau@ecs.soton.ac.uk>
Thu, 26 Jan 2012 21:50:59 +0000
changeset 1431 09d7c01b3c5b
parent 1430 c3a3334fe169
child 1432 6b971d5cf61b
pubrules
model/ProvenanceModel.html
--- a/model/ProvenanceModel.html	Thu Jan 26 21:44:21 2012 +0000
+++ b/model/ProvenanceModel.html	Thu Jan 26 21:50:59 2012 +0000
@@ -1491,7 +1491,7 @@
 </pre>
 </div>
 
-<p/>
+<p></p>
 <div class="interpretation-forward">
 For the interpretation of a generation record, see <a href="#generation-within-activity">generation-within-activity</a>.
 </div>
@@ -1509,7 +1509,7 @@
 </div> 
 -->
 
-<p/>
+<p></p>
 <div class="structural-forward">
 See <a href="#generation-uniqueness">generation-uniqueness</a> for a structural constraint on generation records.
 </div>
@@ -2166,7 +2166,7 @@
 <span class="name">wasDerivedFrom(e2,e1,attrs)</span> and <span class="name">wasGeneratedBy(e2,t)</span>.
 </div>
 
-<p/>
+<p></p>
 <div class="structural-forward">
 See <a href="#derivation-use">derivation-use</a> for a structural constraint on derivation records.
 </div>
@@ -2716,7 +2716,7 @@
 <h4>Attribute</h4>
 
 <p>An <dfn id="dfn-attribute">attribute</dfn> is a <em>qualified name</em>. 
-An <dfn id="dfn-qualified name">qualified name</dfn> is a name subject to namespace interpretation. It consists of namespace, denoted by an optional prefix, and a local name. The namespace
+An <dfn id="dfn-qualified-name">qualified name</dfn> is a name subject to namespace interpretation. It consists of namespace, denoted by an optional prefix, and a local name. The namespace
 is denoted by an IRI [[!IRI]].</p>
 
 
@@ -2799,11 +2799,11 @@
 </div>
  </li>
 
-<li> The attribute <dfn id="dfn-label"><span class="name">prov:label</span></dfn> provides a human-readable representation of a PROV-DM element or relation.</li>
+<li> The attribute <dfn id="dfn-label"><span class="name">prov:label</span></dfn> provides a human-readable representation of a PROV-DM element or relation.
 
 <div class='issue'>
  This is <a href="http://www.w3.org/2011/prov/track/issues/219">ISSUE-219</a>. </div>
-
+</li>
 
 </ul>
 </section>
@@ -3528,23 +3528,23 @@
 <div class="note">Given the specific nature of the derivation, the intervening activity that accounts for imprecise-1 derivation should have an equally specific type, such as"
 collection-insertion" and "collection-rmoval". This is left for a future version.</div>
 
-The intent of these relations and entity types is to capture the <em>history of changes that occurred to a collection</em>. <p/>
-
-The following examples illustrate how these assertions are expected to be used in practice.
+<p>The intent of these relations and entity types is to capture the <em>history of changes that occurred to a collection</em>. </p>
+
+<p>The following examples illustrate how these assertions are expected to be used in practice.</p>
 
 <div class="anexample">
 <pre class="codeexample">
-   <span class="name">entity(c, [prov:type="EmptyCollection"])</span>    // <span class="name">e</span> is an empty collection
-   <span class="name">entity(k1).
-   <span class="name">entity(v1).
-   <span class="name">entity(k2).
-   <span class="name">entity(v2).
-   <span class="name">entity(c1, [prov:type="Collection"]).</span>
-   <span class="name">entity(c2, [prov:type="Collection"]).</span>
+   entity(c, [prov:type="EmptyCollection"])    // e is an empty collection
+   entity(k1)
+   entity(v1)
+   entity(k2)
+   entity(v2)
+   entity(c1, [prov:type="Collection"])
+   entity(c2, [prov:type="Collection"])
   
-  <span class="name">CollectionAfterInsertion(c1, c, k1, v1) </span>      // c1 = { (k1,v1) }
-  <span class="name">CollectionAfterInsertion(c2, c1, k2, v2) </span>     // c2 = { (k1,v1), (k2 v2) }
-  <span class="name">CollectionAfterRemoval(c3, c2, k1) </span>           // c3 = { (k2,v2) }
+  CollectionAfterInsertion(c1, c, k1, v1)       // c1 = { (k1,v1) }
+  CollectionAfterInsertion(c2, c1, k2, v2)      // c2 = { (k1,v1), (k2 v2) }
+  CollectionAfterRemoval(c3, c2, k1)            // c3 = { (k2,v2) }
 </pre>
 </div>
 
@@ -3563,20 +3563,20 @@
 
 <div class="anexample">
 <pre class="codeexample">
-  <span class="name">entity(c, [prov:type="EmptyCollection"])</span>    // <span class="name">e</span> is an empty collection
-  <span class="name">entity(k1).
-  <span class="name">entity(v1).
-  <span class="name">entity(k2).
-  <span class="name">entity(v2).
-  <span class="name">entity(k3).
-  <span class="name">entity(v3).
-  <span class="name">entity(c1, [prov:type="Collection"]).</span>
-  <span class="name">entity(c2, [prov:type="Collection"]).</span>
-  <span class="name">entity(c3, [prov:type="Collection"]).</span>
+  entity(c, [prov:type="EmptyCollection"])    // e is an empty collection
+  entity(k1)
+  entity(v1)
+  entity(k2)
+  entity(v2)
+  entity(k3)
+  entity(v3)
+  entity(c1, [prov:type="Collection"])
+  entity(c2, [prov:type="Collection"])
+  entity(c3, [prov:type="Collection"])
   
-  <span class="name">CollectionAfterInsertion(c1, c, k1, v1) </span>      // c1 = { (k1,v1) }
-  <span class="name">CollectionAfterInsertion(c2, c, k2, v2) </span>      // c2 = { (k2 v2) }
-  <span class="name">CollectionAfterInsertion(c3, c1, k3,v3) </span>      // c3 = { (k1,v1),  (k3,v3) }
+  CollectionAfterInsertion(c1, c, k1, v1)       // c1 = { (k1,v1) }
+  CollectionAfterInsertion(c2, c, k2, v2)       // c2 = { (k2 v2) }
+  CollectionAfterInsertion(c3, c1, k3,v3)       // c3 = { (k1,v1),  (k3,v3) }
 </pre>
 </div>
 </li>
@@ -3586,14 +3586,14 @@
 <span class="name">CollectionAfterInsertion(c, c1, k1, v1)</span><br/>
 <span class="name">CollectionAfterInsertion(c, c2, k2, v2)</span><br/>
 
-one can infer: <span class="name">c1==c2, k1==k2, v1==v2</span>, because one cannot have two different derivations for the same final collection state.<p/>
+one can infer: <span class="name">c1==c2, k1==k2, v1==v2</span>, because one cannot have two different derivations for the same final collection state.</li>
 
 <li>The following set of insertions:<br/>
 
 <span class="name">CollectionAfterInsertion(c1, c, k, v1)</span><br/>
 <span class="name">CollectionAfterInsertion(c1, c, k, v2)</span><br/>
 
-entails  <span class="name">v1==v2</span>.<p/>
+entails  <span class="name">v1==v2</span>.</li>
 
 
 <li> The state of a collection is only known to the extent that a chain of derivations starting from an empty collection can be found. It is understood that a set of assertions regarding a collection's evolution may be incomplete, and therefore so is the reconstructed state obtained by querying those assertions. In general, all assertions reflect the asserter's partial knowledge of a sequence of data transformation events. In the particular case of collection evolution, in which the asserter  <em>knows</em> that some of the state changes may have been missed, then the more generic <span class="name">wasDerivedFrom</span> relation should be used to signal that some updates may have occurred, which cannot be precisely asserted as insertions or removals. The following two examples illustrate this.
@@ -3740,8 +3740,10 @@
 line precedes the event denoted by the right line.</p>
 
 <div style="text-align: center;">
+<figure>
 <img src="constraints.png" alt="constraints between events" />
 <figcaption id="constraint-summary">Summary of <a title="event">instantaneous event</a> ordering constraints</figcaption>
+</figure>
 </div>
 
 
@@ -3866,7 +3868,7 @@
 <p>An agent that started an activity must exist when the activity starts.
 This is
 illustrated by Subfigure <a href="#constraint-summary2">constraint-summary2</a> (a) and  expressed by constraint <a href="#wasStartedByAgent-ordering">wasStartedByAgent-ordering</a>.</p>
-</p>
+
 
 <div class='interpretation' id='wasStartedByAgent-ordering'>
 Given an activity denoted by <span class="name">a</span> and an agent denoted by   <span class="name">ag</span>, <span class='conditional'>if</span> the record <span
@@ -3881,7 +3883,7 @@
 <p>An activity that was associated with an agent must have some overlap with the agent. The agent may be generated, or may only become associated with the activity, after its start: so, the agent is required to exist before the activity end. Likewise, the agent may be destructed, or may terminate its association with the activity, before the activity end: hence, the agent destruction is required to happen after the activity start.
 This is
 illustrated by Subfigure <a href="#constraint-summary2">constraint-summary2</a> (b) and  expressed by constraint <a href="#wasAssociatedWith-ordering">wasAssociatedWith-ordering</a>.</p>
-</p>
+
 
 <div class='interpretation' id='wasAssociatedWith-ordering'>
 Given an activity denoted by <span class="name">a</span> and an agent denoted by   <span class="name">ag</span>, <span class='conditional'>if</span> the record <span