Actually, I'm getting lost about what can be done and cannot be done using a reasoner in general.
My question is two fold:
I used to think that a reasoner is only dedicated for sumbsumption and taxonomies. Recently, I discovered that a reasoner can be used in multiple ways within some algorithms for example this reference introduces using a reasoner to search for entities compliant to a specific pattern in the ontology:
What is meant by a DL generic reasoning algorithm and how can it be implemented through a reasoner?
Can you please refer my to any references where I can get more familiar to things that can be achieved by reasoning algorithms if any?
My original problem is that: given an OWL ontology and two classes
C1
andC2
, I want to check whether there is a functional property chain connecting them, i.e. let's consider(C1 P1 C3)
,(C3 P2 C4)
and(C4 P3 C2)
whereP1
,P2
andP3
are functional object properties, thus the result will be(P1, P2, P3)
which is the functional property chain connectingC1
andC2
.