Record link: 
http://hdl.handle.net/20.500.12708/192174
-
Title: 
Complexity of Inconsistency-Tolerant Query Answering in Datalog+/- under Preferred Repairs
en
Citation: 
Lukasiewicz, T., Malizia, E., & Molinaro, C. (2023). Complexity of Inconsistency-Tolerant Query Answering in Datalog+/- under Preferred Repairs. In P. Marquis, T. C. Son, & G. Kern-Isberner (Eds.), Proceedings of 20th International Conference on Principles of Knowledge Representation and Reasoning (pp. 472–481). IJCAI Organization. https://doi.org/10.24963/kr.2023/46
-
Publisher DOI: 
10.24963/kr.2023/46
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Language: 
English
-
Authors: 
Lukasiewicz, Thomas 
Malizia, Enrico 
Molinaro, Cristian 
-
Organisational Unit: 
E192-07 - Forschungsbereich Artificial Intelligence Techniques 
E192-03 - Forschungsbereich Knowledge Based Systems 
-
Published in: 
Proceedings of 20th International Conference on Principles of Knowledge Representation and Reasoning 
-
ISBN: 
978-1-956792-02-7
-
Date (published): 
2023
-
Event name: 
KR2023 : 20th International Conference on Principles of Knowledge Representation and Reasoning 
en
Event date: 
2-Sep-2023 - 8-Sep-2023
-
Event place: 
Rhodos, Greece
-
Number of Pages: 
10
-
Publisher: 
IJCAI Organization
-
Peer reviewed: 
Yes
-
Keywords: 
Inconsistency- and exception tolerant reasoning; paraconsistent logics; exchange; integration; Computational aspects of knowledge representation; Ontology-based data access
en
Abstract: 
Inconsistency-tolerant semantics have been proposed to provide meaningful query answers even when knowledge bases are inconsistent. Several of such semantics rely on the notion of a repair, which is a "maximal" consistent subset of the knowledge base's facts, where different maximality criteria might be adopted depending on the application at hand. Previous work in the context of Datalog+/– has considered only the set-inclusion and cardinality criteria. In this paper, we take a step further and study inconsistency-tolerant semantics under other common maximality criteria, namely those based on weights and priority levels. We provide a thorough complexity analysis for a wide range of existential rule languages and for several complexity measures.
en
Research Areas: 
Logic and Computation: 100%
-
Science Branch: 
1020 - Informatik: 80%
1010 - Mathematik: 20%
-
Appears in Collections:
Conference Paper

Show full item record

Page view(s)

151
checked on Jan 18, 2024

Google ScholarTM

Check