- From: <jos.deroo.jd@belgium.agfa.com>
- Date: Mon, 5 Mar 2001 09:50:53 +0100
- To: mdean@bbn.com
- Cc: www-rdf-logic@w3.org, boley@informatik.uni-kl.de
Oops... the proof example is actually at http://www.agfa.com/w3c/euler/gedcom-proof.n3 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-proof.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 Monday, 5 March 2001 03:51:17 UTC