- From: <jos.deroo.jd@belgium.agfa.com>
- Date: Fri, 23 Mar 2001 23:26:42 +0100
- To: timbl@w3.org
- Cc: mdean@bbn.com, boley@informatik.uni-kl.de, www-rdf-logic@w3.org
Tim, We 'swap'ped a little bit to your cwm.py and found jython cwm.py gedcom-all.n3 gedcom-damlex.n3 -think > lots.n3 working on our laptop (no problems at all on Windows 2000) BTW jython http://sourceforge.net/projects/jython/ is cool! The facts in gedcom-all.n3 are from some imaginary families although for us, they are quite real so we can easily check the results of http://www.agfa.com/w3c/euler/lots.n3 and they are ... all making sense! I am currently trying to follow your 'think'ing ... (I'm just wondering if the way in which we did the not-equal stuff is not improvable) -- Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/ timbl@w3.org on 03/22/2001 03:26:54 AM To: mdean@bbn.com@INTERNET, Jos De_Roo/AMDUS/MOR/Agfa-NV/BE/BAYER@AGFA cc: boley@informatik.uni-kl.de@INTERNET, www-rdf-logic@w3.org@INTERNET Subject: Re: gedcom-relation example Jos, Thanks for converting this into N3. I had to make two changes to use it. In the rules, for cwm you have to state that the rule is true - the "forAll" doens't do that for you. The other thing is that you can't omit the colon when you use a locanname with a void namespace prefix. My versions are listed in http://www.3.org/2000/10/swap/Examples.html (where is the original of this from?) Tim ----- Original Message ----- From: <jos.deroo.jd@belgium.agfa.com> To: <mdean@bbn.com> Cc: <www-rdf-logic@w3.org>; <boley@informatik.uni-kl.de> Sent: Sunday, March 04, 2001 6:06 PM Subject: gedcom-relation example > > Mike, > > We have been playing a bit with your GEDCOM example. > We actually rewrote it in N3 and the relations are at > http://www.agfa.com/w3c/euler/gedcom-relations.n3 > To have a practical example, some facts are at > http://www.agfa.com/w3c/euler/gedcom-facts.n3 > We did all kinds of queries such as at > http://www.agfa.com/w3c/euler/gedcom-query.n3 > and found all kinds of proofs such as at > http://www.agfa.com/w3c/euler/gedcom-relations.n3 > We had to fix (actually simplify) cycle detection. > Recursions and mutual references seem to work ... > Maybe the proofs can give an idea about possible > simplifications of the relations ... > > -- > Jos De Roo, Agfa http://www.agfa.com/w3c/jdroo/ >
Received on Friday, 23 March 2001 17:27:05 UTC