On the Computation of a Productive Partially Ordered Possibilistic Repair
Résumé
We deal with repairing inconsistent partially ordered lightweight ontologies in the possibilistic setting. More specifically, we consider the closure-based C$\pi$-repair method, which yields a more productive partially ordered possibilistic repair and is tractable in DL-Lite$_{\mathcal{R}}$.
In this work, we refine the characterization of the C$\pi$-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$\pi$-repair method achieves the best performance both in terms of productivity and computational cost.
Domaines
Informatique [cs]Origine | Fichiers produits par l'(les) auteur(s) |
---|---|
Licence |