To find a minimal real change after an update of a database with integrity constraints (IC) expressed by a generalized logic program with explicit negation is proven to be a Σ^stackp _stack2-complete problem. We define a class of operators expanding the input updates correctly with respect to the IC. The particular monotone expansion operator we describe is incrementally computed in square time. It provides a practical optimization of the standard complete choice algorithm resolving the update problem.