, A. Bossi 1 and N. Cocco 2 S. Etalle , Dipartimento di Matematica Pura ed Applicata, Universtia di Padova, Via Belzoni 7, 35131 Padova, Italy and 2Dipartimento di Informatica, Universita di Venezia-Ca' Foscari, Via Torino 155, Mestre-Venezia, Italy 3CWI PO Box 94079, 1090 GB Amsterdam, The Netherlands
The simultaneous replacement transformation operation, is here defined 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 infinite and finite; 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.
Program's transformation, logic programming, semantics, negation, replacement
Part of the OUP Journal of Logic and Computation WWW service
Click here to register with OUP.
This page is maintained by OUP admin
Last updated 29 Mar 96
Part of the OUP Journals World Wide Web service.
Copyright Oxford University Press, 1996