T. Kanamori and K. Horiuchi. Construction of logic programs based on generalized unfold/fold rules. In Proceedings of the Fourth International Conference on Logic Programming, pages 744768. The MIT Press, 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....decades there has been a fruitful interaction between unfold fold program transformation and program synthesis. To illustrate this point, let us recall here the program synthesis methods based on derivation rules, such as the one proposed by Hogger [32] and, along similar lines, those reported in [34,35,42,68,69] which make use of derivation rules similar to the unfold fold rules. In this regard, the speci c contribution of our chapter consists in providing a method for program synthesis which ensures the correctness w.r.t. the perfect model semantics. Also related to our rules and strategies approach, ....

T. Kanamori and K. Horiuchi. Construction of logic programs based on generalized unfold/fold rules. In Proceedings of the Fourth International Conference on Logic Programming, pages 744768. The MIT Press, 1987.

....present in this section, preserves both soundness and completeness. Variants of the above transformation rules can be shown to be correct w.r.t. richer logic languages and other program semantics (see, for instance, Aravindan Dung 93, Bossi Cocco 93, Bossi Cocco Etalle 92, GardnerShepherdson 91, Kanamori Horiuchi 87, Kawamura Kanamori 88, Maher 93, Proietti Pettorossi 91a, Sato 92, Seki 91, Seki 93] and [Pettorossi Proietti 94] for an overview) 3.2 Transformation Strategies for Logic Programs Here we list some of the strategies we use for transforming logic programs. i) Predicate Tupling Strategy. This ....

Kanamori, T., Horiuchi, K.: Construction of Logic Programs Based on Generalized Unfold/Fold Rules. Proceedings of the Fourth International Conference on Logic Programming, The MIT Press (1987) 744--768

.... the application of these techniques to recursion removal from functions [2] The application of unfold fold transformations to recursion removal in logic programs has been considered by Bloch [4] Debray [9] and more recently by Azibi et al. 3] Tamaki and Sato [18] and Kanamori and Horiuchi [12], have investigated the theory of unfold fold transformation systems for logic programs. Other applications of unfold fold transformation systems to logic programming include improvement of tree manipulation programs [15] and of generate and test programs [16] We assume some acquaintance with ....

T. Kanamori and K. Horiuchi, Construction of Logic Programs Based on Generalized Unfold/Fold Rules, in Proc. Fourth International Conference on Logic Programming, Melbourne, Australia, May 1987, pp. 744-768.

....P , 2. or C is deleted from P , if the query A has an SLDNF refutation in P . Gardner and Shepherdson s unfolding rule w.r.t. negative literals can be expressed in terms of the goal replacement rule (in case 1) and the clause deletion rule (in case 2) These rules will be introduced below. Also Kanamori and Horiuchi [ 1987 ] and Sato [ 1992 ] allow unfolding steps w.r.t. negative literals. However, their notion of program goes beyond 14 Alberto Pettorossi and Maurizio Proietti the definition of logic program which we consider here, and their transformation rules may more properly be regarded as rules for logic ....

T. Kanamori and K. Horiuchi. Construction of logic programs based on generalized unfold/fold rules. In Proceedings of the Fourth International Conference on Logic Programming, pages 744--768. The MIT Press, 1987.

....or clause replacement , but Theorems 15 and 16 from [62] cannot be applied because different folding rules are used. 68] allows unfolding inside negation and works with first order formulas, but it still has to be investigated whether its results (for Kleene s 3 valued logic) can be used. Also [32] has a negative unfolding rule (under certain termination conditions) but this rule (along with the correctness theorems) is situated in the context of deriving definite logic programs from first order specifications. So, for the moment, there seems to be no conjunctive equivalent to the ....

T. Kanamori, K. Horiuichi. Construction of logic programs based on generalized unfold/fold rules. In J.-L. Lassez (ed.), Proceedings of the 4th International Conference on Logic Programming, 744--768, MIT Press, 1987.

No context found.

T. Kanamori and K. Horiuchi. Construction of logic programs based on generalized unfold/fold rules. In Proceedings of the Fourth International Conference on Logic Programming, pages 744768. The MIT Press, 1987.

No context found.

T. Kanamori and K. Horiuichi. Construction of logic programs based on generalized unfold/fold rules. In J.-L. Lassez, editor, Proceedings of the 4th International Conference on Logic Programming, pages 744{ 768. The MIT Press, 1987.

No context found.

Kanamori, T. & Horiuchi, K. (1987). Construction of Logic Programs Based on Generalized Unfold/Fold Rules. Proceedings of the 4 International Conference on Logic Programming, th Melbourne, Australia, 744-768.

No context found.

T. Kanamori and K. Horiuchi. Construction of logic programs based on generalized unfold/fold rules. In Proc. 4 th Int. Conf. on Logic Programming, Melbourne, pages 744--768, 1987.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC