- From: Phil Archer <phil.archer@talis.com>
- Date: Thu, 09 Dec 2010 14:13:03 +0000
- To: Bob Ferris <zazi@elbklang.net>
- CC: Semantic Web <semantic-web@w3.org>
Bob, I don't know if this helps you any, but POWDER allows you to make assertions about multiple subjects as defined by their URI. In other words, you could use it to say "any URI matching /pattern/ should be processed according to rule A" Phil. On 09/12/2010 13:53, William Waites wrote: > * [2010-12-09 14:36:23 +0100] Bob Ferris<zazi@elbklang.net> écrit: > > ] As I think the need for assigning specific rules to Semantic Web > ] ontologies/RDF graphs to enable intented inferences is getting more and > ] more important, we need possibilities to semantically related these > ] rules to Semantic Web ontologies/RDF graphs. > > Hi Bob, I had some thoughts about this same topic from a parallel > track -- namely how basic statistics about graphs or rdf datasets > (e.g. their size) depend on the rules, and if we want to compare some > size-independent property of two graphs we need to normalise such a > statistic with the size of the graph. > > In the context of statistics, the consensus in the void-impl > discussion seems to be that they would hang somewhere in the > definitions of dimensions used in an SDMX dataset. > > For what you are describing where the ruleset(s) are intended to be > necessary to interpreting a graph or dataset (i.e. not > dataset-independent) I would imagine that they might live somewhere in > a voiD description of it. Just a thought, not certain this is the > correct approach -- i.e. when is a graph a dataset? How might rules > be inherited in datasets that contain multiple graphs? > > Cheers, > -w -- Phil Archer Talis Systems Web: http://www.talis.com Twitter: philarcher1 LinkedIn: http://uk.linkedin.com/in/philarcher Personal: http://philarcher.org
Received on Thursday, 9 December 2010 14:13:41 UTC