Logic program transformation

In this paper we have presented a meta-logical framework for reasoning with ontologies and rules expressed in OWL 2. The logical system of our framework consists of meta-programs transformed from ontologies and rules expressed in... 

In order to give a rough feel for transformational synthesis of logic programs, we first present the pioneering mechanism in some detail. Then, we cite the achievements of some of the more recent mechanisms. 

Folding/unfolding transformations were the object of a first formal study in logic programming by [Tamaki and Sato 84], although these transformations were already present in the above-mentioned symbolic execution synthesis approaches. 

The work of [Waldau 92] is a first step towards proving the validity of transformation rules for logic programs. 

Stage C Derivation of a logic program (and possibly its transformation). 

This chapter is organized as follows. In Section 4.1, we discuss the elaboration of specifications. Section 4.2 is about the design of logic algorithms, whereas Section 4.3 is about their transformation. Section 4.4 describes the derivation of logic programs, whereas Section 4,5 describes their transformation. 

Example 4-11 For the compress problem. Figure 4-4 gives a transformed version of the logic program in Figure 4-3. 

LOPSTR = International Workshop on LOgic Program Synthesis and TRansformation... 

K.-K. Lau and M. Omaghi. A formal view of specification, deductive synthesis and transformation of logic programs. In [Deville 94], pp. 10-31. 

T. Sato and H. Tamaki. Transformational logic program synthesis. In Proc. of the Int l Conf. on Fifth-Generation Computer Systems, pp. 195-201,1984. 

H. Tamaki and T. Sato. Unfold/fold transformations of logic programs. In S.-A. Tarnlund (ed), Proc. ofICLP S4, pp. 127-138. 

G. Wiggins. Synthesis and transformation of logic programs in the Whelk proof development system. In K. Apt (ed), Proc. of the 1992 Joint hit I Conf. and Symp. on Logic Programming, pp. 351-365, MIT Press, 1992. 

G. Wiggins, A. Bundy, I. Kraan, and J. Hesketh. Synthesis and transformation of logic programs from constructive, inductive proof. In [Clement and Lau 92], pp. 27 5. 

Writing a transform is similar to writing a computer program. When there is a large amount known about a reaction, the result can be a very long and logically complex structure. In order to streamline this procedure, it has been divided into several... 

---