Re: [Eulermoz-developers] We have a doubt

[<jos...@ag...>]

Oops.. forgot this one..

the interpretation of P =3D> C is
"C is provable"
the interpretation of P is
"P is provable" (but P could be
expressed as A =3D> P)


--=20
Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/




naudts guido <naudts=5Fv...@ya...>
Sent by: eul...@li...
20/10/2004 13:24

=20
        To:     ant...@pt..., eulermoz developers=20
<eul...@li...>
        cc:     (bcc: Jos De=5FRoo/AMDUS/MOR/Agfa-NV/BE/BAYER)
        Subject:        Re: [Eulermoz-developers] We have a doubt


Hallo,
I want to add something concerning "embedded rules".
E.g.
{{:a :b :c}=3D>{:d :e :f}} =3D> {:g :h :i}.
In Lambda-Prolog these rules are treated as follows:
the system adds {:a :b :c} to the axiom list as a
temporary axiom. Then the system tries to proof {:d :e
:f} i.e. this triple becomes a query(goal). If {:d :e
:f} is proved then {:g :h :i} is considered being
proved also ( =3D having value true). The temporary
axiom {:a :b :c} is deleted from the axioms list.
CWM apparently does not do this.
I did not implement this in RDFEngine because I do not
consider it to be very usefull. It is however 'valid'
N3. Jos uses this format for his proof formats.
I don't know what interpretation Euler gives to the
rule mentioned higher.
Greetings, Guido.
--- "antonio.lopez" <ant...@pt...> wrote:

> Hello all.
>
> Sorry Jos last two messages were meant to be sent to
> the list, it wasn't
> private at all :(
> I re-send them just to keep track.
>
> 1=BA)    The question about how parser should
> interpret this N3
> expression, what  the set of triples generated by
> the parser should be.
> Whether this triples are just :s :p :o
> or  {} implies parser has to reify them.
>
> 2=BA)    Yes , we were not sure but it looked like.
> But as we tell you before our test cases will be
> yours and this is taken
> from :
>
>
http://cvs.sourceforge.net/viewcvs.py/eulersharp/2004/02swap/testCases/gedc=
om-relations.n3?rev=3D1.1&view=3Dauto
>
>
>
> line 75.
>
>
>
>
>
-------------------------------------------------------
> This SF.net email is sponsored by: IT Product Guide
> on ITManagersJournal
> Use IT products in your business? Tell us what you
> think of them. Give us
> Your Opinions, Get Free ThinkGeek Gift Certificates!
> Click to find out more
>
http://productguide.itmanagersjournal.com/guidepromo.tmpl
> =5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=
=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F
> Eulermoz-developers mailing list
> Eul...@li...
>
https://lists.sourceforge.net/lists/listinfo/eulermoz-developers
>




=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=
=5F=5F=5F=5F=5F=5F
Do you Yahoo!?
Declare Yourself - Register online to vote today!
http://vote.yahoo.com


-------------------------------------------------------
This SF.net email is sponsored by: IT Product Guide on ITManagersJournal
Use IT products in your business? Tell us what you think of them. Give us
Your Opinions, Get Free ThinkGeek Gift Certificates! Click to find out=20
more
http://productguide.itmanagersjournal.com/guidepromo.tmpl
=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=
=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F=5F
Eulermoz-developers mailing list
Eul...@li...
https://lists.sourceforge.net/lists/listinfo/eulermoz-developers