On Apr 3, 2005 2:57 AM, jos.deroo@agfa.com <jos.deroo@agfa.com> wrote:
>
> [...]
> > 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
Back in the kindergarten, that work by observation - see attached.
(also http://dannyayers.com/2005/04/intersection3.gif )
Cheers,
Danny.
--
http://dannyayers.com
