Year: 2024
Type: conference-paper
Abstract: 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.
DOI: 10.24963/kr.2024/14
Institutions: Centre National de la Recherche Scientifique, Université de Bordeaux, National Institute of Informatics, Laboratoire Bordelais de Recherche en Informatique, Institut Polytechnique de Bordeaux, Japanese-French Laboratory for Informatics, Institut national de recherche en sciences et technologies du numérique, Université Paris Sciences et Lettres, École Normale Supérieure - PSL, Département d'Informatique
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Funder: Agence Nationale de la Recherche
OpenAlex ID: W4403322427