- From: Simon Reinhardt <simon.reinhardt@koeln.de>
- Date: Mon, 02 Nov 2009 12:18:07 +0100
- To: Dave Raggett <dsr@w3.org>
- CC: Toby Inkster <tai@g5n.co.uk>, Sandro Hawke <sandro@w3.org>, semantic-web@w3.org
Dave Raggett wrote: > On Mon, 2 Nov 2009, Simon Reinhardt wrote: > >> Toby Inkster wrote: >>> a) Tt would remove the restriction on subjects being literals. > > ... > >> But that doesn't work with >> >> "foo" ex:predicate "bar" . > > Doesn't that depend on the predicate, e.g. how about a predicate that is > true if the subject and object are both string literals and the subject > is shorter than the object. > > e.g. "a" ex:shorterThan "aaa" > > where such statements should be the result of an inference. Sure, or computed properties [1]. But my comment was more about the fact that Toby's idea of creating inverses for compatibility doesn't work when both sides are literals. Regards, Simon [1] http://esw.w3.org/topic/SPARQL/Extensions/Computed_Properties
Received on Monday, 2 November 2009 11:18:41 UTC