- From: <jos.deroo.jd@belgium.agfa.com>
- Date: Fri, 2 Feb 2001 17:19:58 +0100
- To: " - *De_Roo, Jos" <jos.deroo.jd@belgium.agfa.com>
- Cc: " - *swag-dev@yahoogroups.com" <swag-dev@yahoogroups.com>, " - *www-rdf-interest@w3.org" <www-rdf-interest@w3.org>, " - *sean@mysterylights.com" <sean@mysterylights.com>
> > I have made one really useful generic filter, that works out equivalence:-
> > @prefix log: <http://www.w3.org/2000/10/swap/log.n3#> .
> > @prefix daml: <http://www.daml.org/2000/10/daml-ont#> .
> > <> log:forAll <#x> , <#y> , <#p> , <#q> .
> > { <#q> daml:equivalentTo <#p> . <#x> <#p> <#y> . }
> > log:implies
> > { <#x> <#q> <#y> .} .
> > - http://infomesh.net/swag/n3/hackings/bmwdeeleyf.n3
> >
> > But I'd appreciate more thoughts, ideas, and stuff to parse. It's hard
> > thinking up useful and quick examples.
> My initial thinking was to implement = as two times log:implies
> like in http://www.agfa.com/w3c/euler/equiv.axiom.n3
> but I have to think about your proposal ...
... have done that, but from an implementation perspective it was much, much
simpler: just a hashtable of synonym->synonymobject and appropriate lookups
and synonymobject compares (which is even quicker than string compares)
So thank you to let me have thought!
--
Jos
Received on Friday, 2 February 2001 11:21:12 UTC