Generic rules for logic representation transformations

Programs expressed using logic representations can be more easily analysed and transformed. Transformations will depend on the target language semantics. A field encapsulation refactorization will be different for a Java program and an Eiffel program. Logic based representations of programs and its metamodel allows writing generic rules capable of performing some language independent transformations like: syntactical and semantical checking, searching specific nodes, cloning node structures, replacing references, generating fact visualizations. An example is given in this sense related to the implementation of feature body exheritance mechanism of reverse inheritance class relationship in the context of Eiffel language.