- From: Tim Berners-Lee <timbl@w3.org>
- Date: Sat, 21 Dec 2002 21:46:01 -0500
- To: Graham Klyne <GK@NineByNine.org>
- Cc: www-archive+n3bugs@w3.org, Dan <connolly@w3.org>
The error message you got in [1] (without looking at the code at all)
is that
it was trying to output a list, and found two values stored as the
first of the list.
In fact this should not be an error, one simple should conclude that
the two things are equivalent.
The earlier problem which indirectly led to that was that it isn't
concluding
a bnode from a bnode - its making up a spurious node id. I've put it
into the
suite, but not fixed ityet...
Tim
On Thursday, Dec 19, 2002, at 16:41 US/Eastern, Graham Klyne wrote:
> [I sent this to RDF-IG, then DanC mentioned this route for Cwm reports
> - #g]
>
> I've been experimenting with "recursive" rules in Cwm, and get some
> unexpected results:
>
> [1] http://www.ninebynine.org/SWAD-E/Intro.html#CwmRulesExperiments
>
> My test file is:
> http://www.ninebynine.org/SWAD-E/Scenario-HomeNetwork/PlayRules.n3
>
> Which essentially reduces to this test case:
>
> [[
> {
> ?A rule:append ( [ daml:first ?H ; daml:rest ?T ] ?T1 ) .
> }
> log:implies
> {
> ?A daml:first ?H ;
> daml:rest [ rule:append ( ?T ?T1 ) ] .
> } .
>
> :A1 rule:append ( ( "L11" "L12" "L13" ) "L14" ) .
> ]]
>
> #g
>
>
> -------------------
> Graham Klyne
> <GK@NineByNine.org>
>
> -------------------
> Graham Klyne
> <GK@NineByNine.org>
Received on Sunday, 22 December 2002 14:39:40 UTC