“What is a minimal set of tuples to delete from a database in order to eliminate all query answers? This problem is called ‘the resilience of a query’ and is one of the key algorithmic problems underlying various forms of reverse data management, such as view maintenance, deletion propagation and causal responsibility. A long-open question is determining the conjunctive queries (CQs) for which resilience can be solved in PTIME. We shed new light on this problem by proposing a unified Integer Linear Programming (ILP) formulation.”

Find the paper and authors list in the ACM on Management of Data conference proceedings.