- From: Bernard Vatant <bernard.vatant@mondeca.com>
- Date: Mon, 9 Aug 2010 11:59:36 +0200
- To: Adrian Pohl <uebertext@googlemail.com>
- Cc: semantic-web <semantic-web@w3.org>
- Message-ID: <AANLkTik7Eq_50-YY=g+kR+r9jE9Ji1sBTgkZVAjwOSM8@mail.gmail.com>
Hi Adrian
Not sure you can do that in OWL, but you can express it with a SPARQL
CONSTRUCT query
CONSTRUCT
{?x :p1 ?y}
WHERE
{?x :p2 ?y.
?x :p3 ?y}
Bernard
2010/8/7 Adrian Pohl <uebertext@googlemail.com>
> Hello,
>
> I got a question about modelling relations between properties in an
> ontology. Basically, I want to model an equivalence relation between
> two superproperties and one subproperty.
>
> To be more concrete: I got one property p₁ which is subproperty of two
> different superproperties p₂ and p₃. With this it is said that every
> relation between A and B where:
>
> A p₁ B
>
> implies:
>
> A p₂ B and A p₃ B.
>
> This is easy to state with rdfs:subPropertyOf. But how do I
> additionally state the other way round that when there are two
> relations between A and B a third relation necessarily follows out of
> that? So that when:
>
> A p₂ B and A p₃ B
>
> it follows:
>
> A p₁ B
>
> Basically, logically spoken: I want to represent an equivalence
> relation between the conjunction of two superproperties and one
> subproperty which in formal logical language would look something like
> this:
>
> R₁ab ∧ R₂ab ⇔ R₃ab
>
> (How) can I model this in OWL?
>
> Adrian
>
>
>
--
Bernard Vatant
Senior Consultant
Vocabulary & Data Engineering
Tel: +33 (0) 971 488 459
Mail: bernard.vatant@mondeca.com
----------------------------------------------------
Mondeca
3, cité Nollez 75018 Paris France
Web: http://www.mondeca.com
Blog: http://mondeca.wordpress.com
----------------------------------------------------
Received on Monday, 9 August 2010 10:00:06 UTC