- From: <jos.deroo@agfa.com>
- Date: Sun, 3 Apr 2005 02:57:30 +0200
- To: minsu@etri.re.kr
- Cc: Chris Purcell <cjp39@cam.ac.uk>, semantic-web@w3.org
[...] > By the way, one difficult case I encountered in writing OWL inference rules > is about checking equality among list elements. When you're given a list of > classes or individuals, some elements of the list can actually be > equivalent, which affects the reasoning result. For example: > > A rdf:type owl:Class. > A owl:intersectionOf [B,C,D]. > B owl:equivalentClass D. > E owl:intersectionOf [B,C]. > > >From the above sentences, it should be possible to infer that A is > equivalent to E, for which I find writing an inference rule to be difficult. > I'm still working on it. indeed, is kind of difficult.. but indeed :A owl:intersectionOf (:B :C :D). :B owl:equivalentClass :D. :E owl:intersectionOf (:B :C). entails :E owl:equivalentClass :A. well, at least we found proof evidence http://eulersharp.sourceforge.net/2004/04test/minsuE.n3 -- Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/
Received on Sunday, 3 April 2005 00:57:56 UTC