Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis - ANR - Agence nationale de la recherche Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis

Résumé

Generalising the state of the art, an inconsistency-tolerant semantics can be seen as a couple composed of a modifier operator and an inference strategy. In this paper we deepen the analysis of such general setting and focus on two aspects. First, we investigate the rationality properties of such semantics for existential rule knowledge bases. Second, we unfold the broad landscape of complexity results of inconsistency-tolerant semantics under a specific (yet expressive) subclass of existential rules.
Fichier principal
Vignette du fichier
jelia16.pdf (798.07 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

lirmm-01412864 , version 1 (19-12-2016)

Identifiants

Citer

Jean-François Baget, Salem Benferhat, Zied Bouraoui, Madalina Croitoru, Marie-Laure Mugnier, et al.. Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis. JELIA: Logics in Artificial Intelligence, Nov 2016, Larnaca, Cyprus. pp.64-80, ⟨10.1007/978-3-319-48758-8_5⟩. ⟨lirmm-01412864⟩
535 Consultations
251 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More