S. Etalle and M. Gabbrielli. A transformation system for modular CLP programs. In L. Sterling, editor, Proceedings of the 12th International Conference on Logic Programming, pages 681-695. The MIT Press, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Constrained Partial Deduction and the Preservation of.. - Leuschel, De Schreye (1997) (7 citations) (Correct)
....words, if there is no SLD refutation for P [ f Qg then there 7 As the conjunction Q contains no quantifiers, vars(Q) are the free variables of Q. 17 should be no CLP refutation for any P [ f c 2Qg either. To ensure this property we use the following definition of a derivation, adapted from [16], in which substitutions are made explicit. This will also enable us to construct resultants in a straightforward manner. Definition 4.1 Let CG = c 2L 1 ; L k a CLP goal and C = A B 1 ; B n a program clause such that k 1 and n 0. Then CG 0 is derived from CG and C in D ....
....the correctness will become much more difficult because one cannot reuse the correctness results of standard partial deduction. In that context, we would like to mention [66] which extends constructive negation for CLP programs, as well as recent work on the transformation of CLP programs [16]. Note, however, that [16] is situated within the unfold fold transformation paradigm and also that no concrete algorithms are presented. Finally, let us mention a recent extension of partial deduction, called conjunctive partial deduction [39, 22] Conjunctive partial deduction handles ....
[Article contains additional citation context not shown here]
S. Etalle and M. Gabbrielli. A transformation system for modular CLP programs. In L. Sterling, editor, Proceedings of the 12th International Conference on Logic Programming, pages 681--695. The MIT Press, 1995.
Constrained Partial Deduction - Leuschel, De Schreye (1997) (4 citations) (Correct)
....in an unsound manner. For instance, something like a = b should not succeed. In other words, if there is no SLD refutation for P [ f Qg then there should be no CLP refutation for any P [ f c 2Qg either. To ensure this property we use the following definition of a derivation, adapted from [7], in which substitutions are made explicit. This will also enable us to construct resultants in a straightforward manner. Definition 3.1 Let CG = c 2L 1 ; L k a CLP goal and C = A B 1 ; B n a program clause 5 such that k 1 and n 0. Then CG 0 is derived from CG and C in D ....
....the correctness will become much more difficult because one cannot reuse the correctness results of standard partial deduction. In that context, we would like to mention [33] which extends constructive negation for CLP programs, as well as recent work on the transformation of CLP programs [7]. Note, however, that [7] is situated within the unfold fold transformation paradigm and also that no concrete algorithms are presented. Finally, let us mention a recent extension of partial deduction, called conjunctive partial deduction [23, 13, 21] Conjunctive partial deduction handles ....
[Article contains additional citation context not shown here]
S. Etalle and M. Gabbrielli. A transformation system for modular CLP programs. In L. Sterling, editor, Proceedings of the 12th International Conference on Logic Programming, pages 681--695. The MIT Press, 1995.
Transformations of CLP Modules - Etalle, Gabbrielli (1995) (2 citations) Self-citation (Etalle Gabbrielli) (Correct)
....Amsterdam, The Netherlands. The research of the first author has been partially supported by the ERCIM Fellowship Program. The research of the second author has been supported by the EC HCM network EUROFOCS under grant n. ERBCHBGCT930496. A preliminary, shorter version of this paper appeared in [11]. 1 Introduction As shown by a number of applications, programs transformation is a powerful methodology for the development and optimization of large programs. In this field, the unfold fold transformation rules were first introduced by Burstall and Darlington [9] for transforming declaratively ....
S. Etalle and M. Gabbrielli. A Transformation System for Modular CLP Programs. In Proc. Twelfth Int'l Conf. on Logic Programming, ICLP 95. The MIT Press, Cambridge, Mass., 1995.
Advanced Techniques for Logic Program Specialisation - Leuschel (1997) (10 citations) (Correct)
No context found.
S. Etalle and M. Gabbrielli. A transformation system for modular CLP programs. In L. Sterling, editor, Proceedings of the 12th International Conference on Logic Programming, pages 681-695. The MIT Press, 1995.
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