On the data complexity of consistent query answering
From MaRDI portal
Publication:269317
DOI10.1007/s00224-014-9586-0zbMath1352.68082OpenAlexW2029695031MaRDI QIDQ269317
Phokion G. Kolaitis, Balder ten Cate, Gaëlle Fontaine
Publication date: 18 April 2016
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-014-9586-0
Related Items (6)
On the data complexity of consistent query answering ⋮ Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering? ⋮ Paraconsistent logic and query answering in inconsistent databases ⋮ On the Complexity of Finding Set Repairs for Data-Graphs ⋮ An epistemic approach to model uncertainty in data-graphs ⋮ Complexity thresholds in inclusion logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the data complexity of consistent query answering
- On the finite controllability of conjunctive query answering in databases under open-world assumption
- Data exchange: semantics and query answering
- The core of a graph
- A dichotomy in the complexity of consistent query answering for queries with two atoms
- First-order query rewriting for inconsistent databases
- A remark on the complexity of consistent conjunctive query answering under primary key violations
- Minimal-change integrity maintenance using tuple deletions
- Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
- Efficient core computation in data exchange
- XPath satisfiability in the presence of DTDs
- Data exchange: getting to the core
- Horn clauses and database dependencies
- Answer sets for consistent query answering in inconsistent databases
- Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?
- Querying the Guarded Fragment
This page was built for publication: On the data complexity of consistent query answering
