Why is it hard to obtain a dichotomy for consistent query answering?

DOI10.1109/LICS.2013.62MaRDI QIDQ5271093zbMATH OpenFDO

Authors Gaëlle Fontaine

Publication date 3 July 2017

Published in 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/LICS.2013.62

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Why is it hard to obtain a dichotomy for consistent query answering?
• A dichotomy in the complexity of consistent query answering for queries with two atoms
• Consistent query answering for primary keys in Datalog
• On the data complexity of consistent query answering
• Complexity of repair checking and consistent query answering

Cited in

(9)

• Consistent query answering for primary keys in Datalog
• On the data complexity of consistent query answering over graph databases
• On the data complexity of consistent query answering
• Why is it hard to obtain a dichotomy for consistent query answering?
• Mining approximate interval-based temporal dependencies
• Consistent query answering for primary keys in logspace
• On the relationship between consistent query answering and constraint satisfaction problems
• Corrections to: ``On the data complexity of consistent query answering over graph databases
• A dichotomy in the complexity of consistent query answering for queries with two atoms

This page was built for publication: Why is it hard to obtain a dichotomy for consistent query answering?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5271093)