Reputation: 1531
Given an ontology O, and let A, B two classes and object properties P and Q such that:
Thus, we to prove P ≡ Q, we only need show that P ⊑ Q, because we already have the other direction, Q ⊑ P, in (4). To conclude that P ≡ Q are equivalent; let
then x ∈ A and y ∈ B and we have from (5) that Q relates each individual of A to exactly one individual of B; then there must exist y′ ∈ B such that (x,y′) ∈ Q; and by (4), we can infer that
Then, from (3), (6), and (7), we can infer that y = y′. Thus, if (x,y) ∈ P, then (x,y) ∈ Q, which means that:
Then, by (4) and (8):
Upvotes: 1
Views: 672
Reputation: 768
Your reasoning is correct and P is indeed equivalent to P1 in this ontology. However, Pellet, as the most of current DL reasoners, do not perform inferences on the property hierarchy. It is calculated as a reflexive transitive closure of the told information of property hierarchy relation. To the best of my knowledge the only reasoner that perform complete property hierarchy calculation is HermiT; if you classify your ontology with it then the inference P EquivalentTo P1
will appear in the inferred object property hierarchy view.
Upvotes: 2