Centrum Voor Wiskunde En Informatica Reportrapport Simultaneous Replacement in Normal Programs Simultaneous Replacement in Normal Programs

The simultaneous replacement transformation operation, is here deened and studied wrt normal programs. We give applicability conditions able to ensure the correctness of the operation wrt the set of logical consequences of the completed database. We consider separately the cases in which the underlying language is innnite and nite; in this latter case we also distinguish according to the kind of domain closure axioms adopted. As corollaries we obtain results for Fitting's and Kunen's semantics. We also show how simultaneous replacement can mimic other transformation operations such as thinning, fattening and folding, thus producing applicability conditions for them too.