This relationship gives evidence for the presence of an object
of class , given the presence of an object of subclass S.
As above, the notion of subclass is that of a specialization, and an object
may have several.
Here, the implication is a necessary one, because an instance of a given
subclass is necessarily an instance of the class.
Hence, the plausibility of the
object must not be less than that of its subclasses.
The constraints that specify the subclass relationship calculation are:
These constraints lead to the following formal definition of the subclass evidence computation:
Given: | |
a model instance of class ![]() ![]() |
|
a set {![]() ![]() |
|
a set {![]() ![]() ![]() |
|
Then, the subclass relationship evidence value is: | |
![]() |
|
If no subclass evidence is available, this computation is not applied. The invocation network fragment for this evidence type is similar to those shown previously.