- From: Richard Cyganiak <richard@cyganiak.de>
- Date: Wed, 2 Mar 2011 19:35:01 +0000
- To: Reto Bachmann-Gmür <reto.bachmann@trialox.org>
- Cc: Jirí Procházka <ojirio@gmail.com>, Pat Hayes <phayes@ihmc.us>, William Waites <ww@styx.org>, nathan@webr3.org, Ivan Shmakov <oneingray@gmail.com>, semantic-web@w3.org
Reto, On 2 Mar 2011, at 18:50, Reto Bachmann-Gmür wrote: > > Is there any practical difference between bnodes and normal nodes, > > except the scope (and necessity) of their name? > > Yes, a graph with bnodes can potentially be simplified: the same meaning may be expressed with a more lean graph, i.e. with less nodes and triples. If all your nodes are uris you cannot do simplifications with rdf entaillment. Reality check please! When was the last time you saw such a non-lean RDF graph in the wild, outside of examples and test cases? Can you name a production system that routinely performs the simplification you talk about, with user benefit? The question was about practice. You describe a thought experiment. I think it's a good example of a complication in RDF that was added for sound theoretical reasons, but has failed to deliver any value whatsoever in practice. Best, Richard > > Cheers, > Reto > > > > > Best, > > Jiri > > > > > Pat > > > > > > > > > > > Richard > > > > > > > > > > > > > > > > > > Cheers, > > > > > -w > > > > > -- > > > > > William Waites <mailto:ww@styx.org> > > > > > http://river.styx.org/ww/ ; <sip:ww@styx.org> > > > > > F4B3 39BF E775 CF42 0BAB 3DF0 BE40 A6DF B06F FD45 > > > > > > > > > > > > > > > > > > > ------------------------------------------------------------ > > > IHMC (850)434 8903 or (650)494 > > > 3973 40 South Alcaniz St. (850)202 4416 office > > > Pensacola (850)202 4440 fax > > > FL 32502 (850)291 0667 mobile > > > phayesAT-SIGNihmc.us http://www.ihmc.us/users/phayes > > > > > > > > > > > > > > > > > > > > > >
Received on Wednesday, 2 March 2011 19:35:50 UTC