On the Computation of a Productive Partially Ordered Possibilistic Repair - HAL UNIV-PARIS8 - open access Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

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.
Fichier principal
Vignette du fichier
paper37.pdf (1012.94 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04622237 , version 1 (24-06-2024)
hal-04622237 , version 2 (17-07-2024)

Licence

Identifiants

  • HAL Id : hal-04622237 , version 2

Citer

Ahmed Laouar, Sihem Belabbes, Salem Benferhat. On the Computation of a Productive Partially Ordered Possibilistic Repair. DL 2024: 37th International Workshop on Description Logics, Ana Ozaki; Laura Giordano; Jean Christoph Jung, Jun 2024, Bergen, Norway. ⟨hal-04622237v2⟩
5 Consultations
4 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More