Inconsistency-tolerant query answering for existential rules
From MaRDI portal
Publication:2124462
DOI10.1016/j.artint.2022.103685OpenAlexW3162324384MaRDI QIDQ2124462
Thomas Lukasiewicz, Gerardo I. Simari, Enrico Malizia, Andreas Pieris, Cristian Molinaro, 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 complexitysemanticsinconsistencyquery answeringconjunctive queriesrule-based ontologies
Related Items (3)
On the Complexity of Finding Set Repairs for Data-Graphs ⋮ Query answering over inconsistent knowledge bases: a probabilistic approach ⋮ Preference-based inconsistency-tolerant query answering under existential rules
Uses Software
Cites Work
- Towards more expressive ontology languages: the query answering problem
- Data exchange: semantics and query answering
- The strong exponential hierarchy collapses
- On the complexity of core, kernel, and bargaining set
- Minimal-change integrity maintenance using tuple deletions
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison
- Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
- Computing and Explaining Query Answers over Inconsistent DL-Lite Knowledge Bases
- Achieving new upper bounds for the hypergraph duality problem through logic
- Query Rewriting and Optimization for Ontological Databases
- Linking Data to Ontologies
- Graph Ramsey theory and the polynomial hierarchy
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Inconsistency-tolerant query answering for existential rules
