W3C home > Mailing lists > Public > public-rdf-dawg@w3.org > April to June 2004

testing disjunction

From: Jos De_Roo <jos.deroo@agfa.com>
Date: Sun, 2 May 2004 03:23:19 +0200
To: public-rdf-dawg@w3.org
Message-ID: <OFBF702556.A333FADD-ONC1256E88.0001D35B-C1256E88.000778D0@agfa.com>

Since our f2f meeting I am thinking about disjunction,
but thinking doesn't help enough and so I tried to do
some running code...
It's a simple example, but suppose we have
http://eulersharp.sourceforge.net/2004/04test/danP.n3
and want to know the latitude and longitude of
Cambridge or the latitude and longitude of Chicago
then we write the query in N3 as
http://eulersharp.sourceforge.net/2004/04test/danQ.n3
and are able to get the selected graph

_:98_1 d:cityName "Cambridge". 
_:98_1 d:latitude 42.3. 
_:98_1 d:longitude -71.1.

_:5478_4 d:cityName "Chicago". 
_:5478_4 d:latitude 41.9. 
_:5478_4 d:longitude -87.6. 


(the da:from and da:select in the query are actually
implemented like log:conjuction and log:implies and
the scope of the bnodes is within the {} graphs)


-- 
Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/
Received on Saturday, 1 May 2004 21:23:54 GMT

This archive was generated by hypermail 2.3.1 : Tuesday, 26 March 2013 16:15:19 GMT