- From: Enrico Franconi <franconi@inf.unibz.it>
- Date: Thu, 15 Jul 2004 20:39:24 +0200
- To: RDF Data Access Working Group <public-rdf-dawg@w3.org>
On 15 Jul 2004, at 20:30, Jim Hendler wrote: > We would aim for the opposite - ease in design and implementation, as > opposed to guarantee of efficient computation (which, given the > expressivity of RDF we provably could not gaurantee without putting > new restrictions on the RDF graphs) Jim, can you better explain this statement on RDF? I thought everything is worst case polynomial in RDF(S). cheers --e. Enrico Franconi - franconi@inf.unibz.it Free University of Bozen-Bolzano - http://www.inf.unibz.it/~franconi/ Faculty of Computer Science - Phone: (+39) 0471-016-120 I-39100 Bozen-Bolzano BZ, Italy - Fax: (+39) 0471-016-129
Received on Thursday, 15 July 2004 14:40:00 UTC