On 8 Apr 2009, at 16:01, Axel Polleres wrote: > > 1) USING RULESET is closely related to the OWL inference discussed > yesterday, but simpler. Instead of specifying an entailment regime > for one of the OWL dialects, the idea is to allow a very pragmatic > reference to a ruleset specifying a finite set of RDF inference > rules being expected to be evaluated on the query. The suggestion > here is to be able to either refer to some fixed rulesets which we > endorse with some public identifier, e.g. I get very nervous whenever anyone (including me) says thing X is simpler than thing Y. Simplicity is largely dependent on context and background. From my p.o.v. the OWL inference thing discussed yesterday is a very straightforward concept (though probably difficult to implement), whereas this is significantly more complex. The stuff around FROM NAMED is particularly concerning, and affects general inference on the language. I think that's worth a separate discussion on it's own. - Steve -- Steve Harris Garlik Limited, 2 Sheen Road, Richmond, TW9 1AE, UK +44(0)20 8973 2465 http://www.garlik.com/ Registered in England and Wales 535 7233 VAT # 849 0517 11 Registered office: Thames House, Portsmouth Road, Esher, Surrey, KT10 9ADReceived on Thursday, 9 April 2009 09:50:30 UTC
This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 17:00:54 UTC