John, Pavithra, Doug et al, (01)
A DAG is the normal, prototypical situation of databases then. That
constraint means that there is an ordering of the <relation>s on one axis
and the <person/object/thing>s on another which would look like a
topographic map of a square of land. Specifically, the ordering of
<relation>s by identifier associated with the temporal arrival sequence of
the relation references in a <text/ontology/dictionary/lexicon> in ascending
order by arrival, mapped against an ordering of <person/object/thing>s in
ascending order of their own arrival. This is the structure of a single
pass analysis from beginning to end of the model. (02)
Is that intuition correct? I.e., a topographically level or sloping model
of two <property/attribute/column>s in the value plane is ALWAYS REALIZABLE
given the axes are ordered by arrival sequence in ascending order from the
start (origin) of the <text/ontology/dictionary/lexicon> being scanned in
one pass? (03)
Queriously,
-Rich (04)
Sincerely,
Rich Cooper
EnglishLogicKernel.com
Rich AT EnglishLogicKernel DOT com
9 4 9 \ 5 2 5 - 5 7 1 2 (05)
-----Original Message-----
From: ontolog-forum-bounces@xxxxxxxxxxxxxxxx
[mailto:ontolog-forum-bounces@xxxxxxxxxxxxxxxx] On Behalf Of John F. Sowa
Sent: Sunday, October 17, 2010 8:30 PM
To: ontolog-forum@xxxxxxxxxxxxxxxx
Subject: Re: [ontolog-forum] Interpreting OWL (06)
On 10/17/2010 10:59 PM, doug foxvog wrote:
> It seems to me that the graph would have many disconnected subgraphs,
> and certainly not be a single tree. (07)
Yes. Technically, it would be a forest. (08)
> The unusual case would be when there was a loop. This could happen if
> a professor were to go for another PhD after a number of years, and
> have as a thesis advisor in the new field a former student or even
> student of a student. (09)
Yes. (010)
On 10/17/2010 11:20 PM, Rich Cooper wrote:
> Is there any looser constraint, or must the graph be a DAG at all to be
> fully distinguishable<persons/objects/things> among the paths? (011)
If all relations are symmetric, the graph would not be directed.
But most relations are not symmetric. (012)
John (013)
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Config Subscr: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/
To join: http://ontolog.cim3.net/cgi-bin/wiki.pl?WikiHomePage#nid1J
To Post: mailto:ontolog-forum@xxxxxxxxxxxxxxxx (014)
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Config Subscr: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/
To join: http://ontolog.cim3.net/cgi-bin/wiki.pl?WikiHomePage#nid1J
To Post: mailto:ontolog-forum@xxxxxxxxxxxxxxxx (015)
|