“…While the former problem remains polynomial in EL, the latter necessarily needs exponential time, as the number of justifications may be exponential on the size of the ontology. Despite some potential uses, which have been identified for non standard reasoning [6], only very recently have specific algorithms for computing the unions and intersection of justifications been developed [9,14]. To the best of our knowledge, no previous work has considered computing the justifications of minimal cardinality directly.…”