Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2016

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

Abstract

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
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

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⟩
533 View
248 Download

Altmetric

Share

Gmail Facebook X LinkedIn More