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

the query answer can always be an RDF graph

From: Jos De_Roo <jos.deroo@agfa.com>
Date: Tue, 28 Sep 2004 21:06:11 +0200
To: public-rdf-dawg@w3.org
Message-ID: <OF3509AC35.9DCDEAFA-ONC1256F1D.00662D0B-C1256F1D.0068EFE4@agfa.com>

The principal task of the RDF Data Access Working Group is to
gather requirements and to define an HTTP and/or SOAP-based
protocol for selecting instances of subgraphs from an RDF graph.

was a very motivating charter sentence for me to join this group
and was also a reason why I abstained in the "bindings" vote.

Since then I learned to live with it...
Having list comprehension axioms (one can assume the existence
of rdf lists containing all kinds of rdf resources) one can as
such augment the given graphs with list triples and still have
just "selecting instances of subgraphs from an RDF graph" e.g.
(:a :b :c) a q:Answer.
where it is assumed that q:Answer rdfs:subClassOf rdf:List.
Using lists is also quite compact using rdf/n3 ( ) or RDF/XML

The point I wanted to make is that the query answer can always
be an RDF graph.

Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/
Received on Tuesday, 28 September 2004 19:06:48 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 15:00:45 UTC