--- a/dictionary/prov-dictionary.html Tue Feb 05 10:44:50 2013 +0100
+++ b/dictionary/prov-dictionary.html Tue Feb 05 10:47:20 2013 +0100
@@ -796,7 +796,7 @@
This document provides a mechanism to assert the provenance for these types of data structures, in the most general way, as a collection of key-value pairs, modified through insertions and deletions. Any more specialized structures can be modeled to some extent in terms of these key-value pairs.
Here, we will discuss the provenance of dictionaries structured in terms of key-value pairs. However, how this key-value pair structure is translated to more specialized data structures, is beyond the scope of this document.</p>
-<p>For the purpose of provenance, a dictionary entity is viewed as a snapshot of a dictionary data structure, following a sequence of state-changing insertion and removal operations. These operations result in new snapshots, each snapshot forming an identifiable dictionary entity. Thus, when the structure of a dictionary changes (through insertions or removals), a new dictionary entity is defined, whereas the older dictionary entity remains the same.</p>
+<p>In this document, a dictionary is viewed as a snapshot of a data structure with key-value pairs, following a sequence of state-changing insertion and removal operations. These operations result in new snapshots, each snapshot forming an identifiable dictionary entity. Thus, when the structure of a dictionary changes (through insertions or removals), a new dictionary entity is defined, whereas the older dictionary entity remains the same.</p>
<!--
<span class="glossary-ref" data-ref="glossary-empty-dictionary"></span>
@@ -884,7 +884,7 @@
<p>
An Insertion relation <span class="name">derivedByInsertionFrom(id; d2, d1, {(key_1, e_1), ..., (key_n, e_n)})</span> states that <span class="name">d2</span> is the dictionary
following the insertion of pairs <span class="name">(key_1, e_1)</span>, ..., <span class="name">(key_n, e_n)</span> into dictionary <span class="name">d1</span>.
-Note that insertion is considered to be complete. This means that we assume that no unknown keys were inserted in or removed from a dictionary after an insertion. This is formalized in <a href="#insertion-removal-membership-inference">Inference D7</a>.</p>
+Note that insertion and the specified key-entity-set are considered to be complete. This means that we assume that no unknown keys were inserted in or removed from a dictionary after an insertion. This is formalized in <a href="#insertion-removal-membership-inference">Inference D7</a>.</p>
@@ -952,7 +952,7 @@
</div>
<p>A Removal relation <span class="name">derivedByRemovalFrom(id; d2,d1, {key_1, ..., key_n})</span> states that <span class="name">d2</span> is the dictionary following the removal of the set of pairs corresponding to keys <span class="name">key_1...key_n</span> from <span class="name">d1</span>. If a key that is not present in the dictionary is removed, the dictionary remains unchanged.
- Note that removal is considered to be complete. This means that we assume that no unknown keys were inserted in or removed from a dictionary after a removal. This is formalized in <a href="#insertion-removal-membership-inference">Inference D7</a>.
+ Note that removal and the specified key-set are considered to be complete. This means that we assume that no unknown keys were inserted in or removed from a dictionary after a removal. This is formalized in <a href="#insertion-removal-membership-inference">Inference D7</a>.
</p>
<div class="anexample">
@@ -984,13 +984,6 @@
</section> <!-- end removal -->
-
-<p>Further considerations: </p>
-
-<ul>
-<li>The representation of a dictionary through these relations makes no assumption regarding the underlying data structure used to store and manage dictionaries. In particular, no assumptions are needed regarding the mutability of a data structure that is subject to updates. Entities, however, have some fixed aspects and this applies to those entities that represent dictionaries. This is reflected in the constraints listed in [[PROV-CONSTRAINTS]]. </li>
-</ul>
-
</section> <!-- end conceptual definition dictionary -->
<section id="dictionary-notation">
@@ -1216,7 +1209,7 @@
<section id="dictionary-ontological-definition">
<h2>PROV-O Representation of Dictionary</h2>
-<p>In this section, the ontological definition of <code>prov:Dictionary</code> is given, in order to extend [[PROV-O]] with dictionaries. For more information on the terminology, syntax and conventions used in this section, we refer to [[PROV-O]]</p>
+<p>In this section, the ontological definition of <code>prov:Dictionary</code> is given, in order to extend [[PROV-O]] with dictionaries. For more information on the terminology, syntax and conventions used in this section, we refer to [[PROV-O]].</p>
<p>The classes and properties defined in this document will be included in the default namespace of PROV.
Users of the ontology have the option of importing <code><http://www.w3.org/ns/prov#></code>, which includes all extensions, including PROV-Dictionary, or if they wish to have only [[PROV-O]] terms, they can import <code><http://www.w3.org/ns/prov-o#></code>. Similarly, <code><http://www.w3.org/ns/prov-dictionary#></code> holds only the PROV-Dictionary terms.
The [<a href="https://dvcs.w3.org/hg/prov/raw-file/default/dictionary/prov-dictionary.owl">OWL file for PROV-Dictionary</a>] is available for download. (Note that this file is unfinished at the time of this working draft, and may be subject to change.)</p>