>As Brian has already demonstrated, the XOR aggregator is not >sufficient >even for case (a). The immediately evident problem here is >that (X XOR Y >XOR Y) == X, for all Y. So how about using simple addition, >modulo 2^n, as >an aggregator? > There is a small subtlety here. An RDF model is a set of statements. Sets have no duplicates, so no statement can appear twice. Cancellation is therefore less of a risk. Brian>Received on Tuesday, 2 May 2000 09:26:00 GMT
This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:51:43 GMT