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.

中文翻译：

---

所有理由的并集和交集

我们提出了新算法，用于计算给定本体论结果的所有理由的并集和交集，而无需首先计算所有理由的集合。通过实证评估，我们表明我们的方法在表达性 DL 的实践中运作良好。特别是，所有理由的并集可以比现有的理由枚举方法计算得更快。我们进一步讨论如何使用这些结果来有效地修复本体。