- From: <jos.deroo@agfa.com>
- Date: Sat, 16 Sep 2006 02:25:21 +0200
- To: frankmccabe@mac.com
- Cc: public-rif-wg@w3.org
Frank, sure, but what I meant is findall(T,+G,-L) [ISO] Unifies L with a list that contains all the instantiations of the term T satisfying the goal G kind regards, Jos > Jos: > Do you mean findall, or bagof, or setof? > These have very different run-time characteristics > Frank > > On Sep 15, 2006, at 4:44 PM, jos.deroo@agfa.com wrote: > >> >> In writing Prolog I make a lot of use of findall >> and in N3 I found it useful as >> >> e:findall >> rdfs:comment >> """?SCOPE e:findall (?SELECT ?WHERE ?ANSWER). >> unifies ?ANSWER with a list that contains all the >> instantiations of ?SELECT satisfying the ?WHERE >> clause in the ?SCOPE of all asserted n3 formulae >> and their log:conclusion"""; >> a rdf:Property; >> rdfs:domain log:Formula; >> rdfs:range rdf:List. >> >> I mean useful for 2 reasons >> 1/ it is a way to have a simple SPARQL condition >> 2/ it is a way to have a SNAF condition when used as >> ?SCOPE e:findall (?SELECT ?WHERE rdf:nil). >> >> There is a test case result at >> http://eulersharp.sourceforge.net/2006/02swap/medicE.n3 >> >> -- >> Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/ -- Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/
Received on Saturday, 16 September 2006 00:25:36 UTC