[sc34wg3] node demanders, node type, path, R, reified

[Patrick Durusau]

REF: parid2176

TXT: Syntactic constructs (or other formal and addressable information 
objects) that appear in representations of topic maps. The existence of 
such an addressable object in a representation of a specific topic map 
is regarded as "demanding" the existence of a corresponding node in any 
topic map graph that is constructed on the basis of such a 
representation. The purpose of identifying the node demanders that can 
be found in instances of (for example) a topic map interchange syntax is 
to allow, effectively, the subjects of the nodes that they "demand" to 
be addressed in terms that will be honored by independent 
implementations. When a specification for a topic map interchange syntax 
includes a specification of its node demanders, topic map authors can 
create assertions whose role players are the topics specified by topic 
maps expressed in that syntax, with the expectation that implementation 
of that syntax specification will behave predictably.

FIX: An information object in a specific topic map that requires its 
representation as a node in a topic map graph.
 
COM: The foregoing catches the gist of this paragraph, sans the 
explanation of the how "node demanders" compell compliance by other 
implemenations. Seems like a lot of overhead to say that if nodes in a 
specific topic map are not treated by an independent implementation as 
specified in the original topic map that the results will be different 
from that of the orginal topic map. Trivial to say that if an 
independent implementation does not honor the roles defined by a topic 
map, that the behavior will vary from the original topic map.
 
END:


REF: parid2285

TXT: node type

FIX: Strike.
 
COM: Repetition.
 
END:


REF: parid2179

TXT: One of the six types of nodes defined by this standard:

FIX: Strike.
 
COM: Repetition.
 
END:


REF: parid2286

TXT: i-node: ("Isolated node") A generic node that is not a role player 
in any assertion.

FIX: Strike.
 
COM: Repetiton.
 
END:


REF: parid2287

TXT: x-node: A generic node that is a role player in at least one assertion.

FIX: Strike.
 
COM: Repetition.
 
END:


REF: parid2288

TXT: a-node: ("Assertion node") A special node that serves as the nexus 
of an assertion.

FIX: Strike.
 
COM: Repetiton.
 
END:


REF: parid2289

TXT: c-node: ("Casting node") A special node whose subject is the 
playing of a role in an assertion.

FIX: Strike.
 
COM: Repetition.
 
END:


REF: parid2290

TXT: r-node: ("Role node") A special node whose subject is a role that 
may be played in one or more assertions.

FIX: Strike.
 
COM: Repetition.
 
END:


REF: parid2291

TXT: t-node: ("assertion Type node") A special node whose subject is the 
type of one or more assertions.

FIX: Strike.
 
COM: Repetition.
 
END:


REF: parid2267

TXT: (So-called "special" node types have special, non-role-player 
functions within assertions; they are parts of the machinery of 
assertions. (Nonetheless, they can also be role players in other 
assertions.) So-called "generic" node types have no special function 
within the machinery of assertions.)

FIX: Strike.
 
COM: Repetition.
 
END:


REF: parid2188

TXT: An itinerary of arcs and intervening nodes through a topic map 
graph, by means of which traversal can be made from one node (node n[0]) 
to another (node n[n]). Given node n[0], the path to node n[n] is a 
finite alternating sequence n[0], arc[1], n[1], arc[2], n[3]... n[n] 
such that each arc[i] in the sequence connects node[i-1] and node[i].)
FIX: An alternating sequence of nodes and edges, representing continuous 
traversal (with no repetition of nodes or edges) from node[0] to node[n].
 
COM: Simplified.
 
END:


REF: parid2293

TXT: As in "R-node": role. The subject of every r-node is a role that 
can be played in one or more assertions.

FIX: Used in "'R' endpoint," "CR arc," "RC arc" as a synonym for r-node. 
See, r-node.
 
COM: Neeless repetition of the r-node definition and only part of that.
 
END:


REF: parid2191

TXT: As in "CR" arc: role. The node that serves as the R endpoint of a 
CR arc is an r-node.

FIX: Strike.
 
COM: Combined in re-wording of parid2293
 
END:


REF: parid2194

TXT: Provided with a proxy. A topic map author reifies (literally, 
thing-ifies) a subject by creating a proxy for that subject. The reason 
for reifying a subject is to make it, in effect, addressable. Computers 
cannot address subjects (such as the subject which is the notion of 
love), but they can address certain kinds of proxies for subjects (such 
as a <topic> element whose subject is love, or a node in a topic map 
graph whose subject is love). Things that can be addressed can be 
processed, collated, merged, rendered, etc.

FIX: Represented by a proxy, such as a node in the topic map graph or a 
topic in a topic map.
 
COM: Eliminate from definition the rhetoric for how computers can 
address a subject.
 
END:


REF: parid2268

TXT: For example, the marriage between John Smith and Mary Jones Smith 
is a relationship that cannot be addressed by a computer. However, an 
assertion that reifies that relationship is addressable, and therefore 
it is possible for that assertion to play roles in other assertions 
that, in effect, can make statements about the marriage of John and Mary.

FIX: Strike.
 
COM: Examples are inappropriate in the definition. If included at all, 
should be note to the definition.
 
END:


-- 
Patrick Durusau
Director of Research and Development
Society of Biblical Literature
pdurusau@emory.edu
Co-Editor, ISO Reference Model for Topic Maps