 |
HAL-LIRMM - Open Archive |  |
Conference papers
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.
Cited literature [18 references]
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01412864
Contributor : Jean-François Baget Connect in order to contact the contributor
Submitted on : Monday, December 19, 2016 - 7:53:03 PM
Last modification on : Friday, October 22, 2021 - 3:07:24 PM
Long-term archiving on: : Tuesday, March 21, 2017 - 4:55:06 AM
Contributor : Jean-François Baget Connect in order to contact the contributor
Submitted on : Monday, December 19, 2016 - 7:53:03 PM
Last modification on : Friday, October 22, 2021 - 3:07:24 PM
Long-term archiving on: : Tuesday, March 21, 2017 - 4:55:06 AM
File
jelia16.pdf
Files produced by the author(s)