S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
P. Andritsos, A. Fuxman, and R. J. Miller. Clean answers over dirty databases: A probabilistic approach. In L. Liu, A. Reuter, K.-Y. Whang, and J. Zhang, editors, ICDE, page 30. IEEE Computer Society, 2006. (Pubitemid 44539822)
M. Arenas, L. E. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. In PODS, pages 68-79. ACM Press, 1999.
M. Arenas, L. E. Bertossi, J. Chomicki, X. He, V. Raghavan, and J. Spinrad. Scalar aggregation in inconsistent databases. Theor. Comput. Sci., 296(3):405-434, 2003.
N. Dalvi, C. Re, and D. Suciu. Queries and materialized views on probabilistic databases. Journal of Computer and System Sciences, In Press, Corrected Proof, 2010.
N. N. Dalvi, C. Re, and D. Suciu. Probabilistic databases: diamonds in the dirt. Commun. ACM, 52(7):86-94, 2009.
N. N. Dalvi and D. Suciu. Management of probabilistic data: foundations and challenges. In L. Libkin, editor, PODS, pages 1-12. ACM, 2007. (Pubitemid 47620875)
A. Fuxman and R. J. Miller. First-order query rewriting for inconsistent databases. J. Comput. Syst. Sci., 73(4):610-635, 2007. (Pubitemid 46440977)
S. Greco and C. Molinaro. Approximate probabilistic query answering over inconsistent databases. In Q. Li, S. Spaccapietra, E. S. K. Yu, and A. Olive, editors, ER, volume 5231 of Lecture Notes in Computer Science, pages 311-325. Springer, 2008.
J. Huang, L. Antova, C. Koch, and D. Olteanu. MayBMS: a probabilistic database management system. In U. Cetintemel, S. B. Zdonik, D. Kossmann, and N. Tatbul, editors, SIGMOD Conference, pages 1071-1074. ACM, 2009.
D. C. Kozen. The design and analysis of algorithms. Springer-Verlag New York, Inc., New York, NY, USA, 1992.
C. M. Papadimitriou. Computational complexity. Addison-Wesley, Reading, Massachusetts, 1994.
S. Toda. PP is as hard as the polynomial-time hierarchy. SIAM J. Comput., 20(5):865-877, 1991. (Pubitemid 21710211)
J. Wijsen. On the consistent rewriting of conjunctive queries under primary key constraints. Inf. Syst., 34(7):578-601, 2009.
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.
