- From: Pat Hayes <phayes@ai.uwf.edu>
- Date: Wed, 24 Oct 2001 19:31:54 -0500
- To: "Geoff Chappell" <geoff@sover.net>
- Cc: www-rdf-logic@w3.org
>My understanding is that the triple can be thought of as defining a >particular arc in a graph. That nodes and arcs have identities (locations on >a page, position in memory, or whatever) and labels. That with the >restriction that no two nodes can have the same label, We may want to relax this slightly for literals; but otherwise, yes. > we can uniquely >identify a node by its label. That with the restriction that duplicate >triples can not exist, we can uniquely identify an arc by the nodes it >connects (in order) and the label on the arc. (Nodes, I guess, are asserted >into existence by their use in describing an arc?) > >Taking that view, I'd always envisioned that a nested or reified triple >would be shown on a graph as arcs originating or terminating on arcs (though >I don't know about the validity of that in graph-speak). It isn't good graph-speak, and it isn't correct RDF either, so don't think of it that way, I would suggest. Pat Hayes -- --------------------------------------------------------------------- IHMC (850)434 8903 home 40 South Alcaniz St. (850)202 4416 office Pensacola, FL 32501 (850)202 4440 fax phayes@ai.uwf.edu http://www.coginst.uwf.edu/~phayes
Received on Wednesday, 24 October 2001 20:32:02 UTC