Menu
▾
▴
eulermoz-developers — Internal mailing list for active developers
You can subscribe to this list here.
| 2004 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
(8) |
Sep
(13) |
Oct
(26) |
Nov
(3) |
Dec
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2005 |
Jan
(2) |
Feb
(3) |
Mar
(2) |
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
| 2011 |
Jan
|
Feb
|
Mar
|
Apr
|
May
(1) |
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
| 2012 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
(1) |
Jul
|
Aug
(2) |
Sep
(1) |
Oct
|
Nov
|
Dec
|
|
From: <alf...@ya...> - 2004-10-18 15:57:52
|
Hi,
trying to parse gedcom-relations.n3 I've come across a
never-heard-of symbol cluster my scanner has been
unable to deal with:
{{:person1 /= :person2} log:implies {:person1
ont:differentIndividualFrom :person2}} a log:Truth;
log:forAll :person1, :person2.
# rule added for N3Engine - G.Naudts
Does /= constitute standard n3? Where could we find
more information about it? What does it mean?
Cheers,
Alfred, 4Clerks
___________________________________________________________
Gesendet von Yahoo! Mail - Jetzt mit 100MB Speicher kostenlos - Hier anmelden: http://mail.yahoo.de
|
|
From: antonio.lopez <ant...@pt...> - 2004-10-15 09:25:19
|
Hello all.
After Jos detected some troubles within the javascript parser we
realized there were some more pitfail at our Java version.
So now we are trying to fixed them all. We are also testing against the
same test cases original Euler project does.
And hopefully soon we'll have a new stable and tested version out.
But we have a doubt, reading gedcom-proof.n3 we found starting at line
405 somethin like :
{{{:Greta gc:childIn :dp.
:Jos gc:childIn :dp.
:Greta ont:differentIndividualFrom :Jos} log:implies
{:Greta gc:sibling :Jos}} log:implies
{:Jos gc:sibling :Greta}.
So how would we have to understand variableless sentencies?
{:Jos gc:sibling :Greta}.
a) As reified statements
b) As normal statements
c) As both
Sorry about this crappy test, but N3 syntax appears to be more triky
than we thought.
Thanks, in advance.
|
|
From: naudts g. <nau...@ya...> - 2004-10-10 11:13:44
|
> Hello all,
> Forgot to mention that I replaced my anti-looping
> mechanism of RDFEngine with that that Jos used in
> the
> Tiny Prolog example. As my program is structured
> differently this will have to be tested thouroughly.
> For testing I would need the interface as defined
> which was my primary purpose in making this modules.
> However I am defining a module 'test' but I'll need
> somemore time.
> Greetings, uido.
> --- jos...@ag... wrote:
>
> > Hi, Guido
> >
> > function matching (ts, f, inf):
> > /* match a fact with the triple store
> > ts is the triplestore; f is the fact.
> > */
> > var list = [];
> > var res;
> > var nr;
> > var g;
> > for (var t in ts){
> > res = unifyTriples(f, t);
> > if (t.getType == "r"){
> > nr = t.nr;
> > // euler paths
> > g = 1;
> > while (g <
> goallist.length){
> > res =
> > unifyTriples(goallist[0],
> > goallist[g]);
> > if
> (goallist[g].pending
> > &&
> > goallist[g].fromRule == nr
> > &&
> res
> > != [])
> >
> break;
> > g++;
> > }
> > // if the path is looping (g <
> > goallist.length) do not add
> > this alternative
> > if (g >= goallist.length)
> > if (res != [])
> > list = list + [res];
> > }
> > return list;
> > }
> >
> > in RDFEngine.js is very nifty!
> > How is the best way to run it at this moment?
> > just wanted to do some testwork :)
> >
> > Thanks,
> > jos
> >
> > --
> > Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/
> >
> >
> >
> >
> > naudts guido <nau...@ya...>
> > 09/10/2004 12:23
> >
> >
> > To: Jos
> > De_Roo/AMDUS/MOR/Agfa-NV/BE/BAYER@AGFA
> > cc:
> > Subject: Fwd: inferencing scheme
> >
> >
> >
> > Note: forwarded message attached.
> >
> >
> >
> >
> > __________________________________
> > Do you Yahoo!?
> > Yahoo! Mail Address AutoComplete - You start. We
> > finish.
> > http://promotions.yahoo.com/new_mail
> > Received: from [82.174.69.7] by
> > web40526.mail.yahoo.com via HTTP; Sat, 09
> > Oct 2004 03:19:19 PDT
> > Date: Sat, 9 Oct 2004 03:19:19 -0700 (PDT)
> > From: naudts guido <nau...@ya...>
> > Subject: inferencing scheme
> > To: ant...@4c...
> > Cc: eulermoz_dev
> > <eul...@li...>
> > MIME-Version: 1.0
> > Content-Length: 8030
> > Content-Type: multipart/mixed;
> > boundary="0-806546331-1097317159=:34329"
> >
> > Hallo Antonio,
> > I promised quickly a scheme; I actually don't have
> a
> > scheme but program code. I include it in a
> zip-file.
> > The code has not been tested. I will do this next
> > week.
> > Excuse me if the Javascript looks somewhat weird,
> > I'm
> > not used to programming in Javascript.
> > I have included a file interface.txt that
> describes
> > all that is needed for interfacing to Mozilla. I
> > have
> > tried to keep it minimally.
> > Greetings, Guido
> >
> >
> >
> > _______________________________
> > Do you Yahoo!?
> > Declare Yourself - Register online to vote today!
> > http://vote.yahoo.com
> >
> >
> >
>
> > ATTACHMENT part 2 application/zip name=rdfinf.zip
>
>
>
>
>
> __________________________________
> Do you Yahoo!?
> Yahoo! Mail Address AutoComplete - You start. We
> finish.
> http://promotions.yahoo.com/new_mail
>
>
>
-------------------------------------------------------
> 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
> _______________________________________________
> Eulermoz-developers mailing list
> Eul...@li...
>
https://lists.sourceforge.net/lists/listinfo/eulermoz-developers
>
|
|
From: naudts g. <nau...@ya...> - 2004-10-10 10:48:17
|
Hello all,
Forgot to mention that I replaced my anti-looping
mechanism of RDFEngine with that that Jos used in the
Tiny Prolog example. As my program is structured
differently this will have to be tested thouroughly.
For testing I would need the interface as defined
which was my primary purpose in making this modules.
However I am defining a module 'test' but I'll need
somemore time.
Greetings, uido.
--- jos...@ag... wrote:
> Hi, Guido
>
> function matching (ts, f, inf):
> /* match a fact with the triple store
> ts is the triplestore; f is the fact.
> */
> var list = [];
> var res;
> var nr;
> var g;
> for (var t in ts){
> res = unifyTriples(f, t);
> if (t.getType == "r"){
> nr = t.nr;
> // euler paths
> g = 1;
> while (g < goallist.length){
> res =
> unifyTriples(goallist[0],
> goallist[g]);
> if (goallist[g].pending
> &&
> goallist[g].fromRule == nr
> && res
> != [])
> break;
> g++;
> }
> // if the path is looping (g <
> goallist.length) do not add
> this alternative
> if (g >= goallist.length)
> if (res != [])
> list = list + [res];
> }
> return list;
> }
>
> in RDFEngine.js is very nifty!
> How is the best way to run it at this moment?
> just wanted to do some testwork :)
>
> Thanks,
> jos
>
> --
> Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/
>
>
>
>
> naudts guido <nau...@ya...>
> 09/10/2004 12:23
>
>
> To: Jos
> De_Roo/AMDUS/MOR/Agfa-NV/BE/BAYER@AGFA
> cc:
> Subject: Fwd: inferencing scheme
>
>
>
> Note: forwarded message attached.
>
>
>
>
> __________________________________
> Do you Yahoo!?
> Yahoo! Mail Address AutoComplete - You start. We
> finish.
> http://promotions.yahoo.com/new_mail
> Received: from [82.174.69.7] by
> web40526.mail.yahoo.com via HTTP; Sat, 09
> Oct 2004 03:19:19 PDT
> Date: Sat, 9 Oct 2004 03:19:19 -0700 (PDT)
> From: naudts guido <nau...@ya...>
> Subject: inferencing scheme
> To: ant...@4c...
> Cc: eulermoz_dev
> <eul...@li...>
> MIME-Version: 1.0
> Content-Length: 8030
> Content-Type: multipart/mixed;
> boundary="0-806546331-1097317159=:34329"
>
> Hallo Antonio,
> I promised quickly a scheme; I actually don't have a
> scheme but program code. I include it in a zip-file.
> The code has not been tested. I will do this next
> week.
> Excuse me if the Javascript looks somewhat weird,
> I'm
> not used to programming in Javascript.
> I have included a file interface.txt that describes
> all that is needed for interfacing to Mozilla. I
> have
> tried to keep it minimally.
> Greetings, Guido
>
>
>
> _______________________________
> Do you Yahoo!?
> Declare Yourself - Register online to vote today!
> http://vote.yahoo.com
>
>
>
> ATTACHMENT part 2 application/zip name=rdfinf.zip
__________________________________
Do you Yahoo!?
Yahoo! Mail Address AutoComplete - You start. We finish.
http://promotions.yahoo.com/new_mail
|
|
From: <jos...@ag...> - 2004-10-09 14:51:31
|
Hi, Guido
function matching (ts, f, inf):
/* match a fact with the triple store
ts is the triplestore; f is the fact.
*/
var list = [];
var res;
var nr;
var g;
for (var t in ts){
res = unifyTriples(f, t);
if (t.getType == "r"){
nr = t.nr;
// euler paths
g = 1;
while (g < goallist.length){
res = unifyTriples(goallist[0],
goallist[g]);
if (goallist[g].pending &&
goallist[g].fromRule == nr
&& res != [])
break;
g++;
}
// if the path is looping (g < goallist.length) do not add
this alternative
if (g >= goallist.length)
if (res != [])
list = list + [res];
}
return list;
}
in RDFEngine.js is very nifty!
How is the best way to run it at this moment?
just wanted to do some testwork :)
Thanks,
jos
--
Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/
naudts guido <nau...@ya...>
09/10/2004 12:23
To: Jos De_Roo/AMDUS/MOR/Agfa-NV/BE/BAYER@AGFA
cc:
Subject: Fwd: inferencing scheme
Note: forwarded message attached.
__________________________________
Do you Yahoo!?
Yahoo! Mail Address AutoComplete - You start. We finish.
http://promotions.yahoo.com/new_mail
Received: from [82.174.69.7] by web40526.mail.yahoo.com via HTTP; Sat, 09
Oct 2004 03:19:19 PDT
Date: Sat, 9 Oct 2004 03:19:19 -0700 (PDT)
From: naudts guido <nau...@ya...>
Subject: inferencing scheme
To: ant...@4c...
Cc: eulermoz_dev <eul...@li...>
MIME-Version: 1.0
Content-Length: 8030
Content-Type: multipart/mixed; boundary="0-806546331-1097317159=:34329"
Hallo Antonio,
I promised quickly a scheme; I actually don't have a
scheme but program code. I include it in a zip-file.
The code has not been tested. I will do this next
week.
Excuse me if the Javascript looks somewhat weird, I'm
not used to programming in Javascript.
I have included a file interface.txt that describes
all that is needed for interfacing to Mozilla. I have
tried to keep it minimally.
Greetings, Guido
_______________________________
Do you Yahoo!?
Declare Yourself - Register online to vote today!
http://vote.yahoo.com
|
|
From: antonio.lopez <ant...@pt...> - 2004-10-09 14:16:22
|
Hallo Naudts, that's been quick enough man.
Still we are tring to fix some pitfail and make parser more stable.
Don't worry about weirdness, we'll ask you ;)
Thank you very much
Greetings
4cLerKs group.
naudts guido wrote:
>Hallo Antonio,
>I promised quickly a scheme; I actually don't have a
>scheme but program code. I include it in a zip-file.
>The code has not been tested. I will do this next
>week.
>Excuse me if the Javascript looks somewhat weird, I'm
>not used to programming in Javascript.
>I have included a file interface.txt that describes
>all that is needed for interfacing to Mozilla. I have
>tried to keep it minimally.
>Greetings, Guido
>
>
>
>_______________________________
>Do you Yahoo!?
>Declare Yourself - Register online to vote today!
>http://vote.yahoo.com
>
|
|
From: antonio.lopez <ant...@pt...> - 2004-10-08 20:52:35
|
You right Jos. We are working to fix it up. Any way next versi=F3n will test against all your test at=20 http://www.agfa.com/w3c/euler/ You'll hear about us soon. Hope so ;) Regards Antonio jos...@ag... wrote: >Hi, Antonio > >Parsing a file like >http://www.agfa.com/w3c/euler/authen.axiom.n3 >works OK I think, but one like >http://www.agfa.com/w3c/euler/deb.n3 >actually gives an error at the end of the javascript console > >Error: statement.getSubject() has no properties >Source File: http://localhost/emcvs/eulermoz/tests/n3/index.xul >Line: 133 > >any idea? > > >http://www.agfa.com/w3c/euler/rdfs-rules.n3 >actually gives 3 errors at the end > >Error: [MNG:ERROR] (21:47:26)=20 >Source File: CLERKZILLA Framework file (anonymous) >Line: 0 > >Error: [MNG:ERROR] (21:47:26)=20 >Source File: CLERKZILLA Framework file (anonymous) >Line: 0 > >Error: uncaught exception: Can't recover from previous error(s) > > =20 > |
|
From: <jos...@ag...> - 2004-10-08 19:51:15
|
Hi, Antonio Parsing a file like http://www.agfa.com/w3c/euler/authen.axiom.n3 works OK I think, but one like http://www.agfa.com/w3c/euler/deb.n3 actually gives an error at the end of the javascript console Error: statement.getSubject() has no properties Source File: http://localhost/emcvs/eulermoz/tests/n3/index.xul Line: 133 any idea? http://www.agfa.com/w3c/euler/rdfs-rules.n3 actually gives 3 errors at the end Error: [MNG:ERROR] (21:47:26) Source File: CLERKZILLA Framework file (anonymous) Line: 0 Error: [MNG:ERROR] (21:47:26) Source File: CLERKZILLA Framework file (anonymous) Line: 0 Error: uncaught exception: Can't recover from previous error(s) -- Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/ "antonio.lopez" <ant...@pt...> Sent by: eul...@li... 07/10/2004 23:41 Please respond to antonio.lopez To: eulermoz developers <eul...@li...> cc: (bcc: Jos De_Roo/AMDUS/MOR/Agfa-NV/BE/BAYER) Subject: [Eulermoz-developers] Fixing bugs Hello all. New parser commit whith the following changes: a) *rdf:List* are generated and sopported by a new api . b) We've also suppress redundant asserts. :) c) No idea how to avoid inconsistency Naudts pointed out. :( Test whenever you can the model rightness generated now, thank you very much in advance. Regards Antonio ------------------------------------------------------- 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 _______________________________________________ Eulermoz-developers mailing list Eul...@li... https://lists.sourceforge.net/lists/listinfo/eulermoz-developers |
|
From: antonio.lopez <ant...@pt...> - 2004-10-07 22:19:42
|
Sick, sorry Guido, forgive the ignorant of me. Thanks Jos, we try our best. Thans again both Guido and Jos :) Regards Antonio jos...@ag... wrote: >Antonio, that sounds very good! >Will be in Canada coming week and lots of work >but will try to test as much as I can :) >Just FYI, Naudts is the family name Guido first name :) > >kind regards and keep on going doing the good work, >jos > > > |
|
From: antonio.lopez <ant...@pt...> - 2004-10-07 21:38:36
|
Hello all. New parser commit whith the following changes: a) *rdf:List* are generated and sopported by a new api . b) We've also suppress redundant asserts. :) c) No idea how to avoid inconsistency Naudts pointed out. :( Test whenever you can the model rightness generated now, thank you very much in advance. Regards Antonio |
|
From: antonio.lopez <ant...@pt...> - 2004-10-06 11:29:58
|
It would be perfect Guido, yes thank you very much. Sorry about this crap explanation : We try to develop a GUI that reacts against changes whithin RDF models. What you normally do now is to react against changes whithin values keep somewhere a componet, see what has changed and react. But you react after some GUI event, and you have to code for each component a method. We want to avoid this mess, separating logic and visual events. And we need inference to react on a rule base mechanism instead of a programmatic one. Every time the RDF model changes we check rules and see whether or no we have to react, changing some GUI facet. At least thats the idea. naudts guido wrote: >Hello, >What is the intention for inferencing? >I could very quickly make a scheme how to implement an >engine in Javascript. Would that be interesting? >Greeting, Guido >--- "antonio.lopez" <ant...@pt...> wrote: > > > >>Hello all. >> >>We please to annouce N3 scanner a parser are >>commeted at sourceforge CVS >>repository. >>They are based on Java code generated by JFlex and >>Cup tools. >>No need to say it's beta software it needs more >>testing and we know >>parser generates redundant triples. >>But we haven't found any serious error, here is were >>we need your help, >>about the parser's correctness and how to implement >>Euler inference. >> >>Regards, Antonio >> >> >> >> >> >------------------------------------------------------- > > >>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 > > >>_______________________________________________ >>Eulermoz-developers mailing list >>Eul...@li... >> >> >> >https://lists.sourceforge.net/lists/listinfo/eulermoz-developers > > > > > > >__________________________________ >Do you Yahoo!? >Read only the mail you want - Yahoo! Mail SpamGuard. >http://promotions.yahoo.com/new_mail > > |
|
From: naudts g. <nau...@ya...> - 2004-10-06 09:51:38
|
Hello, What is the intention for inferencing? I could very quickly make a scheme how to implement an engine in Javascript. Would that be interesting? Greeting, Guido --- "antonio.lopez" <ant...@pt...> wrote: > Hello all. > > We please to annouce N3 scanner a parser are > commeted at sourceforge CVS > repository. > They are based on Java code generated by JFlex and > Cup tools. > No need to say it's beta software it needs more > testing and we know > parser generates redundant triples. > But we haven't found any serious error, here is were > we need your help, > about the parser's correctness and how to implement > Euler inference. > > Regards, Antonio > > > ------------------------------------------------------- > 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 > _______________________________________________ > Eulermoz-developers mailing list > Eul...@li... > https://lists.sourceforge.net/lists/listinfo/eulermoz-developers > __________________________________ Do you Yahoo!? Read only the mail you want - Yahoo! Mail SpamGuard. http://promotions.yahoo.com/new_mail |
|
From: antonio.lopez <ant...@pt...> - 2004-10-06 09:34:44
|
Hallo,
a)Jos
1)rdf:List
Yes we understand you Jos, you're right,=20
(http://www.w3.org/TR/rdf-schema/#ch_collectionvocab) rdf:List instead=20
of rdf:Seq is the correct coding. We're working to solve it.
2)js Euler, again you're right, it's really good and valuable, but=20
if we load facts as mozilla datasources, we got serious performance=20
troubles (we would like to apply rules to trigger user interface events)
Thanks Jos.
b)Naudts
Yes pretty clear inconsistency what you point out. We're not really=20
sure how to work it out, anyway we are thinking about.
Thanks Naudts
Thank you both.
Regards
Antonio
naudts guido wrote:
>Hallo,
>I suppose Jos means to encode as:
>:1 a RDF:List; RDF:first :2; RDF:rest :1a.
>:1a RDF:first :3; RDF:rest :1b.
>:1b RDF:first :4; RDF:rest RDF:nil.
>However then the nodes :1, :2, :1a, :3, :1b, :4 cannot
>oocur in any other triple as list elements; suppose
>you read a rule from another site:
>
>:1 a RDF:List; RDF:first :2; RDF:rest :1a.
>:1a RDF:first :3; RDF:rest RDF:nil.
>you obtain a clear inconsistency.=20
>Greetings, Guido.
>--- jos...@ag... wrote:
>
> =20
>
>>Hi, Antonio
>>
>>I've looked to your encoding of
>>eulermoz/tests/n3/example.n3
>>in RDF/XML (using eulermoz/tests/n3/index.xul) and
>>when one
>>transforms that back into N3 (which is more readable
>>to me :))
>>one gets
>>
>>
>> @prefix : <urn:clerk:anon#> .
>> @prefix NS3:
>><http://www.agfa.com/w3c/euler/authen.axiom#> .
>> @prefix NS4:
>><http://www.w3.org/2000/10/swap/log#> .
>> @prefix RDF:
>><http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
>>
>> <INSTITUTION> NS3:subscribed <MAILINGLIST>;
>> NS3:w3cmember <http://www.w3.org> .
>>
>> <PERSON> NS3:authenticated <MAILINGLIST>;
>> NS3:member <INSTITUTION> .
>>
>> <http://www.agfa.com> NS3:subscribed
>><mailto:w3c...@w3...>;
>> NS3:w3cmember <http://www.w3.org> .
>>
>> <mailto:jos...@ag...> NS3:member
>><http://www.agfa.com> .
>>
>> :1 a RDF:Seq;
>> RDF:_1 :2;
>> RDF:_2 :3;
>> RDF:_3 :4;
>> NS4:implies :5 .
>>
>> :2 a RDF:Statement;
>> RDF:object <INSTITUTION>;
>> RDF:predicate NS3:member;
>> RDF:subject <PERSON> .
>>
>> :3 a RDF:Statement;
>> RDF:object <http://www.w3.org>;
>> RDF:predicate NS3:w3cmember;
>> RDF:subject <INSTITUTION> .
>>
>> :4 a RDF:Statement;
>> RDF:object <MAILINGLIST>;
>> RDF:predicate NS3:subscribed;
>> RDF:subject <INSTITUTION> .
>>
>> :5 a RDF:Seq;
>> RDF:_1 :6 .
>>
>> :6 a RDF:Statement;
>> RDF:object <MAILINGLIST>;
>> RDF:predicate NS3:authenticated;
>> RDF:subject <PERSON> .
>>
>> :Rule0 a RDF:Seq;
>> RDF:_1 :1;
>> RDF:_2 :5;
>> NS4:forAll <INSTITUTION>,
>> <MAILINGLIST>,
>> <PERSON> .
>>
>>
>>and this is indeed an RDF graph.
>>The trouble however is that this entails for
>>instance something like
>>
>>
>> @prefix : <urn:clerk:anon#> .
>> @prefix NS3:
>><http://www.agfa.com/w3c/euler/authen.axiom#> .
>> @prefix NS4:
>><http://www.w3.org/2000/10/swap/log#> .
>> @prefix RDF:
>><http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
>>
>> <INSTITUTION> NS3:subscribed <MAILINGLIST>;
>> NS3:w3cmember <http://www.w3.org> .
>>
>> <PERSON> NS3:authenticated <MAILINGLIST>;
>> NS3:member <INSTITUTION> .
>>
>> <http://www.agfa.com> NS3:subscribed
>><mailto:w3c...@w3...>;
>> NS3:w3cmember <http://www.w3.org> .
>>
>> <mailto:jos...@ag...> NS3:member
>><http://www.agfa.com> .
>>
>> :1 a RDF:Seq;
>> RDF:_1 :2;
>> RDF:_3 :4;
>> NS4:implies :5 .
>>
>> :2 a RDF:Statement;
>> RDF:object <INSTITUTION>;
>> RDF:predicate NS3:member;
>> RDF:subject <PERSON> .
>>
>> :4 a RDF:Statement;
>> RDF:object <MAILINGLIST>;
>> RDF:predicate NS3:subscribed;
>> RDF:subject <INSTITUTION> .
>>
>> :5 a RDF:Seq;
>> RDF:_1 :6 .
>>
>> :6 a RDF:Statement;
>> RDF:object <MAILINGLIST>;
>> RDF:predicate NS3:authenticated;
>> RDF:subject <PERSON> .
>>
>> :Rule0 a RDF:Seq;
>> RDF:_1 :1;
>> RDF:_2 :5;
>> NS4:forAll <INSTITUTION>,
>> <MAILINGLIST>,
>> <PERSON> .
>>
>>
>>which is an encoding of
>>
>>
>>@prefix log: <http://www.w3.org/2000/10/swap/log#>.
>>@prefix rdfs:
>><http://www.w3.org/2000/01/rdf-schema#>.
>>@prefix rdf:
>><http://www.w3.org/1999/02/22-rdf-syntax-ns#>.
>>@prefix :
>><http://www.agfa.com/w3c/euler/authen.axiom#>.
>>
>><mailto:jos...@ag...> :member
>><http://www.agfa.com>.
>><http://www.agfa.com> :w3cmember
>><http://www.w3.org>.
>><http://www.agfa.com> :subscribed
>><mailto:w3c...@w3...>.
>>
>> {?PERSON :member ?INSTITUTION.
>> ?INSTITUTION :subscribed ?MAILINGLIST}
>> =3D>
>>{?PERSON :authenticated ?MAILINGLIST}.
>>
>>
>>which can be false (true premis and false
>>conclusion) and so
>>your encoding is inconsistent (one can derive a
>>falsehood).
>>
>>The only valid encoding I see right now is with RDF
>>lists
>>(as one can always make sure that RDF lists are
>>valid).
>>
>>Another point is that a premis and conclusion are
>>sets
>>of triples, but one could use eg:Set (subclass of
>>rdf:List).
>>
>>
>>kind regards,
>>jos
>>
>>--=20
>>Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/
>>
>>PS it should be the case that the euler path
>>inferencing is implemented in
>>
>> =20
>>
>http://cvs.sourceforge.net/viewcvs.py/eulermoz/eulermoz/tests/prolog/pro=
log.js?rev=3D1.5&view=3Dauto
> =20
>
>>
>>
>>
>>"antonio.lopez" <ant...@pt...>
>>Sent by:
>>eul...@li...
>>04/10/2004 14:01
>>Please respond to antonio.lopez
>>
>>=20
>> To: Jan Grant <fr...@io...>,
>>eulermoz developers=20
>><eul...@li...>
>> cc: (bcc: Jos
>>De_Roo/AMDUS/MOR/Agfa-NV/BE/BAYER)
>> Subject: [Eulermoz-developers] =BFCan
>>you give us a hand?
>>
>>
>>Hello all.
>>
>>We please to annouce N3 scanner a parser are
>>commeted at sourceforge CVS
>>repository.
>>
>> =20
>>
>=3D=3D=3D message truncated =3D=3D=3D
>
>
>
> =09
>__________________________________
>Do you Yahoo!?
>New and Improved Yahoo! Mail - Send 10MB messages!
>http://promotions.yahoo.com/new_mail=20
> =20
>
|
|
From: naudts g. <nau...@ya...> - 2004-10-05 11:31:12
|
Hallo, I suppose Jos means to encode as: :1 a RDF:List; RDF:first :2; RDF:rest :1a. :1a RDF:first :3; RDF:rest :1b. :1b RDF:first :4; RDF:rest RDF:nil. However then the nodes :1, :2, :1a, :3, :1b, :4 cannot oocur in any other triple as list elements; suppose you read a rule from another site: :1 a RDF:List; RDF:first :2; RDF:rest :1a. :1a RDF:first :3; RDF:rest RDF:nil. you obtain a clear inconsistency. Greetings, Guido. --- jos...@ag... wrote: > Hi, Antonio > > I've looked to your encoding of > eulermoz/tests/n3/example.n3 > in RDF/XML (using eulermoz/tests/n3/index.xul) and > when one > transforms that back into N3 (which is more readable > to me :)) > one gets > > > @prefix : <urn:clerk:anon#> . > @prefix NS3: > <http://www.agfa.com/w3c/euler/authen.axiom#> . > @prefix NS4: > <http://www.w3.org/2000/10/swap/log#> . > @prefix RDF: > <http://www.w3.org/1999/02/22-rdf-syntax-ns#> . > > <INSTITUTION> NS3:subscribed <MAILINGLIST>; > NS3:w3cmember <http://www.w3.org> . > > <PERSON> NS3:authenticated <MAILINGLIST>; > NS3:member <INSTITUTION> . > > <http://www.agfa.com> NS3:subscribed > <mailto:w3c...@w3...>; > NS3:w3cmember <http://www.w3.org> . > > <mailto:jos...@ag...> NS3:member > <http://www.agfa.com> . > > :1 a RDF:Seq; > RDF:_1 :2; > RDF:_2 :3; > RDF:_3 :4; > NS4:implies :5 . > > :2 a RDF:Statement; > RDF:object <INSTITUTION>; > RDF:predicate NS3:member; > RDF:subject <PERSON> . > > :3 a RDF:Statement; > RDF:object <http://www.w3.org>; > RDF:predicate NS3:w3cmember; > RDF:subject <INSTITUTION> . > > :4 a RDF:Statement; > RDF:object <MAILINGLIST>; > RDF:predicate NS3:subscribed; > RDF:subject <INSTITUTION> . > > :5 a RDF:Seq; > RDF:_1 :6 . > > :6 a RDF:Statement; > RDF:object <MAILINGLIST>; > RDF:predicate NS3:authenticated; > RDF:subject <PERSON> . > > :Rule0 a RDF:Seq; > RDF:_1 :1; > RDF:_2 :5; > NS4:forAll <INSTITUTION>, > <MAILINGLIST>, > <PERSON> . > > > and this is indeed an RDF graph. > The trouble however is that this entails for > instance something like > > > @prefix : <urn:clerk:anon#> . > @prefix NS3: > <http://www.agfa.com/w3c/euler/authen.axiom#> . > @prefix NS4: > <http://www.w3.org/2000/10/swap/log#> . > @prefix RDF: > <http://www.w3.org/1999/02/22-rdf-syntax-ns#> . > > <INSTITUTION> NS3:subscribed <MAILINGLIST>; > NS3:w3cmember <http://www.w3.org> . > > <PERSON> NS3:authenticated <MAILINGLIST>; > NS3:member <INSTITUTION> . > > <http://www.agfa.com> NS3:subscribed > <mailto:w3c...@w3...>; > NS3:w3cmember <http://www.w3.org> . > > <mailto:jos...@ag...> NS3:member > <http://www.agfa.com> . > > :1 a RDF:Seq; > RDF:_1 :2; > RDF:_3 :4; > NS4:implies :5 . > > :2 a RDF:Statement; > RDF:object <INSTITUTION>; > RDF:predicate NS3:member; > RDF:subject <PERSON> . > > :4 a RDF:Statement; > RDF:object <MAILINGLIST>; > RDF:predicate NS3:subscribed; > RDF:subject <INSTITUTION> . > > :5 a RDF:Seq; > RDF:_1 :6 . > > :6 a RDF:Statement; > RDF:object <MAILINGLIST>; > RDF:predicate NS3:authenticated; > RDF:subject <PERSON> . > > :Rule0 a RDF:Seq; > RDF:_1 :1; > RDF:_2 :5; > NS4:forAll <INSTITUTION>, > <MAILINGLIST>, > <PERSON> . > > > which is an encoding of > > > @prefix log: <http://www.w3.org/2000/10/swap/log#>. > @prefix rdfs: > <http://www.w3.org/2000/01/rdf-schema#>. > @prefix rdf: > <http://www.w3.org/1999/02/22-rdf-syntax-ns#>. > @prefix : > <http://www.agfa.com/w3c/euler/authen.axiom#>. > > <mailto:jos...@ag...> :member > <http://www.agfa.com>. > <http://www.agfa.com> :w3cmember > <http://www.w3.org>. > <http://www.agfa.com> :subscribed > <mailto:w3c...@w3...>. > > {?PERSON :member ?INSTITUTION. > ?INSTITUTION :subscribed ?MAILINGLIST} > => > {?PERSON :authenticated ?MAILINGLIST}. > > > which can be false (true premis and false > conclusion) and so > your encoding is inconsistent (one can derive a > falsehood). > > The only valid encoding I see right now is with RDF > lists > (as one can always make sure that RDF lists are > valid). > > Another point is that a premis and conclusion are > sets > of triples, but one could use eg:Set (subclass of > rdf:List). > > > kind regards, > jos > > -- > Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/ > > PS it should be the case that the euler path > inferencing is implemented in > http://cvs.sourceforge.net/viewcvs.py/eulermoz/eulermoz/tests/prolog/prolog.js?rev=1.5&view=auto > > > > > > "antonio.lopez" <ant...@pt...> > Sent by: > eul...@li... > 04/10/2004 14:01 > Please respond to antonio.lopez > > > To: Jan Grant <fr...@io...>, > eulermoz developers > <eul...@li...> > cc: (bcc: Jos > De_Roo/AMDUS/MOR/Agfa-NV/BE/BAYER) > Subject: [Eulermoz-developers] ¿Can > you give us a hand? > > > Hello all. > > We please to annouce N3 scanner a parser are > commeted at sourceforge CVS > repository. > === message truncated === __________________________________ Do you Yahoo!? New and Improved Yahoo! Mail - Send 10MB messages! http://promotions.yahoo.com/new_mail |
|
From: <jos...@ag...> - 2004-10-04 13:15:33
|
Hi, Antonio
I've looked to your encoding of eulermoz/tests/n3/example.n3
in RDF/XML (using eulermoz/tests/n3/index.xul) and when one
transforms that back into N3 (which is more readable to me :))
one gets
@prefix : <urn:clerk:anon#> .
@prefix NS3: <http://www.agfa.com/w3c/euler/authen.axiom#> .
@prefix NS4: <http://www.w3.org/2000/10/swap/log#> .
@prefix RDF: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
<INSTITUTION> NS3:subscribed <MAILINGLIST>;
NS3:w3cmember <http://www.w3.org> .
<PERSON> NS3:authenticated <MAILINGLIST>;
NS3:member <INSTITUTION> .
<http://www.agfa.com> NS3:subscribed <mailto:w3c...@w3...>;
NS3:w3cmember <http://www.w3.org> .
<mailto:jos...@ag...> NS3:member <http://www.agfa.com> .
:1 a RDF:Seq;
RDF:=5F1 :2;
RDF:=5F2 :3;
RDF:=5F3 :4;
NS4:implies :5 .
:2 a RDF:Statement;
RDF:object <INSTITUTION>;
RDF:predicate NS3:member;
RDF:subject <PERSON> .
:3 a RDF:Statement;
RDF:object <http://www.w3.org>;
RDF:predicate NS3:w3cmember;
RDF:subject <INSTITUTION> .
:4 a RDF:Statement;
RDF:object <MAILINGLIST>;
RDF:predicate NS3:subscribed;
RDF:subject <INSTITUTION> .
:5 a RDF:Seq;
RDF:=5F1 :6 .
:6 a RDF:Statement;
RDF:object <MAILINGLIST>;
RDF:predicate NS3:authenticated;
RDF:subject <PERSON> .
:Rule0 a RDF:Seq;
RDF:=5F1 :1;
RDF:=5F2 :5;
NS4:forAll <INSTITUTION>,
<MAILINGLIST>,
<PERSON> .
and this is indeed an RDF graph.
The trouble however is that this entails for instance something like
@prefix : <urn:clerk:anon#> .
@prefix NS3: <http://www.agfa.com/w3c/euler/authen.axiom#> .
@prefix NS4: <http://www.w3.org/2000/10/swap/log#> .
@prefix RDF: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
<INSTITUTION> NS3:subscribed <MAILINGLIST>;
NS3:w3cmember <http://www.w3.org> .
<PERSON> NS3:authenticated <MAILINGLIST>;
NS3:member <INSTITUTION> .
<http://www.agfa.com> NS3:subscribed <mailto:w3c...@w3...>;
NS3:w3cmember <http://www.w3.org> .
<mailto:jos...@ag...> NS3:member <http://www.agfa.com> .
:1 a RDF:Seq;
RDF:=5F1 :2;
RDF:=5F3 :4;
NS4:implies :5 .
:2 a RDF:Statement;
RDF:object <INSTITUTION>;
RDF:predicate NS3:member;
RDF:subject <PERSON> .
:4 a RDF:Statement;
RDF:object <MAILINGLIST>;
RDF:predicate NS3:subscribed;
RDF:subject <INSTITUTION> .
:5 a RDF:Seq;
RDF:=5F1 :6 .
:6 a RDF:Statement;
RDF:object <MAILINGLIST>;
RDF:predicate NS3:authenticated;
RDF:subject <PERSON> .
:Rule0 a RDF:Seq;
RDF:=5F1 :1;
RDF:=5F2 :5;
NS4:forAll <INSTITUTION>,
<MAILINGLIST>,
<PERSON> .
which is an encoding of
@prefix log: <http://www.w3.org/2000/10/swap/log#>.
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#>.
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#>.
@prefix : <http://www.agfa.com/w3c/euler/authen.axiom#>.
<mailto:jos...@ag...> :member <http://www.agfa.com>.
<http://www.agfa.com> :w3cmember <http://www.w3.org>.
<http://www.agfa.com> :subscribed <mailto:w3c...@w3...>.
{?PERSON :member ?INSTITUTION.
?INSTITUTION :subscribed ?MAILINGLIST}
=3D>
{?PERSON :authenticated ?MAILINGLIST}.
which can be false (true premis and false conclusion) and so
your encoding is inconsistent (one can derive a falsehood).
The only valid encoding I see right now is with RDF lists
(as one can always make sure that RDF lists are valid).
Another point is that a premis and conclusion are sets
of triples, but one could use eg:Set (subclass of rdf:List).
kind regards,
jos
--=20
Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/
PS it should be the case that the euler path inferencing is implemented in
http://cvs.sourceforge.net/viewcvs.py/eulermoz/eulermoz/tests/prolog/prolog=
.js?rev=3D1.5&view=3Dauto
"antonio.lopez" <ant...@pt...>
Sent by: eul...@li...
04/10/2004 14:01
Please respond to antonio.lopez
=20
To: Jan Grant <fr...@io...>, eulermoz developers=20
<eul...@li...>
cc: (bcc: Jos De=5FRoo/AMDUS/MOR/Agfa-NV/BE/BAYER)
Subject: [Eulermoz-developers] =BFCan you give us a hand?
Hello all.
We please to annouce N3 scanner a parser are commeted at sourceforge CVS
repository.
They are based on Java code generated by JFlex and Cup tools.
No need to say it's beta software it needs more testing and we know
parser generates redundant triples.
But we haven't found any serious error, here is were we need your help,
about the parser's correctness and how to implement Euler inference.
Regards, Antonio
-------------------------------------------------------
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
|
|
From: antonio.lopez <ant...@pt...> - 2004-10-04 12:01:14
|
Hello all. We please to annouce N3 scanner a parser are commeted at sourceforge CVS repository. They are based on Java code generated by JFlex and Cup tools. No need to say it's beta software it needs more testing and we know parser generates redundant triples. But we haven't found any serious error, here is were we need your help, about the parser's correctness and how to implement Euler inference. Regards, Antonio |
|
From: <ant...@4c...> - 2004-09-21 11:23:35
|
Hello all. We please to announce we commit N3 scanner first version. This javascript implementation is base on our also new N3 Java (Jflex-Cup) parser. Grammars are not commited, but if Jos or whoever needs them just tell us. ;) We now start to work on N3 parser. Cheers Antonio |
|
From: <ant...@4c...> - 2004-09-09 19:36:34
|
Thanks Jos Both N3 parser implemtations are improving we'll commit some decent code soon. Cheers Antonio > FYI > http://www.w3.org/2000/10/swap/grammar/ > is now again there > > regards, > jos > |
|
From: Jos D. <jos...@ag...> - 2004-09-09 17:26:17
|
FYI http://www.w3.org/2000/10/swap/grammar/ is now again there regards, jos --=20 Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/ Jos De=5FRoo 06/09/2004 16:27 To: Alfred D=F6blin <alfred=5Fd...@ya...>@AGFASMTP cc: eul...@li...,=20 eul...@li... Subject: Re: [Eulermoz-developers] RDF statements generation= out of N3 A long time ago, while starting with the java version of euler I was inspired by cwm's quoting i.e. ######################### @prefix log: <http://www.w3.org/2000/10/swap/log#>. @prefix : <http://example.org/family#>. {?x :parent ?y. ?y :brother ?z} =3D> {?x :uncle ?z}. ######################### is (modulo Ignoring universal quantification) like <rdf:RDF xmlns=3D"http://example.org/family#" xmlns:log=3D"http://www.w3.org/2000/10/swap/log#" xmlns:rdf=3D"http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description> <log:is rdf:parseType=3D"Quote"> <rdf:Description rdf:about=3D"http://example.org/family#x"> <parent rdf:resource=3D"http://example.org/family#y"/> </rdf:Description> <rdf:Description rdf:about=3D"http://example.org/family#y"> <brother rdf:resource=3D"http://example.org/family#z"/> </rdf:Description> </log:is> <log:implies rdf:parseType=3D"Quote"> <rdf:Description rdf:about=3D"http://example.org/family#x"> <uncle rdf:resource=3D"http://example.org/family#z"/> </rdf:Description> </log:implies> </rdf:Description> </rdf:RDF> and that way graphs can be the subjects and objects of triples that have log:implies, log:includes,... as their predicates. That's a very straightforward/compact thing to implement. regards, jos --=20 Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/ Alfred D=F6blin <alfred=5Fd...@ya...> Sent by: eul...@li... 06/09/2004 13:56 =20 To: eul...@li... cc: (bcc: Jos De=5FRoo/AMDUS/MOR/Agfa-NV/BE/BAYER) Subject: [Eulermoz-developers] RDF statements generation out= of N3 Hi, I'm working on the n3 parser and reaching the point in which it must be decided what statements are to be generated from the n3 document and stored in a datasource. Classical rdf statements pose no difficulty, however it's not clear which statements should be generated to deal with the rule section of n3. For instance: {?x family:parent ?y. ?y family:brother ?z} =3D> {?x family:uncle ?z}. Several approaches have been suggested: a) anon1 log:implies anon2. As for what properties should anon1 and anon2 exhibit, a heavy use of reification and of bags to group reificated statements would probably do but, would it suffice? Do we need some extra attribute to properly apply euler reasoning? This bizarre suggestion in the original n3 grammar: { statementlist } ( a formula, the statementlist itself as a literal resource ) has not been considered. b) SWRL proposes a vocabulary for expressing rules (nonetheless absolutely unrelated to that of n3). I'm looking forward to hear your suggestions, proposals and feedback. Best regards. Alfred =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=5F=5F=5F= =5F=5F=5F=5F=5F=5F=5F=5F=5F Gesendet von Yahoo! Mail - Jetzt mit 100MB Speicher kostenlos - Hier=20 anmelden: http://mail.yahoo.de ------------------------------------------------------- This SF.Net email is sponsored by BEA Weblogic Workshop FREE Java Enterprise J2EE developer tools! Get your free copy of BEA WebLogic Workshop 8.1 today. http://ads.osdn.com/?ad=5Fid=3D5047&alloc=5Fid=3D10808&op=3Dclick =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 |
|
From: Jos D. <jos...@ag...> - 2004-09-06 14:28:17
|
A long time ago, while starting with the java version of euler I was inspired by cwm's quoting i.e. ######################### @prefix log: <http://www.w3.org/2000/10/swap/log#>. @prefix : <http://example.org/family#>. {?x :parent ?y. ?y :brother ?z} =3D> {?x :uncle ?z}. ######################### is (modulo Ignoring universal quantification) like <rdf:RDF xmlns=3D"http://example.org/family#" xmlns:log=3D"http://www.w3.org/2000/10/swap/log#" xmlns:rdf=3D"http://www.w3.org/1999/02/22-rdf-syntax-ns#"> <rdf:Description> <log:is rdf:parseType=3D"Quote"> <rdf:Description rdf:about=3D"http://example.org/family#x"> <parent rdf:resource=3D"http://example.org/family#y"/> </rdf:Description> <rdf:Description rdf:about=3D"http://example.org/family#y"> <brother rdf:resource=3D"http://example.org/family#z"/> </rdf:Description> </log:is> <log:implies rdf:parseType=3D"Quote"> <rdf:Description rdf:about=3D"http://example.org/family#x"> <uncle rdf:resource=3D"http://example.org/family#z"/> </rdf:Description> </log:implies> </rdf:Description> </rdf:RDF> and that way graphs can be the subjects and objects of triples that have log:implies, log:includes,... as their predicates. That's a very straightforward/compact thing to implement. regards, jos --=20 Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/ Alfred D=F6blin <alfred=5Fd...@ya...> Sent by: eul...@li... 06/09/2004 13:56 =20 To: eul...@li... cc: (bcc: Jos De=5FRoo/AMDUS/MOR/Agfa-NV/BE/BAYER) Subject: [Eulermoz-developers] RDF statements generation out= of N3 Hi, I'm working on the n3 parser and reaching the point in which it must be decided what statements are to be generated from the n3 document and stored in a datasource. Classical rdf statements pose no difficulty, however it's not clear which statements should be generated to deal with the rule section of n3. For instance: {?x family:parent ?y. ?y family:brother ?z} =3D> {?x family:uncle ?z}. Several approaches have been suggested: a) anon1 log:implies anon2. As for what properties should anon1 and anon2 exhibit, a heavy use of reification and of bags to group reificated statements would probably do but, would it suffice? Do we need some extra attribute to properly apply euler reasoning? This bizarre suggestion in the original n3 grammar: { statementlist } ( a formula, the statementlist itself as a literal resource ) has not been considered. b) SWRL proposes a vocabulary for expressing rules (nonetheless absolutely unrelated to that of n3). I'm looking forward to hear your suggestions, proposals and feedback. Best regards. Alfred =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=5F=5F=5F= =5F=5F=5F=5F=5F=5F=5F=5F=5F Gesendet von Yahoo! Mail - Jetzt mit 100MB Speicher kostenlos - Hier=20 anmelden: http://mail.yahoo.de ------------------------------------------------------- This SF.Net email is sponsored by BEA Weblogic Workshop FREE Java Enterprise J2EE developer tools! Get your free copy of BEA WebLogic Workshop 8.1 today. http://ads.osdn.com/?ad=5Fid=3D5047&alloc=5Fid=3D10808&op=3Dclick =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 |
|
From: <alf...@ya...> - 2004-09-06 12:37:39
|
Hi,
I'm working on the n3 parser and reaching the point in
which it must be decided what statements are to be
generated from the n3 document and stored in a
datasource.
Classical rdf statements pose no difficulty, however
it's not clear which statements should be generated to
deal with the rule section of n3.
For instance:
{?x family:parent ?y. ?y family:brother ?z} => {?x
family:uncle ?z}.
Several approaches have been suggested:
a) anon1 log:implies anon2. As for what properties
should anon1 and anon2 exhibit, a heavy use of
reification and of bags to group reificated statements
would probably do but, would it suffice? Do we need
some extra attribute to properly apply euler
reasoning?
This bizarre suggestion in the original n3 grammar:
{ statementlist } ( a formula, the statementlist
itself as a literal resource ) has not been
considered.
b) SWRL proposes a vocabulary for expressing rules
(nonetheless absolutely unrelated to that of n3).
I'm looking forward to hear your suggestions,
proposals and feedback.
Best regards.
Alfred
___________________________________________________________
Gesendet von Yahoo! Mail - Jetzt mit 100MB Speicher kostenlos - Hier anmelden: http://mail.yahoo.de
|
|
From: Jos D. <jos...@ag...> - 2004-09-03 08:36:09
|
Hallo Guido, The mapping to a binary p(s,o) or a ternary holds(s, p, o) predicate was just one of my thoughts and not a reaction to something you said :) As I said in a further reply to Antonio wrt ecmascript code [[ map the verbs to the this.name and the subject and object to this.partlist.list (I've done tests with a mapping to holds(s, p, o) but that is dramatic :)) ]] regards, jos -- Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/ naudts guido <nau...@ya...> Sent by: eul...@li... 03/09/2004 10:18 To: Jos De_Roo/AMDUS/MOR/Agfa-NV/BE/BAYER@AGFA, ant...@4c..., eulermoz_dev <eul...@li...> cc: Subject: Re: [Eulermoz-developers] Re: N3ParserX.py question Hallo Jos, --- Jos De_Roo <jos...@ag...> wrote: > Guido, as we actually use it, [] just means _:x > i.e. a blank node. > What we use to express an inconsistency is for > instance > {?A owl:equivalentClass owl:Nothing. ?X a ?A} => {}. > Thanks, Jos. I apparently got the two things mixed up. > I also still think that we have to map the triple > s p o. > to the binary predicate > p(s, o). > as used in the actual ecmascript. Do you react to something I said here? I agree the RDF data model describes a property as a binary predicate; but what is the connection with the ecmascript? Regards, Guido > > regards, > jos > > -- > Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/ > > > > > naudts guido <nau...@ya...> > Sent by: > eul...@li... > 02/09/2004 12:51 > > > To: ant...@4c..., > eulermoz_dev > <eul...@li...> > cc: (bcc: Jos > De_Roo/AMDUS/MOR/Agfa-NV/BE/BAYER) > Subject: [Eulermoz-developers] Re: > N3ParserX.py question > > > Hallo Antonio, > I indeed did not implement these parts of the > specification, as I did not find these features very > usefull except for []). See further my comments > after > your text. > Now the specification I give in my source code is a > specification but there are others and there is > really > no official spec (it should have to be made) so I > try > to follow what Berners-Lee writes in his > introduction > to N3. > See for specifications: > www.w3.org/DesignIssues/Notation3.html > I started also translating my parser to Javascript. > Are you doing the same thing? Or planning to do so? > Does it make sense that I make a translation? > If I do, I will add the missing features. > --- ant...@4c... wrote: > > > Hallo Naudts. > > > > As you recommended to us we are on N3 parser in > > JavaScript (trying to work > > it out at least) and we are using your N3 parser > as > > a guide. > > > > But there are a couple of questions it would be > > nice if you give us a > > hint about how to use then and how they should be > > treated. > > Well it's just enough if you tell us where do you > > find this specification. > > > > > > a)Line 2046 > > # verb ::= ">-" prop "->" # has xxx of > > # | "<-" prop "<-" # is xxx of > > > I implemented the forms: > :s has :p of :o. > and > :s is :p of :o. > So I could easily implement also the ">-", "->", > "<-" and "<-" by treating them just the same but > does > this add much? Well, for completeness sake I ought > have done it, but I never did. > > b)Line 2074 > > # property_list ::= void # to allow [...]. > > # | verb space+ object_list > > # | verb space+ object_list space+ > > ";" space+ property_list > > # | ":-" anonnode #to allow two > > anonymous forms to be > > given eg [ a :Truth; :- { :sky :color :blue } ] ) > > # | ":-" anonnode ";" property_list > > # ; > > > I did not implement []. Still missing. [] is equal > to > the false value; it comes today in place of > log:falseHood; I know Jos De Roo uses it.(Correct > me > Jos if I am wrong) > The ":-" is another feature of the specification > which > I did not implement as I thought this to be totally > superfluous.For its meaning see: > http://infomesh.net/2002/notation3/ > Cheers, Guido. > > Thanks. > > Cheers > > Antonio > > > > > > > > __________________________________ > Do you Yahoo!? > New and Improved Yahoo! Mail - 100MB free storage! > http://promotions.yahoo.com/new_mail > > > ------------------------------------------------------- > This SF.Net email is sponsored by BEA Weblogic > Workshop > FREE Java Enterprise J2EE developer tools! > Get your free copy of BEA WebLogic Workshop 8.1 > today. > http://ads.osdn.com/?ad_id=5047&alloc_id=10808&op=click > _______________________________________________ > Eulermoz-developers mailing list > Eul...@li... > https://lists.sourceforge.net/lists/listinfo/eulermoz-developers > > > __________________________________ Do you Yahoo!? Yahoo! Mail - 50x more storage than other providers! http://promotions.yahoo.com/new_mail ------------------------------------------------------- This SF.Net email is sponsored by BEA Weblogic Workshop FREE Java Enterprise J2EE developer tools! Get your free copy of BEA WebLogic Workshop 8.1 today. http://ads.osdn.com/?ad_id=5047&alloc_id=10808&op=click _______________________________________________ Eulermoz-developers mailing list Eul...@li... https://lists.sourceforge.net/lists/listinfo/eulermoz-developers |
|
From: naudts g. <nau...@ya...> - 2004-09-03 08:18:10
|
Hallo Jos,
--- Jos De_Roo <jos...@ag...> wrote:
> Guido, as we actually use it, [] just means _:x
> i.e. a blank node.
> What we use to express an inconsistency is for
> instance
> {?A owl:equivalentClass owl:Nothing. ?X a ?A} => {}.
>
Thanks, Jos. I apparently got the two things mixed up.
> I also still think that we have to map the triple
> s p o.
> to the binary predicate
> p(s, o).
> as used in the actual ecmascript.
Do you react to something I said here? I agree the RDF
data model describes a property as a binary predicate;
but what is the connection with the ecmascript?
Regards, Guido
>
> regards,
> jos
>
> --
> Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/
>
>
>
>
> naudts guido <nau...@ya...>
> Sent by:
> eul...@li...
> 02/09/2004 12:51
>
>
> To: ant...@4c...,
> eulermoz_dev
> <eul...@li...>
> cc: (bcc: Jos
> De_Roo/AMDUS/MOR/Agfa-NV/BE/BAYER)
> Subject: [Eulermoz-developers] Re:
> N3ParserX.py question
>
>
> Hallo Antonio,
> I indeed did not implement these parts of the
> specification, as I did not find these features very
> usefull except for []). See further my comments
> after
> your text.
> Now the specification I give in my source code is a
> specification but there are others and there is
> really
> no official spec (it should have to be made) so I
> try
> to follow what Berners-Lee writes in his
> introduction
> to N3.
> See for specifications:
> www.w3.org/DesignIssues/Notation3.html
> I started also translating my parser to Javascript.
> Are you doing the same thing? Or planning to do so?
> Does it make sense that I make a translation?
> If I do, I will add the missing features.
> --- ant...@4c... wrote:
>
> > Hallo Naudts.
> >
> > As you recommended to us we are on N3 parser in
> > JavaScript (trying to work
> > it out at least) and we are using your N3 parser
> as
> > a guide.
> >
> > But there are a couple of questions it would be
> > nice if you give us a
> > hint about how to use then and how they should be
> > treated.
> > Well it's just enough if you tell us where do you
> > find this specification.
> >
> >
> > a)Line 2046
> > # verb ::= ">-" prop "->" # has xxx of
> > # | "<-" prop "<-" # is xxx of
> >
> I implemented the forms:
> :s has :p of :o.
> and
> :s is :p of :o.
> So I could easily implement also the ">-", "->",
> "<-" and "<-" by treating them just the same but
> does
> this add much? Well, for completeness sake I ought
> have done it, but I never did.
> > b)Line 2074
> > # property_list ::= void # to allow [...].
> > # | verb space+ object_list
> > # | verb space+ object_list space+
> > ";" space+ property_list
> > # | ":-" anonnode #to allow two
> > anonymous forms to be
> > given eg [ a :Truth; :- { :sky :color :blue } ] )
> > # | ":-" anonnode ";" property_list
> > # ;
> >
> I did not implement []. Still missing. [] is equal
> to
> the false value; it comes today in place of
> log:falseHood; I know Jos De Roo uses it.(Correct
> me
> Jos if I am wrong)
> The ":-" is another feature of the specification
> which
> I did not implement as I thought this to be totally
> superfluous.For its meaning see:
> http://infomesh.net/2002/notation3/
> Cheers, Guido.
> > Thanks.
> > Cheers
> > Antonio
> >
>
>
>
>
>
> __________________________________
> Do you Yahoo!?
> New and Improved Yahoo! Mail - 100MB free storage!
> http://promotions.yahoo.com/new_mail
>
>
>
-------------------------------------------------------
> This SF.Net email is sponsored by BEA Weblogic
> Workshop
> FREE Java Enterprise J2EE developer tools!
> Get your free copy of BEA WebLogic Workshop 8.1
> today.
>
http://ads.osdn.com/?ad_id=5047&alloc_id=10808&op=click
> _______________________________________________
> Eulermoz-developers mailing list
> Eul...@li...
>
https://lists.sourceforge.net/lists/listinfo/eulermoz-developers
>
>
>
__________________________________
Do you Yahoo!?
Yahoo! Mail - 50x more storage than other providers!
http://promotions.yahoo.com/new_mail
|
|
From: Jos D. <jos...@ag...> - 2004-09-02 18:38:09
|
We have to stay tuned for "N3 formal grammar" as you can see in http://www.w3.org/2000/10/swap/doc/plans.html and in the mean time continue with http://www.w3.org/DesignIssues/OldNotation3Grammar and map the verbs to the this.name and the subject and object to this.partlist.list (I've done tests with a mapping to holds(s, p, o) but that is dramatic :)) best regards, jos -- Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/ ant...@4c... Sent by: eul...@li... 02/09/2004 12:20 To: eul...@li... cc: (bcc: Jos De_Roo/AMDUS/MOR/Agfa-NV/BE/BAYER) Subject: Re: [Eulermoz-developers] Re: N3ParserX.py question Hello Naudts Great ;-) >I forgot to tell that I did implement log:falseHood, >so implementing [] will not be difficult. Ok, thanks, we are writing a jflex grammar, the idea is to have a N3 scanner and a parser in java and then try to write a js equivalent. The easier the code result the better. Cheers Antonio. > Hallo Antonio, > I indeed did not implement these parts of the > specification, as I did not find these features very > usefull except for []). See further my comments after > your text. > Now the specification I give in my source code is a > specification but there are others and there is really > no official spec (it should have to be made) so I try > to follow what Berners-Lee writes in his introduction > to N3. > See for specifications: > www.w3.org/DesignIssues/Notation3.html > I started also translating my parser to Javascript. > Are you doing the same thing? Or planning to do so? > Does it make sense that I make a translation? > If I do, I will add the missing features. > --- ant...@4c... wrote: > >> Hallo Naudts. >> >> As you recommended to us we are on N3 parser in >> JavaScript (trying to work >> it out at least) and we are using your N3 parser as >> a guide. >> >> But there are a couple of questions it would be >> nice if you give us a >> hint about how to use then and how they should be >> treated. >> Well it's just enough if you tell us where do you >> find this specification. >> >> >> a)Line 2046 >> # verb ::= ">-" prop "->" # has xxx of >> # | "<-" prop "<-" # is xxx of >> > I implemented the forms: > :s has :p of :o. > and > :s is :p of :o. > So I could easily implement also the ">-", "->", > "<-" and "<-" by treating them just the same but does > this add much? Well, for completeness sake I ought > have done it, but I never did. >> b)Line 2074 >> # property_list ::= void # to allow [...]. >> # | verb space+ object_list >> # | verb space+ object_list space+ >> ";" space+ property_list >> # | ":-" anonnode #to allow two >> anonymous forms to be >> given eg [ a :Truth; :- { :sky :color :blue } ] ) >> # | ":-" anonnode ";" property_list >> # ; >> > I did not implement []. Still missing. [] is equal to > the false value; it comes today in place of > log:falseHood; I know Jos De Roo uses it.(Correct me > Jos if I am wrong) > The ":-" is another feature of the specification which > I did not implement as I thought this to be totally > superfluous.For its meaning see: > http://infomesh.net/2002/notation3/ > Cheers, Guido. >> Thanks. >> Cheers >> Antonio >> > > > > > > __________________________________ > Do you Yahoo!? > New and Improved Yahoo! Mail - 100MB free storage! > http://promotions.yahoo.com/new_mail > > > ------------------------------------------------------- > This SF.Net email is sponsored by BEA Weblogic Workshop > FREE Java Enterprise J2EE developer tools! > Get your free copy of BEA WebLogic Workshop 8.1 today. > http://ads.osdn.com/?ad_id=5047&alloc_id=10808&op=click > _______________________________________________ > Eulermoz-developers mailing list > Eul...@li... > https://lists.sourceforge.net/lists/listinfo/eulermoz-developers > ------------------------------------------------------- This SF.Net email is sponsored by BEA Weblogic Workshop FREE Java Enterprise J2EE developer tools! Get your free copy of BEA WebLogic Workshop 8.1 today. http://ads.osdn.com/?ad_id=5047&alloc_id=10808&op=click _______________________________________________ Eulermoz-developers mailing list Eul...@li... https://lists.sourceforge.net/lists/listinfo/eulermoz-developers |
|
From: Jos D. <jos...@ag...> - 2004-09-02 16:45:47
|
Guido, as we actually use it, [] just means _:x
i.e. a blank node.
What we use to express an inconsistency is for instance
{?A owl:equivalentClass owl:Nothing. ?X a ?A} => {}.
I also still think that we have to map the triple
s p o.
to the binary predicate
p(s, o).
as used in the actual ecmascript.
regards,
jos
--
Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/
naudts guido <nau...@ya...>
Sent by: eul...@li...
02/09/2004 12:51
To: ant...@4c..., eulermoz_dev
<eul...@li...>
cc: (bcc: Jos De_Roo/AMDUS/MOR/Agfa-NV/BE/BAYER)
Subject: [Eulermoz-developers] Re: N3ParserX.py question
Hallo Antonio,
I indeed did not implement these parts of the
specification, as I did not find these features very
usefull except for []). See further my comments after
your text.
Now the specification I give in my source code is a
specification but there are others and there is really
no official spec (it should have to be made) so I try
to follow what Berners-Lee writes in his introduction
to N3.
See for specifications:
www.w3.org/DesignIssues/Notation3.html
I started also translating my parser to Javascript.
Are you doing the same thing? Or planning to do so?
Does it make sense that I make a translation?
If I do, I will add the missing features.
--- ant...@4c... wrote:
> Hallo Naudts.
>
> As you recommended to us we are on N3 parser in
> JavaScript (trying to work
> it out at least) and we are using your N3 parser as
> a guide.
>
> But there are a couple of questions it would be
> nice if you give us a
> hint about how to use then and how they should be
> treated.
> Well it's just enough if you tell us where do you
> find this specification.
>
>
> a)Line 2046
> # verb ::= ">-" prop "->" # has xxx of
> # | "<-" prop "<-" # is xxx of
>
I implemented the forms:
:s has :p of :o.
and
:s is :p of :o.
So I could easily implement also the ">-", "->",
"<-" and "<-" by treating them just the same but does
this add much? Well, for completeness sake I ought
have done it, but I never did.
> b)Line 2074
> # property_list ::= void # to allow [...].
> # | verb space+ object_list
> # | verb space+ object_list space+
> ";" space+ property_list
> # | ":-" anonnode #to allow two
> anonymous forms to be
> given eg [ a :Truth; :- { :sky :color :blue } ] )
> # | ":-" anonnode ";" property_list
> # ;
>
I did not implement []. Still missing. [] is equal to
the false value; it comes today in place of
log:falseHood; I know Jos De Roo uses it.(Correct me
Jos if I am wrong)
The ":-" is another feature of the specification which
I did not implement as I thought this to be totally
superfluous.For its meaning see:
http://infomesh.net/2002/notation3/
Cheers, Guido.
> Thanks.
> Cheers
> Antonio
>
__________________________________
Do you Yahoo!?
New and Improved Yahoo! Mail - 100MB free storage!
http://promotions.yahoo.com/new_mail
-------------------------------------------------------
This SF.Net email is sponsored by BEA Weblogic Workshop
FREE Java Enterprise J2EE developer tools!
Get your free copy of BEA WebLogic Workshop 8.1 today.
http://ads.osdn.com/?ad_id=5047&alloc_id=10808&op=click
_______________________________________________
Eulermoz-developers mailing list
Eul...@li...
https://lists.sourceforge.net/lists/listinfo/eulermoz-developers
|
