Role-depth bounded Least Common Subsumer in Prob-EL with Nominals
MetadataShow full item record
Completion-based algorithms can be employed for computing the least common subsumer of two concepts up to a given role-depth, in extensions of the lightweight DL EL. This approach has been applied also to the probabilistic DL Prob-EL, which is variant of EL with subjective probabilities. In this paper we extend the completion-based lcscomputation algorithm to nominals, yielding a procedure for the DL Prob-ELO c 01.