Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?
From MaRDI portal
Publication:5271093
DOI10.1109/LICS.2013.62zbMath1366.68033MaRDI QIDQ5271093
Publication date: 3 July 2017
Published in: 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
On the data complexity of consistent query answering ⋮ On the data complexity of consistent query answering over graph databases ⋮ Mining approximate interval-based temporal dependencies ⋮ Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering? ⋮ Unnamed Item
This page was built for publication: Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?
