Union and Intersection of all Justifications
This addresses efficiency issues in ontology repair for users in knowledge representation and reasoning, though it appears incremental as it builds on justification-based approaches.
The paper tackles the problem of computing the union and intersection of all justifications for ontological consequences without enumerating them, showing that their algorithm computes the union much faster than existing methods in practice for expressive description logics.
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.