Transforming Normal Programs by Replacement

The replacement transformation operation, already defined in [28], is studied wrt normal programs. We give applicability conditions able to ensure the correctness of the operation wrt Fitting's and Kunen's semantics. We show how replacement can mimic other transformation operations such as thinning, fattening and folding, thus producing applicability conditions for them too. Furthermore we characterize a transformation sequence for which the preservation of Fitting's and Kunen's semantics is ensured.

• Type: Conference
• Year: 1992
• Where: META
• Authors: Annalisa Bossi, Nicoletta Cocco, Sandro Etalle
• Keywords: Applicability Conditions, Automated Reasoning, Kunen's Semantics, META 1992, Transformation Operations