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: <ant...@4c...> - 2004-09-02 12:54:13
|
Hallo Naudts Shame on me, nothing is private, it's just I'm a bit daft. Just a mistake with my squirrelmail client, feel free to send to whoever you consider any mail. As I said before is a common project, no privacy at all. Cheers Antonio > Hallo Antonio, > A question: I see you do not send these messages to > the mailinglist. I send my reply to the mailinglist. > Is the list intended to recieve such messages or > should they stay out of it? > Cheers, Guido. > > > > __________________________________ > Do you Yahoo!? > Y! Messenger - Communicate in real time. Download now. > http://messenger.yahoo.com > |
From: <ant...@4c...> - 2004-09-02 11:40:12
|
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 > |
From: naudts g. <nau...@ya...> - 2004-09-02 10:56:44
|
Hallo, I forgot to tell that I did implement log:falseHood, so implementing [] will not be difficult. cheers, Guido. --- 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 > > 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 > # ; > > Thanks. > Cheers > Antonio > __________________________________ Do you Yahoo!? New and Improved Yahoo! Mail - 100MB free storage! http://promotions.yahoo.com/new_mail |
From: naudts g. <nau...@ya...> - 2004-09-02 10:51:57
|
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 |
From: Jos D. <jos...@ag...> - 2004-08-28 19:05:02
|
... to avoid those non-ground proofs, I've added following lines in both eulermoz/emoz.html and eulermoz/tests/prolog/prolog.js // The pending goal is proven when it is ground var g = 0; while (g<goalList[0].partlist.list.length) { if (value(goalList[0].partlist.list[g], environment).type == "Variable") break; g++; } if (g<goalList[0].partlist.list.length) return null; I also made a copy of the cvs module eulermoz to http://eulermoz.sourceforge.net/eulermoz/ kind regards, jos -- Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/ Jos De_Roo 28/08/2004 01:45 To: naudts guido <nau...@ya...>@AGFASMTP cc: eulermoz_dev <eul...@li...> Subject: Re: Fwd: [Eulermoz-developers] emoz.html/euler path Hi, Guido unify can return a new environment, but I don't think it changes the environment given in the argument... Anyhow, the envCopy eachtime done as // @@ euler paths var g = 1; while (g<goalList.length) { var envCopy = []; for (var z in environment) envCopy[z] = environment[z]; if (goalList[g].pending && goalList[g].index == i && unify(goalList[0], goalList[g], envCopy) != null) break; g++; } if (g<goalList.length) continue; still gives the same answers for the query path(paris, X) i.e. X = orleans X = chartres X = amiens X = blois X = bourges X = paris X = tours X = orleans X = blois X = lemans X = tours X = orleans X = Z13 X = Z9 X = Z5 X = Z5 X = Z1 X = Z1 and I agree that the latter 6 ones are redundant (will investigate that after some sleep :)) kind regards, jos -- Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/ naudts guido <nau...@ya...> 28/08/2004 00:29 To: Jos De_Roo/AMDUS/MOR/Agfa-NV/BE/BAYER@AGFA, eulermoz_dev <eul...@li...> cc: Subject: Fwd: [Eulermoz-developers] emoz.html/euler path Hallo Jos, I'm afraid it still isn't good. See following code: I think the environment must be copied each time. This is because unify changes it. I don't see immediately a more elegant solution. // @@ euler paths var g = 1; while (g<goalList.length) { envCopy = []; j = 0; for (item in environment) { envCopy[item.name] = item; } if (goalList[g].pending && goalList[g].index == i && unify(goalList[0], goalList[g], envCopy) != null) break; g++; } if (g<goalList.length) continue; Cheers, Guido. Note: forwarded message attached. __________________________________ Do you Yahoo!? New and Improved Yahoo! Mail - Send 10MB messages! http://promotions.yahoo.com/new_mail X-Apparently-To: nau...@ya... via 66.218.78.123; Fri, 27 Aug 2004 11:27:34 -0700 X-Originating-IP: [66.35.250.206] Return-Path: <eul...@li...> Received: from 66.35.250.206 (EHLO sc8-sf-list1.sourceforge.net) (66.35.250.206) by mta141.mail.sc5.yahoo.com with SMTP; Fri, 27 Aug 2004 11:27:34 -0700 Received: from localhost ([127.0.0.1] helo=projects.sourceforge.net) by sc8-sf-list1.sourceforge.net with esmtp (Exim 4.30) id 1C0lRQ-0006WY-3M; Fri, 27 Aug 2004 11:27:12 -0700 Received: from sc8-sf-mx2-b.sourceforge.net ([10.3.1.12] helo=sc8-sf-mx2.sourceforge.net) by sc8-sf-list1.sourceforge.net with esmtp (Exim 4.30) id 1C0lQl-0006Nd-3B for eul...@li...; Fri, 27 Aug 2004 11:26:31 -0700 Received: from web40505.mail.yahoo.com ([66.218.78.122]) by sc8-sf-mx2.sourceforge.net with smtp (Exim 4.34) id 1C0lQj-00048I-HI for eul...@li...; Fri, 27 Aug 2004 11:26:30 -0700 Received: from [82.174.11.129] by web40505.mail.yahoo.com via HTTP; Fri, 27 Aug 2004 11:26:24 PDT From: naudts guido <nau...@ya...> To: Jos De_Roo <jos...@ag...>, eulermoz_dev <eul...@li...> MIME-Version: 1.0 X-Spam-Score: 3.0 (+++) X-Spam-Report: Spam Filtering performed by sourceforge.net. See http://spamassassin.org/tag/ for more details. Report problems to http://sf.net/tracker/?func=add&group_id=1&atid=200001 0.0 SF_CHICKENPOX_SLASH BODY: Text interparsed with / 0.0 SF_CHICKENPOX_BRACKET_OPEN BODY: Text interparsed with [ 0.0 SF_CHICKENPOX_PARATHESES_OPEN BODY: Text interparsed with ( 0.0 SF_CHICKENPOX_PERIOD BODY: Text interparsed with . 0.0 SF_CHICKENPOX_UNDERSCORE BODY: Text interparsed with _ 0.0 SF_CHICKENPOX_LESSTHAN BODY: Text interparsed with < 3.0 RCVD_IN_DSBL RBL: Received via a relay in list.dsbl.org [<http://dsbl.org/listing?ip=82.174.11.129>] Subject: [Eulermoz-developers] emoz.html/euler path Sender: eul...@li... Errors-To: eul...@li... X-BeenThere: eul...@li... X-Mailman-Version: 2.0.9-sf.net Precedence: bulk List-Unsubscribe: <https://lists.sourceforge.net/lists/listinfo/eulermoz-developers>, <mailto:eul...@li...?subject=unsubscribe> List-Id: <eulermoz-developers.lists.sourceforge.net> List-Post: <mailto:eul...@li...> List-Help: <mailto:eul...@li...?subject=help> List-Subscribe: <https://lists.sourceforge.net/lists/listinfo/eulermoz-developers>, <mailto:eul...@li...?subject=subscribe> List-Archive: <http://sourceforge.net/mailarchive/forum.php?forum=eulermoz-developers> Date: Fri, 27 Aug 2004 11:26:24 -0700 (PDT) Content-Length: 702 Content-Type: text/plain; charset=us-ascii Hallo, There is an error in emoz.html as can be seen by making the query: path(paris, X). Several erroneous answers happen. The code in question: // @@ euler paths var g = 1; while (g<goalList.length) { if (goalList[g].pending && goalList[g].index == i && unify(goalList[0], goalList[g], environment) != null) break; g++; } if (g<goalList.length) continue; The eroor is that the function unify changes the bindings in environment; so before applying the Euler check, the environment has to be copied by: // @@ euler paths envCopy = []; j = 0; for (item in environment) { envCopy[item.name] = item; } var g = 1; while (g<goalList.length) { if (goalList[g].pending && goalList[g].index == i && unify(goalList[0], goalList[g], envCopy) != null) break; g++; } if (g<goalList.length) continue; Cheers, Guido __________________________________ Do you Yahoo!? New and Improved Yahoo! Mail - Send 10MB messages! 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: Jos D. <jos...@ag...> - 2004-08-27 23:45:49
|
Hi, Guido unify can return a new environment, but I don't think it changes the environment given in the argument... Anyhow, the envCopy eachtime done as // @@ euler paths var g = 1; while (g<goalList.length) { var envCopy = []; for (var z in environment) envCopy[z] = environment[z]; if (goalList[g].pending && goalList[g].index == i && unify(goalList[0], goalList[g], envCopy) != null) break; g++; } if (g<goalList.length) continue; still gives the same answers for the query path(paris, X) i.e. X = orleans X = chartres X = amiens X = blois X = bourges X = paris X = tours X = orleans X = blois X = lemans X = tours X = orleans X = Z13 X = Z9 X = Z5 X = Z5 X = Z1 X = Z1 and I agree that the latter 6 ones are redundant (will investigate that after some sleep :)) kind regards, jos -- Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/ naudts guido <nau...@ya...> 28/08/2004 00:29 To: Jos De_Roo/AMDUS/MOR/Agfa-NV/BE/BAYER@AGFA, eulermoz_dev <eul...@li...> cc: Subject: Fwd: [Eulermoz-developers] emoz.html/euler path Hallo Jos, I'm afraid it still isn't good. See following code: I think the environment must be copied each time. This is because unify changes it. I don't see immediately a more elegant solution. // @@ euler paths var g = 1; while (g<goalList.length) { envCopy = []; j = 0; for (item in environment) { envCopy[item.name] = item; } if (goalList[g].pending && goalList[g].index == i && unify(goalList[0], goalList[g], envCopy) != null) break; g++; } if (g<goalList.length) continue; Cheers, Guido. Note: forwarded message attached. __________________________________ Do you Yahoo!? New and Improved Yahoo! Mail - Send 10MB messages! http://promotions.yahoo.com/new_mail X-Apparently-To: nau...@ya... via 66.218.78.123; Fri, 27 Aug 2004 11:27:34 -0700 X-Originating-IP: [66.35.250.206] Return-Path: <eul...@li...> Received: from 66.35.250.206 (EHLO sc8-sf-list1.sourceforge.net) (66.35.250.206) by mta141.mail.sc5.yahoo.com with SMTP; Fri, 27 Aug 2004 11:27:34 -0700 Received: from localhost ([127.0.0.1] helo=projects.sourceforge.net) by sc8-sf-list1.sourceforge.net with esmtp (Exim 4.30) id 1C0lRQ-0006WY-3M; Fri, 27 Aug 2004 11:27:12 -0700 Received: from sc8-sf-mx2-b.sourceforge.net ([10.3.1.12] helo=sc8-sf-mx2.sourceforge.net) by sc8-sf-list1.sourceforge.net with esmtp (Exim 4.30) id 1C0lQl-0006Nd-3B for eul...@li...; Fri, 27 Aug 2004 11:26:31 -0700 Received: from web40505.mail.yahoo.com ([66.218.78.122]) by sc8-sf-mx2.sourceforge.net with smtp (Exim 4.34) id 1C0lQj-00048I-HI for eul...@li...; Fri, 27 Aug 2004 11:26:30 -0700 Received: from [82.174.11.129] by web40505.mail.yahoo.com via HTTP; Fri, 27 Aug 2004 11:26:24 PDT From: naudts guido <nau...@ya...> To: Jos De_Roo <jos...@ag...>, eulermoz_dev <eul...@li...> MIME-Version: 1.0 X-Spam-Score: 3.0 (+++) X-Spam-Report: Spam Filtering performed by sourceforge.net. See http://spamassassin.org/tag/ for more details. Report problems to http://sf.net/tracker/?func=add&group_id=1&atid=200001 0.0 SF_CHICKENPOX_SLASH BODY: Text interparsed with / 0.0 SF_CHICKENPOX_BRACKET_OPEN BODY: Text interparsed with [ 0.0 SF_CHICKENPOX_PARATHESES_OPEN BODY: Text interparsed with ( 0.0 SF_CHICKENPOX_PERIOD BODY: Text interparsed with . 0.0 SF_CHICKENPOX_UNDERSCORE BODY: Text interparsed with _ 0.0 SF_CHICKENPOX_LESSTHAN BODY: Text interparsed with < 3.0 RCVD_IN_DSBL RBL: Received via a relay in list.dsbl.org [<http://dsbl.org/listing?ip=82.174.11.129>] Subject: [Eulermoz-developers] emoz.html/euler path Sender: eul...@li... Errors-To: eul...@li... X-BeenThere: eul...@li... X-Mailman-Version: 2.0.9-sf.net Precedence: bulk List-Unsubscribe: <https://lists.sourceforge.net/lists/listinfo/eulermoz-developers>, <mailto:eul...@li...?subject=unsubscribe> List-Id: <eulermoz-developers.lists.sourceforge.net> List-Post: <mailto:eul...@li...> List-Help: <mailto:eul...@li...?subject=help> List-Subscribe: <https://lists.sourceforge.net/lists/listinfo/eulermoz-developers>, <mailto:eul...@li...?subject=subscribe> List-Archive: <http://sourceforge.net/mailarchive/forum.php?forum=eulermoz-developers> Date: Fri, 27 Aug 2004 11:26:24 -0700 (PDT) Content-Length: 702 Content-Type: text/plain; charset=us-ascii Hallo, There is an error in emoz.html as can be seen by making the query: path(paris, X). Several erroneous answers happen. The code in question: // @@ euler paths var g = 1; while (g<goalList.length) { if (goalList[g].pending && goalList[g].index == i && unify(goalList[0], goalList[g], environment) != null) break; g++; } if (g<goalList.length) continue; The eroor is that the function unify changes the bindings in environment; so before applying the Euler check, the environment has to be copied by: // @@ euler paths envCopy = []; j = 0; for (item in environment) { envCopy[item.name] = item; } var g = 1; while (g<goalList.length) { if (goalList[g].pending && goalList[g].index == i && unify(goalList[0], goalList[g], envCopy) != null) break; g++; } if (g<goalList.length) continue; Cheers, Guido __________________________________ Do you Yahoo!? New and Improved Yahoo! Mail - Send 10MB messages! 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-08-27 22:29:25
|
Hallo Jos, I'm afraid it still isn't good. See following code: I think the environment must be copied each time. This is because unify changes it. I don't see immediately a more elegant solution. // @@ euler paths var g = 1; while (g<goalList.length) { envCopy = []; j = 0; for (item in environment) { envCopy[item.name] = item; } if (goalList[g].pending && goalList[g].index == i && unify(goalList[0], goalList[g], envCopy) != null) break; g++; } if (g<goalList.length) continue; Cheers, Guido. Note: forwarded message attached. __________________________________ Do you Yahoo!? New and Improved Yahoo! Mail - Send 10MB messages! http://promotions.yahoo.com/new_mail |
From: naudts g. <nau...@ya...> - 2004-08-27 18:26:32
|
Hallo, There is an error in emoz.html as can be seen by making the query: path(paris, X). Several erroneous answers happen. The code in question: // @@ euler paths var g = 1; while (g<goalList.length) { if (goalList[g].pending && goalList[g].index == i && unify(goalList[0], goalList[g], environment) != null) break; g++; } if (g<goalList.length) continue; The eroor is that the function unify changes the bindings in environment; so before applying the Euler check, the environment has to be copied by: // @@ euler paths envCopy = []; j = 0; for (item in environment) { envCopy[item.name] = item; } var g = 1; while (g<goalList.length) { if (goalList[g].pending && goalList[g].index == i && unify(goalList[0], goalList[g], envCopy) != null) break; g++; } if (g<goalList.length) continue; Cheers, Guido __________________________________ Do you Yahoo!? New and Improved Yahoo! Mail - Send 10MB messages! http://promotions.yahoo.com/new_mail |
From: naudts g. <nau...@ya...> - 2004-08-27 15:51:44
|
Hallo, --- ant...@4c... wrote: > Hallo all. > > We've commited a new example at > http://cvs.sourceforge.net/viewcvs.py/eulermoz/eulermoz/tests/prolog/ > > It's basically the same test Joss did but : > a) Facts and rules are XML-RDF.(cities.rdf and > rules.rdf) > b) It's XUL based. > > Although nice it's not what we should achive. RDF is > loaded as XML into a > RDFDatasource an then serialized as a string (rules > are written as > literals) We could use RDF in XML syntax: SWRL(Semantic Web Rules Language) defines a syntax for rules; of course whether we use XML or N3 syntax, we should not do what the examples do: parse this XML or N3 syntax into a string and then again parse as prolog. The inference engine should use directly the result of XML or N3 parsing. Cheers, Guido > That transformation is a waste of resources and for > sure is not the idea. > Actually we are working on a N3 scanner to really > allow inference directly > against RDFDatasources. > > > Will keep you informed ;-) > > Cheers > Antonio > > > ------------------------------------------------------- > 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!? Win 1 of 4,000 free domain names from Yahoo! Enter now. http://promotions.yahoo.com/goldrush |
From: <ant...@4c...> - 2004-08-27 15:05:59
|
Hallo all. We've commited a new example at http://cvs.sourceforge.net/viewcvs.py/eulermoz/eulermoz/tests/prolog/ It's basically the same test Joss did but : a) Facts and rules are XML-RDF.(cities.rdf and rules.rdf) b) It's XUL based. Although nice it's not what we should achive. RDF is loaded as XML into a RDFDatasource an then serialized as a string (rules are written as literals) That transformation is a waste of resources and for sure is not the idea. Actually we are working on a N3 scanner to really allow inference directly against RDFDatasources. Will keep you informed ;-) Cheers Antonio |
From: Jos D. <jos...@ag...> - 2004-08-26 15:15:07
|
Hi, all I had a couple of hours last night to try putting a euler path detection in Jan's brilliant tiny prolog proof engine and after some trials we now have http://eulermoz.sourceforge.net/emoz.html As far as I could test all loops were detected and also all solutions were found :) The CVS log info is [[ RCS file: /cvsroot/eulermoz/eulermoz/emoz.html,v Working file: emoz.html head: 1.1 branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 1; selected revisions: 1 description: ---------------------------- revision 1.1 date: 2004/08/26 14:47:39; author: josd; state: Exp; euler path detection ]] kind regards, jos --=20 Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/ ant...@4c... 25/08/2004 18:20 =20 To: fr...@io..., jan...@4c..., Jos=20 De=5FRoo/AMDUS/MOR/Agfa-NV/BE/BAYER@AGFA, naudts=5Fv...@ya... cc:=20 Subject: First steps Hello all. We have two projects now: 1=AA)http://sourceforge.net/projects/eulermoz/ 2=AA)http://eulermoz.mozdev.org/ As we said, we try to promote Mozilla as a development platforrm and, unless you want a different approach, each place would have different targets. But,please, feel free to change or suggest whatever you want. A) http://sourceforge.net/projects/eulermoz/ would be the place to develop the basic api, and a sort of sandbox or incubator where ideas would start and be tested . Actually we've imported a module called "eulermoz" with the api Naudts suggested to us cvs -z3 -d:pserver:you...@cv...:/cvsroot/eulermoz co=20 eulermoz We also have set up two mailng lists that are waiting for your subscriptions.(http://sourceforge.net/mail/?group=5Fid=3D117308) B) http://eulermoz.mozdev.org/ would be the place were we'll develop specific applications and extensions for mozilla suite and firefox, and the also were we try to evangelize about using RDF inside Mozilla platforrm with practical examples and widgets. Again thanks, and feel free to make any question or suggestion , if some of you want administrative priviledges just tell me, it's our project Cheers Antonio |
From: <oma...@4c...> - 2004-08-25 17:41:00
|