Re: tips on converting an open list to a closed collection?

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1


On Tuesday, Jun 24, 2003, at 17:48 US/Eastern, Sandro Hawke wrote:

>
>> Does anyone have any tips for writing n3 rules (cwm or euler) that can
>> convert an open collection (Bag, for instance) to a closed collection
>> (rdf:List)?
>>
>> I've been able to go from rdf:List -> rdf:Bag, but haven't figured out
>> how to do the other way.
>>
>> Any tips or hints would be greatly appreciated.
>
> Of course it requires extra information to do this, right?   You need
> to say
>
>    1.   here are a bunch of elements in list L, in order
>    2.   that's all there is.
>
> The "that" in line 2 is pretty hard to say; it needs to point to an
> RDF graph (aka N3 formula).  The predicate for this kind of explicit
> closed-world logic is log:notIncludes [1].  My sense is that what you
> want should be possible using it.  But maybe not -- after a couple
> minutes of thinking about it, I can't see how to do it.  So there's a
> hint, at least.  :-)    You might grep through the tests for
> notIncludes and see if what you want has already been done.   If not,
> and you figure it out, please pass it along.

Thanks for the tips, Sandro,

I agree, I'm not sure log:notIncludes helps me here.  I don't have the 
statements in their own graph, either.

I guess my first question, is if this type of operation is semantically 
legal?  I'm not interested in capturing any sort of order of the 
elements, which might help me out.

To me, the hard part of this has been finding out how to attach a 
rdf:nil at the end.

I'll keep truckin,
Seth

-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.1 (Darwin)

iD8DBQE++PZFNx3GJTf/82URAiRYAJ9P/FH+LwJFWV0sLzELj70KdvNvLgCghZTa
Im1GcnGtgwg153ftI2XwD+I=
=Nx2g
-----END PGP SIGNATURE-----

Received on Tuesday, 24 June 2003 21:09:32 UTC