First-order under-approximations of consistent query answers

DOI10.1016/J.IJAR.2016.10.005zbMATH Open1404.68038OpenAlexW2542812191MaRDI QIDQ518631

Floris Geerts, Jef Wijsen, Fabian Pijcke

Publication date: 29 March 2017

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2016.10.005

zbMATH Keywords

conjunctive queriesconsistent query answeringprimary key

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances in Databases and Information Systems
• Elements of finite model theory.
• Minimal-change integrity maintenance using tuple deletions
• SQL's Three-Valued Logic and Certain Answers
• A dichotomy in the complexity of counting database repairs
• Queries and materialized views on probabilistic databases
• Database Theory - ICDT 2005
• Optimizing the marriage market: an application of the linear assignment model
• Foundations of data quality management
• A Survey of the Data Complexity of Consistent Query Answering under Key Constraints

This page was built for publication: First-order under-approximations of consistent query answers

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