A. Wrzos-Kaminska. Partial evaluation in constraint logic programming. In Z.W. Ras and M. Michalewicz, editors, Proceedings of the 9th International Symposium on Foundations of Intelligent Systems, Lecture Notes in Computer Science 1079, pages 98--107, Zakopane, Poland, 1996. Springer-Verlag. 16  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... of D, we have that: lm(P ; D) j= oe c; A iff lm(P s ; D) j= oe c; A s (1: Contextual Specialization) where, for any program P and domain D, lm(P ; D) denotes the least D model of P [8] Thus, contextual specialization is more general than standard specialization performed via partial evaluation [10,21]. Indeed, in the case of partial evaluation, given a CLP(D) program P and a constrained atom c; A, we derive a program P pe and an atom A pe such that, for every variable assignment oe, we have that: lm(P ; D) j= oe c; A iff lm(P pe ; D) j= oe A pe (2: Partial Evaluation) Notice that every ....

....In Section 4 we introduce the so called invariant promotion strategy for avoiding redundant checks of constraint satisfiability, and reducing the number of arguments of predicates. In Section 5 we compare our contextual specialization technique to related work in the field of partial deduction [10,21] and specialization of programs w.r.t. properties of their context of use [3,19] 2 Rules and Strategies for Partial Evaluation of CLP In this section we introduce a set of transformation rules and a strategy for partial evaluation of CLP programs over a domain D. Our rules differ from those ....

[Article contains additional citation context not shown here]

A. Wrzos-Kaminska. Partial evaluation in constraint logic programming. In Z.W. Ras and M. Michalewicz, editors, Proceedings of the 9th International Symposium on Foundations of Intelligent Systems, Lecture Notes in Computer Science 1079, pages 98--107, Zakopane, Poland, 1996. Springer-Verlag. 16

....protocol veri cation. Program specialization is a methodology whose goal is the automatic adaptation of a program to the context in which it is used. There are two main approaches for achieving program specialization of constraint logic programs: the standard approach based on partial evaluation [10, 11, 16], and the approach based on unfold fold rules [2, 4] In CLP, the context of use is naturally expressed by constraints, which may denote possibly in nite sets of values. In [5, 6] we have investigated the specialization of constraint logic programs w.r.t. properties. In particular, we have ....

A. Wrzos-Kaminska. Partial evaluation in constraint logic programming. In Z.W. Ras and M. Michalewicz, editors, Proceedings of the 9th International Symposium on Foundations of Intelligent Systems, Lecture Notes in Computer Science 1079, pages 98107, Zakopane, Poland, 1996. SpringerVerlag. 5

.... of D, we have that: lm(P ; D) j= c; A i lm(P s ; D) j= c; A s (1: Contextual Specialization) where, for any program P and domain D, lm(P ; D) denotes the least D model of P [8] Thus, contextual specialization is more general than standard specialization performed via partial evaluation [10, 20]. Indeed, in the case of partial evaluation, given a CLP(D) program P and a constrained atom c; A, we want to derive a program P pe and an atom A pe such that, for every variable assignment , we have that: lm(P ; D) j= c; A i lm(P pe ; D) j= A pe (2: Partial Evaluation) Notice that every ....

....by exploiting the knowledge of the context in which predicates are called, we have illustrated two more strategies: i) the context propagation strategy, and (ii) the invariant promotion strategy. These strategies make use of the contextual constraint replacement rule. 8 Finally, the papers [10, 20] report on some correctness results for partial deduction, that is, partial evaluation of logic programs based on Lloyd and Shepherdson s approach [12] Apart from some technical issues that make partial deduction di erent from program specialization based on unfolding folding rules, we would like ....

[Article contains additional citation context not shown here]

A. Wrzos-Kaminska. Partial evaluation in constraint logic programming. In Z.W. Ras and M. Michalewicz, editors, Proceedings of the 9th International Symposium on Foundations of Intelligent Systems, Lecture Notes in Computer Science 1079, pages 981, Zakopane, Poland, 1996. Springer-Verlag. 10

....to direct the use of each transformation rule and, in particular, we address the crucial problem of using the de nition rule to introduce new predicate de nitions. Finally, in Section 5 we compare our method for specializing CLP programs to existing methods for partial evaluation of CLP programs [11, 20] based on extensions Contextual Specialization of Constraint Logic Programs of Lloyd and Shepherdson s approach [13] also called partial deduction in the literature) and we also compare our method to other specialization techniques based on the unfold fold transformation rules [2, 7] 2 ....

....[7, 17, 18] Our folding rule is more powerful than the ones considered in those papers and, besides that, we have shown in the matching example that our contextual constraint replacement rule may play an important role in improving the eciency of the specialized program. Finally, the papers [11, 20] report on some correctness results for partial deduction, that is, partial evaluation of logic programs based on Lloyd and Shepherdson s approach [13] Besides various technical issues that make partial deduction and unfolding folding based program specialization di erent, we would like to point ....

[Article contains additional citation context not shown here]

A. Wrzos-Kaminska. Partial evaluation in constraint logic programming. In Z.W. Ras and M. Michalewicz, editors, Proceedings of the 9th International Symposium on Foundations of Intelligent Systems, Lecture Notes in Computer Science 1079, pages 98-107, Zakopane, Poland, 1996. Springer-Verlag.

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