We present new algorithm for computing the union and intersection of all justifications for a given ontological consequence without first computing the set of all justifications. Through an empirical evaluation, we show that our approach works well in practice for expressive DLs. In particular, the union of all justifications can be computed much faster than with existing justification-enumeration approaches. We further discuss how to use these results to repair ontologies efficiently.

翻译：我们提出了计算某种本体后果的所有理由的结合和交叉的新算法,而没有首先计算所有理由的一组。我们通过经验评估表明,我们的方法在表达DLs的实践中行之有效。特别是,所有理由的结合可以比现有的说明理由的方法更快地计算。我们进一步讨论了如何利用这些结果来有效地修复肿瘤。