Queries With Exact Truth Values in Paraconsistent Description Logics - Archive ouverte HAL
Communication Dans Un Congrès Année : 2024

Queries With Exact Truth Values in Paraconsistent Description Logics

Résumé

We present a novel approach to querying classical inconsistent description logic (DL) knowledge bases by adopting a paraconsistent semantics with the four 'Belnapian' values: exactly true (T), exactly false (F), both (B), and neither (N). In contrast to prior studies on paraconsistent DLs, we allow truth value operators in the query language, which can be used to differentiate between answers having contradictory evidence and those having only positive evidence. We present a reduction to classical DL query answering that allows us to pinpoint the precise combined and data complexity of answering queries with values in paraconsistent ALCHI and its sublogics. Notably, we show that tractable data complexity is retained for Horn DLs. We present a comparison with repair-based inconsistency-tolerant semantics, showing that the two approaches are incomparable.
Fichier principal
Vignette du fichier
KR2024_BieBouKoz.pdf (382.07 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04730579 , version 1 (10-10-2024)

Identifiants

  • HAL Id : hal-04730579 , version 1

Citer

Meghyn Bienvenu, Camille Bourgaux, Daniil Kozhemiachenko. Queries With Exact Truth Values in Paraconsistent Description Logics. KR 2024 - 21st International Conference on Principles of Knowledge Representation and Reasoning, Nov 2024, Hanoi, Vietnam. ⟨hal-04730579⟩
0 Consultations
0 Téléchargements

Partager

More