For practical ontology-based applications representing and reasoning with probabilities is an essential task. For Description Logics with subjective probabilities reasoning procedures for testing instance relations based on the completion method have been developed.
In this paper we extend this technique to devise algorithms for solving non-standard inferences for
and its probabilistic extension Prob-
: computing the most specific concept of an individual and finding explanations for instance relations.