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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01412864
Contributor : Jean-François Baget <>
Submitted on : Monday, December 19, 2016 - 7:53:03 PM
Last modification on : Wednesday, December 12, 2018 - 2:38:02 PM
Long-term archiving on : Tuesday, March 21, 2017 - 4:55:06 AM

File

jelia16.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

910

Files downloads

189