We propose a new method for generating consistency-preserving transaction programs for (view-)updates in deductive databases. The method augments the deductive database schema with a set of transition and internal event rules, which explicitly define the database dynamic behaviour in front of an update. At transaction-design-time, a formal procedure can use these rules to automatically generate parameterised transaction programs for base or view-update transaction requests. This is done in such a way that those transactions will never take the database into an inconsistent state. The method has been implemented in Prolog using meta-programming techniques.