W3C home > Mailing lists > Public > www-rdf-logic@w3.org > March 2001

gedcom-relation example

From: <jos.deroo.jd@belgium.agfa.com>
Date: Mon, 5 Mar 2001 00:06:30 +0100
To: mdean@bbn.com
Cc: www-rdf-logic@w3.org, boley@informatik.uni-kl.de
Message-Id: <OF0946B1D8.D709A893-ON41256A05.007E6C15@bayer-ag.com>

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 Sunday, 4 March 2001 18:06:48 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:52:38 GMT