Inconsistency-tolerant query answering for existential rules
From MaRDI portal
Publication:2124462
DOI10.1016/J.ARTINT.2022.103685OpenAlexW3162324384MaRDI QIDQ2124462FDOQ2124462
Authors: Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro, Andreas Pieris, Gerardo Simari, Maria Vanina Martinez 
Publication date: 11 April 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2022.103685
computational complexitysemanticsconjunctive queriesquery answeringinconsistencyrule-based ontologies
Cites Work
- Title not available (Why is that?)
- Linking Data to Ontologies
- Title not available (Why is that?)
- Minimal-change integrity maintenance using tuple deletions
- Taming the infinite chase: query answering under expressive relational constraints
- Data exchange: semantics and query answering
- Title not available (Why is that?)
- The strong exponential hierarchy collapses
- Graph Ramsey theory and the polynomial hierarchy
- Towards more expressive ontology languages: the query answering problem
- Title not available (Why is that?)
- On the complexity of core, kernel, and bargaining set
- Inconsistency handling in Datalog\(+/-\) ontologies
- Achieving new upper bounds for the hypergraph duality problem through logic
- Query Rewriting and Optimization for Ontological Databases
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
- Computing and explaining query answers over inconsistent DL-Lite knowledge bases
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison
- Title not available (Why is that?)
Cited In (4)
Uses Software
This page was built for publication: Inconsistency-tolerant query answering for existential rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124462)
