|
parid0369
| Sat, 01 Mar 2003 16:30:41
If there are any built-in assertions, the built-in property values
that correspond to their arcs must be defined, and their built-in
a-nodes and c-nodes must be provided with built-in values for their
subject identity discrimination properties (SIDPs) such that the merging
of the built-in assertions in conformance with the assertion merging
rules specified in parid0374 5.2.8.2 will occur. The definitions of the
properties that have built-in values in the built-in nodes defined by
the TM Application must be such that, when topic map graphs governed by
the TM Application are constructed, any assertions that are implicit in
the built-in property values will be unambiguously recognized, so that
they can be represented explicitly in the graph.
If there are any predefined assertions, then property values that
correspond to their arcs must be defined, and their a-nodes and c-nodes
must be provided with values for their subject identity discrimination
properties (SIDPs) such that the merging of the predefined assertions in
conformance with the assertion merging rules specified in parid0374
5.2.8.2 will occur.
As re-written, second sentence is explanatory and therefore redundant. Note that I removed built-in from various places where it is already implied from having a predefined assertion. Since an assertion has required components and values, does it not stand to reason that to predefine an assertion also means those properties and values are also predefined? |