- From: Jos De_Roo <jos.deroo@agfa.com>
- Date: Tue, 4 May 2004 22:50:27 +0200
- To: "Dan Connolly <connolly" <connolly@w3.org>
- Cc: RDF Data Access Working Group <public-rdf-dawg@w3.org>, public-rdf-dawg-request@w3.org, Rob Shearer <Rob.Shearer@networkinference.com>
[...] >> in fact it >> codifies that any such extension is explicitly illegal. Queries along >> the lines of "must these two nodes be related via either of these two >> properties?" suddenly become impossible to answer when that answer is >> derived via inference, or rules, or some higher-level semantic language. > > I don't understand how you come to that conclusion. Neither do I... I would simply ask the following RDF/N3 kind of query (<graph>).da:from da:select {?N1 <p1> ?N2}, {?N1 <p2> ?N2}. and when getting a nonempty graph the answer is "true" as simple as that! -- Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/
Received on Tuesday, 4 May 2004 16:51:15 UTC