Arenas, M., Bertossi, L.E., Chomicki, J., Consistent query answers in inconsistent databases. PODS, 1999, ACM, 68–79.
Afrati, F.N., Kolaitis, P.G., Repair checking in inconsistent databases: algorithms and complexity. ICDT, 2009, 31–41.
Bertossi, L.E., Database Repairing and Consistent Query Answering, Synthesis Lectures on Data Management. 2011, Morgan & Claypool Publishers.
Koutris, P., Wijsen, J., The data complexity of consistent query answering for self-join-free conjunctive queries under primary key constraints. PODS, 2015, ACM, 17–29.
Maslowski, D., Wijsen, J., A dichotomy in the complexity of counting database repairs. J. Comput. Syst. Sci. 79 (2013), 958–983.
Maslowski, D., Wijsen, J., Counting database repairs that satisfy conjunctive queries with self-joins. ICDT, 2014, 155–164.
Calautti, M., Console, M., Pieris, A., Counting database repairs under primary keys revisited. PODS, 2019, 104–118.
Konieczny, S., Lang, J., Marquis, P., Quantifying information and contradiction in propositional logic through test actions. IJCAI, 2003, Morgan Kaufmann, 106–111.
Grant, J., Hunter, A., Measuring inconsistency in knowledgebases. J. Intell. Inf. Syst. 27 (2006), 159–184.
Hunter, A., Konieczny, S., On the measure of conflicts: Shapley inconsistency values. Artif. Intell. 174 (2010), 1007–1026.
Grant, J., Hunter, A., Measuring consistency gain and information loss in stepwise inconsistency resolution. Symbolic and Quantitative Approaches to Reasoning with Uncertainty - 11th European Conference, Proceedings, ECSQARU 2011, Belfast, UK, June 29-July 1, 2011, 2011, 362–373.
Grant, J., Hunter, A., Analysing inconsistent information using distance-based measures. Int. J. Approx. Reason. 89 (2017), 3–26.
Thimm, M., On the compliance of rationality postulates for inconsistency measures: a more or less complete picture. Künstl. Intell. 31 (2017), 31–39.
Livshits, E., Ilyas, I.F., Kimelfeld, B., Roy, S., Principles of progress indicators for database repairing. CoRR arXiv:1904.06492, 2019.
Bertossi, L.E., Repair-based degrees of database inconsistency. LPNMR, 2019, 195–209.
Provan, J.S., Ball, M.O., The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput. 12 (1983), 777–788.