 |
 |
On Tue, Dec 13, 2011 at 3:22 PM, Karen Coyle <[log in to unmask]> wrote: > Yes, I realize that you were asking Richard, but I'm a bit forward, as we > know. I do NOT see a description as atomic in the sense that a record is > atomic. A record has rigid walls, a description has permeable ones. A > description always has the POTENTIAL to have a bit of unexpected data > added; a record cuts off that possibility. > > That said, I am curious about the permeability of the edges of a named > graph. I don't know their degree of rigidity in terms of properties allowed. > Named graphs were supposed to be invariant under the original proposal; there is a lot of mess around the semantics right now. Dan Brickley wrote a very nice example : http://danbri.org/words/2011/11/03/753 . Simon