M. Arenas, L. E. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. In PODS, pages 68-79. ACM Press, 1999.
B. Aspvall, M. F. Plass, and R. E. Tarjan. A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett., 8(3):121-123, 1979.
C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the desirability of acyclic database schemes. J. ACM, 30(3):479-513, 1983.
L. E. Bertossi. Database Repairing and Consistent Query Answering. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, 2011.
A. A. Bulatov. Complexity of conservative constraint satisfaction problems. ACM Trans. Comput. Log., 12(4):24, 2011.
G. Fontaine. Why is it hard to obtain a dichotomy for consistent query answering? In LICS, pages 550-559. IEEE Computer Society, 2013.
A. Fuxman and R. J. Miller. First-order query rewriting for inconsistent databases. In T. Eiter and L. Libkin, editors, ICDT, volume 3363 of Lecture Notes in Computer Science, pages 337-351. Springer, 2005.
P. G. Kolaitis and E. Pema. A dichotomy in the complexity of consistent query answering for queries with two atoms. Inf. Process. Lett., 112(3):77-85, 2012.
P. Koutris and D. Suciu. A dichotomy on the complexity of consistent query answering for atoms with simple keys. In Schweikardt et al. [15], pages 165-176.
P. Koutris and J. Wijsen. A trichotomy in the data complexity of certain query answering for conjunctive queries. CoRR, abs/1501.07864, 2015.
L. Libkin. Elements of Finite Model Theory. Springer, 2004.
D. Maslowski and J. Wijsen. A dichotomy in the complexity of counting database repairs. J. Comput. Syst. Sci., 79(6):958-983, 2013.
D. Maslowski and J. Wijsen. Counting database repairs that satisfy conjunctive queries with self-joins. In Schweikardt et al. [15], pages 155-164.
G. J. Minty. On maximal independent sets of vertices in claw-free graphs. J. Comb. Theory, Ser. B, 28(3):284-304, 1980.
N. Schweikardt, V. Christophides, and V. Leroy, editors. Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014. OpenProceedings.org, 2014.
J. Wijsen. On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases. In J. Paredaens and D. V. Gucht, editors, PODS, pages 179-190. ACM, 2010.
J. Wijsen. A remark on the complexity of consistent conjunctive query answering under primary key violations. Inf. Process. Lett., 110(21):950-955, 2010.
J. Wijsen. Certain conjunctive query answering in first-order logic. ACM Trans. Database Syst., 37(2):9, 2012.
J. Wijsen. Charting the tractability frontier of certain conjunctive query answering. In R. Hull and W. Fan, editors, PODS, pages 189-200. ACM, 2013.
J. Wijsen. A survey of the data complexity of consistent query answering under key constraints. In C. Beierle and C. Meghini, editors, Foundations of Information and Knowledge Systems-8th International Symposium, FoIKS 2014, Bordeaux, France, March 3-7, 2014. Proceedings, volume 8367 of Lecture Notes in Computer Science, pages 62-78. Springer, 2014.
