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 inconsistencytolerant semantics under a specific (yet expressive) subclass of existential rules.
Cite
CITATION STYLE
Baget, J. F., Benferhat, S., Bouraoui, Z., Croitoru, M., Mugnier, M. L., Papini, O., … Tabia, K. (2016). Inconsistency-tolerant query answering: Rationality properties and computational complexity analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10021 LNAI, pp. 64–80). Springer Verlag. https://doi.org/10.1007/978-3-319-48758-8_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
