--- a/model/prov-constraints.html Tue Feb 19 15:30:34 2013 +0000
+++ b/model/prov-constraints.html Tue Feb 19 15:39:53 2013 +0000
@@ -899,8 +899,8 @@
<p>The PROV Data Model, PROV-DM, is a conceptual data model for provenance, which is
realizable using different representations such as PROV-N and PROV-O.
-A <a>PROV instance</a> is a set of PROV statements.
-A <a>PROV document</a> is an instance
+A <dfn>PROV instance</dfn> is a set of PROV statements.
+A <dfn>PROV document</dfn> is an instance
together with zero or more <a title="bundle">bundles</a>, or named instances. For
example, a PROV document could be a .provn document, the result
of a query, a triple store containing PROV statements in RDF, etc.
@@ -1000,7 +1000,7 @@
</p>
<p><a href="#normalization-validity-equivalence">Section 7</a> defines the notions
-of <a title="valid">validity</a>, <a>equivalence</a> and <a title="normal form">normalization</a>.
+of <a title="valid">validity</a>, <a title="equivalent">equivalence</a> and <a title="normal form">normalization</a>.
</p>
@@ -1046,7 +1046,7 @@
<p>
An entity is a thing one wants to provide provenance for
and whose situation in the world is described by some fixed
-attributes. An entity has a <dfn id="lifetime">lifetime</dfn>,
+attributes. An entity has a <dfn>lifetime</dfn>,
defined as the period
between its <a title="entity generation event">generation event</a>
and its <a title="entity invalidation event">invalidation event</a>.
@@ -1861,7 +1861,7 @@
<p>PROV documents can contain multiple instances: a <a>toplevel
instance</a>, and
-zero or more additional, named instances called <a>bundle</a>s. For the purpose
+zero or more additional, named instances called <a title="bundle">bundles</a>. For the purpose
of inference and constraint checking, these instances are treated independently. That is,
a PROV document is valid provided that each instance in it is valid
and the names of its bundles are distinct. In other words, there are
@@ -2055,13 +2055,13 @@
<td>No specific constraints</td>
</tr>
<tr class="component2-color">
- <td><a class="essential">Influence</a></td>
+ <td class="essential">Influence</td>
<td>No specific constraints</td>
</tr>
<tr><td style="border-width: 0px; "></td><td style="border-width: 0px; "></td><td style="border-width: 0px; "></td></tr>
<tr class="component3-color" style="border-collapse: collapse; ">
- <td class="essential"><a>Agent</a></td>
+ <td class="essential">Agent</td>
<td><a class="rule-text" href="#key-object"><span>TBD</span></a><br>
<a class="rule-text" href="#impossible-object-property-overlap"><span>TBD</span></a><br>
</td>
@@ -2242,7 +2242,7 @@
- <p> A <dfn id="term">PROV term</dfn> is a constant identifier
+ <p> A <dfn title="term">PROV term</dfn> is a constant identifier
<span class="math">c</span>, a placeholder <span
class="name">-</span>, a literal value,
or an existential variable <span class="math">x</span>. An
@@ -2291,7 +2291,7 @@
statements in <span class="math">I</span>.
</p>
- <p> <dfn id="unification">Unification</dfn> is an operation that can be applied
+ <p> <dfn title="unification">Unification</dfn> is an operation that can be applied
to a pair of terms.
The result of unification is either a <dfn>unifier</dfn>, that is, a substitution <span class="math">S</span> such that <span class="math">S(t)
= S(t')</span>, or failure, indicating
@@ -2345,7 +2345,7 @@
<h2>Definitions and Inferences</h2>
<p>
This section describes <a title="definition">definitions</a> and <a title="inference">inferences</a> that MAY be used on
- provenance data, and that preserve <a>equivalence</a> on <a>valid</a>
+ provenance data, and that preserve <a title="equivalent">equivalence</a> on <a>valid</a>
PROV instances (as detailed in <a href="#normalization-validity-equivalence" class="sectionRef"></a>).
A <dfn>definition</dfn> is a rule that can be applied to
PROV instances to replace defined statements with other statements. An <dfn id="inference">inference</dfn> is a rule that can be applied
@@ -2457,7 +2457,7 @@
explain how to expand the compact forms of PROV-N notation into a
normal form. <a class="rule-ref"
href="#optional-placeholders"><span>TBD</span></a> indicates when
- other optional parameters can be replaced by <a>existential
+ other optional parameters can be replaced by <a title="existential variable">existential
variables</a>.
</p>
@@ -3439,7 +3439,7 @@
enforced through <a>merging</a> pairs of statements subject to
equalities. For example, suppose we have two activity statements
<span class="name">activity(a,2011-11-16T16:00:00,_t1,[a=1])</span> and <span
- class="name">activity(a,_t2,2011-11-16T18:00:00,[b=2])</span>, with existential variables <span class="name">_t1</span> and <span class="name">_t2</span>. The <a>merge</a> of
+ class="name">activity(a,_t2,2011-11-16T18:00:00,[b=2])</span>, with existential variables <span class="name">_t1</span> and <span class="name">_t2</span>. The <dfn>merge</dfn> of
these two statements (describing the same activity <span
class="name">a</span>) is <span
class="name">activity(a,2011-11-16T16:00:00,2011-11-16T18:00:00,[a=1,b=2])</span>. </p>
@@ -5075,7 +5075,7 @@
-<p> Two <a>valid</a> PROV instances are <dfn id="equivalence">equivalent</dfn> if they
+<p> Two <a>valid</a> PROV instances are <dfn title="equivalent">equivalent</dfn> if they
have <a>isomorphic</a> normal forms. That is, after applying all possible inference
rules, the two instances produce the same set of PROV statements,
up to reordering of statements and attributes within attribute lists,
@@ -5142,7 +5142,7 @@
the resulting notions of normalization, validity and equivalence,
work on a single PROV instance. In this
section, we describe how to deal with general PROV
-documents, possibly including multiple named <dfn id="bundle">bundles</a> as well as a
+documents, possibly including multiple named <dfn title="bundle">bundles</a> as well as a
<dfn>toplevel instance</dfn>. Briefly, each bundle is
handled independently; there is no interaction between bundles from
the perspective of applying definitions, inferences, or constraints,