balbinus: It's crschmidt's homepage. It's logical there's nothing to see ;)
balbinus: Was kidding.
balbinus: Was kidding.
sh1mmer: A paper by Phil Tetlow of IBM, published in the Alphawork IBM journal
sh1mmer: "This paper investigates the use of Semantic Web technologies as a means of reducing ambiguity in the design and implementation of automatic solutions for addressing complexity at a number of points in the Software Life Cycle."
sh1mmer: Phil uses the handle ptetlow on #rdfig
sh1mmer: "This paper investigates the use of Semantic Web technologies as a means of reducing ambiguity in the design and implementation of automatic solutions for addressing complexity at a number of points in the Software Life Cycle."
sh1mmer: Phil uses the handle ptetlow on #rdfig
sbp: I'm thinking about this from a point of view of isomorphism, and I have to say that I'm becoming more and more convinced that this is "elegant" rather than a "hack". That is, it's a nasty hack for canonicalisation for digsig, but potentially elegant for isomorphism.
sbp: You can have the API produce hashes/digests of the graph quite easily this way by virtually adding those extra triples. At first I was worried about adding data to people's graphs, but then I realised that for isomorphism, you don't need to keep them!
sbp: A stuffing-data-into-bNode-labels approach might, on the other hand, be better for canonicalisation of serialised graphs. See #rdfig logs for more details and discussion.