- From: Graham Klyne <GK@ninebynine.org>
- Date: Mon, 08 Sep 2003 11:18:28 +0100
- To: James Michael DuPont <mdupont777@yahoo.com>, www-rdf-interest@w3.org
I tried to do something vaguely similar a while ago, which seemed to
require recursively-defined rules. Unfortunately, CWM choked on these, and
I came to the conclusion that what I wanted to do was not possible using
CWM, though it's possible that things have changed since, so I've now gone
off on a very different tack.
Some notes of my experiments are here:
http://www.ninebynine.org/SWAD-E/Intro.html#CwmRulesExperiments
#g
--
At 00:26 08/09/03 -0700, James Michael DuPont wrote:
>Dear Rdf Interested,
>
>Can you please help think about this problem :
>
>I would like to transform a set of triples that form an a-cyclic graph,
>a tree even from this notation :
>
>_:foo <#rel> _:bar .
>_:bar <#rel> _:baz .
>
>Into this notation :
>
>_:foo <#rel> [ <#id> _:bar; <#rel> _:baz ].
>
>The problem is that i would also like to copy the attributes :
>_:bar <#attr> "FooBar" .
>as well
>to make
>_:foo <#rel> [ <#id> _:bar; <#rel> _:baz; <#attr> "FooBar" ].
>
>The rules I have tried are :
>
>{
> ?X ?P ?Y.
>}
>=>
>{
>?X ?P
> [
> :id ?Y.
> ]
>}.
>
>But the produces lots on anonymous [id: <#blah>] objects that are not
>connected.
>
>Is it possible to restore such a tree structure back in the [ a :tree;
>:branch [ a :branch]] notation using cwm?
>
>if so how can this be done? If not, does anyone else need this feature?
>
>thanks
>
>mike
>
>
>
>=====
>James Michael DuPont
>http://introspector.sourceforge.net/
>
>__________________________________
>Do you Yahoo!?
>Yahoo! SiteBuilder - Free, easy-to-use web site design software
>http://sitebuilder.yahoo.com
------------
Graham Klyne
GK@NineByNine.org
Received on Monday, 8 September 2003 06:50:27 UTC