Inconsistency-tolerant query answering: rationality properties and computational complexity analysis

Baget, Jean François, Benferhat, Salem, Bouraoui, Zied, Croitoru, Madalina, Mugnier, Marie-Laure, Papini, Odile, Rocher, Swan and Tabia, Karim 2016. Inconsistency-tolerant query answering: rationality properties and computational complexity analysis. Presented at: JELIA 2016: European Conference on Logics in Artificial Intelligence, Larnaca, Cyprus, 9-11 November 2016. Published in: Loizos, Michael and Kakas, Antonis eds. Logics in Artificial Intelligence: 15th European Conference, JELIA 2016, Larnaca, Cyprus, November 9-11, 2016, Proceedings. Lecture Notes in Computer Science. Lecture Notes in Computer Science , vol.10021 Cham: Springer, pp. 64-80. 10.1007/978-3-319-48758-8_5

Full text not available from this repository.

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.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	Springer
ISBN:	978-3-319-48758-8
ISSN:	0302-9743
Last Modified:	07 Aug 2019 10:53
URI:	https://orca.cardiff.ac.uk/id/eprint/97285

Citation Data

Cited 9 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item