Union and Intersection of all Justifications

TL;DR

This paper introduces a new algorithm for efficiently computing the union and intersection of all justifications in ontologies, significantly improving performance over existing methods and aiding in ontology repair.

Contribution

The paper presents a novel algorithm that computes all justification unions and intersections without enumerating each justification, enhancing efficiency in expressive Description Logics.

Findings

Union computation is faster than existing approaches

Algorithm performs well on expressive Description Logics

Facilitates efficient ontology repair

Abstract

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.