dm minor edits
authorLuc Moreau <l.moreau@ecs.soton.ac.uk>
Mon, 28 May 2012 11:12:14 +0100
changeset 3000 d4fb807bc96e
parent 2999 9f8a8092a157
child 3001 f633498932b6
dm minor edits
model/prov-dm.html
--- a/model/prov-dm.html	Mon May 28 11:09:10 2012 +0100
+++ b/model/prov-dm.html	Mon May 28 11:12:14 2012 +0100
@@ -2634,8 +2634,8 @@
 <section id="component6"> 
 <h3>Component 6: Collections</h3>
 
-<p>The fifth component of PROV-DM is concerned with the notion of collections. 
-A collection is an entity that has some members. The members are themselves entities, and therefore their provenance can be expressed. Some applications need to be able to express the provenance of the collection  itself: e.g. who maintains the collection, which members it contains as it evolves, and how it was assembled. The purpose of Component 5 is to define the types and relations that are useful to express the provenance of collections. In PROV, the concept of Collection is implemented by means of dictionaries, which we introduce in this section. </p>
+<p>The sixth component of PROV-DM is concerned with the notion of collections. 
+A collection is an entity that has some members. The members are themselves entities, and therefore their provenance can be expressed. Some applications need to be able to express the provenance of the collection  itself: e.g. who maintains the collection, which members it contains as it evolves, and how it was assembled. The purpose of Component 6 is to define the types and relations that are useful to express the provenance of collections. In PROV, the concept of Collection is implemented by means of dictionaries, which we introduce in this section. </p>
 
 <p><a href="#figure-component6">Figure 10</a> depicts
 the sixth component with three new classes (Collection, Dictionary, and Pair) and three associations (insertion, removal, and memberOf).
@@ -2652,9 +2652,9 @@
 </div>
 
 
-<p>The intent of these relations and types is to express the <em>history of changes that occurred to a collection</em>. 
-Changes to collections are about the insertion of entities in collections and the removal of members from collections.
-Indirectly, such history provides a way to reconstruct the contents of a collection.</p>
+<p>The intent of these relations and types is to express the <em>history of changes that occurred to a dictionary</em>. 
+Changes to dictionaries are about the insertion of entities in dictionaries and the removal of members from dictionaries.
+Indirectly, such history provides a way to reconstruct the contents of a dictionary.</p>
 
 <section id="term-collection">
 <h3>Collection</h3>
@@ -2669,12 +2669,12 @@
 <h3>Dictionary</h3>
 
 
-<p>PROV-DM defines a specific type of collection: a dictionary, specified as follows.</p>
+<p>PROV-DM defines a specific type of collection, a dictionary, specified as follows.</p>
 
 
 <span class="glossary-ref" data-ref="glossary-dictionary"></span>
 
-<p>Conceptually, a dictionary has a logical structure consisting of key-entity pairs. This structure is often referred to as a <em>map</em>, and is a generic indexing mechanism that can abstract commonly used data structures, including associative lists (also known as "dictionaries" in some programming languages), relational tables, ordered lists, and more. The specification of such specialized structures in terms of key-value pairs is out of the scope of this document.</p>
+<p>Conceptually, a dictionary has a logical structure consisting of key-entity pairs. This structure is often referred to as a <em>map</em>, and is a generic indexing mechanism that can abstract commonly used data structures, including associative lists, relational tables, ordered lists, and more. The specification of such specialized structures in terms of key-value pairs is out of the scope of this document.</p>
 
 <p>A given dictionary forms a given structure for its members.  A different structure (obtained either by insertion or removal of members) constitutes a different dictionary. Hence,
  for the purpose of provenance, a dictionary entity is viewed as a snapshot of a structure. Insertion and removal operations result in new snapshots, each snapshot forming an identifiable dictionary entity.  It is also useful to describe a dictionary as empty.</p>
@@ -2845,7 +2845,7 @@
 <span class="glossary-ref" data-ref="glossary-membership"></span>
 
 <p>
-The insertion and removal  relations make insertions and removals explicit as part of the history of a dictionary. This, however, requires explicit mention of the state of the dictionary prior to each operation. The membership relation removes this need, allowing the state of a dictionary <span class="name">c</span> to be expressed without having to introduce a prior state.</p>
+The insertion and removal  relations make insertions and removals explicit as part of the history of a dictionary. This, however, requires explicit mention of the state of the dictionary prior to each operation. The membership relation removes this need, allowing the state of a dictionary to be expressed without having to introduce a prior state.</p>
 
 <p>
 <div class="attributes" id="attributes-memberOf">
@@ -2910,8 +2910,9 @@
 
 <ul>
 
+<!--
 <li>The state of a dictionary (i.e., the set of key-entity pairs it contains) at a given point in a sequence of operations is never stated explicitly. Rather, it can be obtained by querying the chain of derivations involving insertions and removals. Entity type <span class="name">emptyDictionary</span> can be used in this context as it marks the start of a sequence of dictionary operations.</li>
-
+-->
 
 <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, are immutable and this applies  to those entities that represent dictionaries. This is reflected in the constraints listed in [[PROV-CONSTRAINTS]].  </li>
 </ul>
@@ -2937,8 +2938,8 @@
 <p>A <dfn id="dfn-namespaceDeclaration">namespace declaration</dfn> consists of a binding between a prefix and a namespace. Every qualified name with this prefix in the scope of this
 declaration refers to this namespace. </p>
 
-<p>A <dfn id="dfn-defaultNamespaceDeclaration">default namespace declaration</dfn> consists of a namespace. Every un-prefixed qualified name in the scope of this default namespace declaration
-refers to this namespace.</p>
+<p>A <dfn id="dfn-defaultNamespaceDeclaration">default namespace declaration</dfn> consists of a namespace. Every un-prefixed qualified name
+refers to default namespace declaration.</p>
 
 <p>The <dfn title="prov-namespace">PROV namespace</dfn> is identified by the URI <a href="http://www.w3.org/ns/prov#">http://www.w3.org/ns/prov#</a>.</p>