On the Computation of a Productive Partially Ordered Possibilistic Repair

We deal with repairing inconsistent partially ordered lightweight ontologies in the possibilistic setting. More specifically, we consider the closure-based C𝜋-repair method, which yields a more productive partially ordered possibilistic repair and is tractable in DL-Liteℛ. In this work, we refine the characterization of the C𝜋-repair method and propose an equivalent algorithm that is more efficient. We illustrate our findings with an experimental analysis. In particular, we highlight the main situations in which the C𝜋-repair method achieves the best performance both in terms of productivity and computational cost.

In Proceedings of the 37th International Workshop on Description Logics (DL 2024)