Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

META
1992

favoriteEmaildiscussreport

192views Automated Reasoning» more META 1992»

Transforming Normal Programs by Replacement

13 years 9 months ago

Transforming Normal Programs by Replacement

Download doc.utwente.nl

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.

Annalisa Bossi, Nicoletta Cocco, Sandro Etalle

Real-time Traffic

Applicability Conditions | Automated Reasoning | Kunen's Semantics | META 1992 | Transformation Operations |

claim paper

Related Content

» A Transformation System for Definite Programs Based on Termination Analysis

» Transformations for Model Checking Distributed Java Programs

» SMART C A Semantic Macro Replacement Translator for C

» Beyond TamakiSato Style UnfoldFold Transformations for Normal Logic Programs

» More on UnfoldFold Transformations of Normal Programs Preservation of Fittings Semantics

» Using Nested Logic Programs for Answer Set Programming

» Identifying Procedural Structure in Cobol Programs

» A New OnePass Transformation into Monadic Normal Form

» On the Existence of Answer Sets in Normal Extended Logic Programs

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1992
Where	META
Authors	Annalisa Bossi, Nicoletta Cocco, Sandro Etalle

Comments (0)