Kim Marriott and Peter J. Stuckey. The 3 r's of optimizing constraint logic programs: Refinement, removal and reordering. In POPL'93: Procccdizgs ACM SIGPLAN Symposium o Prizciplcs of Programmizg Lazguagcs, Charleston, January 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....If, for each successful derivation truc [ t) P d[ T7) I: 3 Vat(H) C1 A d 3 Vat(H)C 2 A d holds, then replacing c by c2 in cl consists in substituting cl by H c2 [ in P. Constraint replacement has sonhe sinhilarities with the refinement operation as defined by Marriott and Stuckey in [73]. Refinement allows to add a constrain c to a program clause H cl [ provided that (for a given set of initial queries of interest) for any answer constraint d of cl [ D I = d c holds, i.e. c is redundant in d. Clearly this case is covered by our definition. However, the sinhilarities ....

....a constrain c to a program clause H cl [ provided that (for a given set of initial queries of interest) for any answer constraint d of cl [ D I = d c holds, i.e. c is redundant in d. Clearly this case is covered by our definition. However, the sinhilarities between this chapter and [73] end here. In [73] refinement, together with two other operations, is used to define an optimization strategy which manipulates exclusively the constraints of the clauses and which is devised to reduce the overhead of the constraint solver in presence of the fixed left to right selection rule, ....

[Article contains additional citation context not shown here]

Kim Marriott and Peter J. Stuckey. The 3 r's of optimizing constraint logic programs: Refinement, removal and reordering. In POPL'93: Procccdizgs ACM SIGPLAN Symposium o Prizciplcs of Programmizg Lazguagcs, Charleston, January 1993.

....of use. Among these methods we would like to mention: i) the methods for specializing logic programs presented in [2,15] ii) the method for multiple specialization of logic programs presented in [19] iii) the method for reducing the workload of the constraint solving engine presented in [14], and (iv) the method for parameterized partial evaluation of functional programs presented in [3] In [2,15] the authors present very general approaches to the specialization of definite logic programs w.r.t. properties which, however, do not seem to be amenable to full mechanization. In ....

....approach is presented in [19] where a technique for the implementation of multiple specialization is proposed. This technique produces a polyvariant specialized program which contains different, optimized versions of the same predicate for different uses. The aim of the work presented in [14] is to transform a standard CLP program into a non monotonic CLP program, that is, a program in which addition of the constraints to the store is delayed until it becomes really necessary and constraints are removed from the store as soon as they become redundant. This approach requires a more ....

[Article contains additional citation context not shown here]

Kim Marriott and Peter J. Stuckey. The 3 R's of Optimizing Constraint Logic Programs: Refinement, Removal and Reordering. In Proceedings 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '93), pages 334--344. ACM Press, 1993.

....derivation true 2 B P ; d, D j= 9 GammaV ar(H) c 1 d 9 GammaV ar(H) c 2 d holds, then replacing c 1 by c 2 in cl consists in substituting cl by H c 2 2 B in P . 2 Constraint replacement has some similarities with the refinement operation as defined by Marriott and Stuckey in [30]. Refinement allows us to add a constrain c to a program clause H c 1 2 B, provided that (for a given set of initial queries of interest) for any answer constraint d of c 1 2 B, D j= d c holds, i.e. c is redundant in d. Clearly this case is covered by our definition. However, the ....

....add a constrain c to a program clause H c 1 2 B, provided that (for a given set of initial queries of interest) for any answer constraint d of c 1 2 B, D j= d c holds, i.e. c is redundant in d. Clearly this case is covered by our definition. However, the similarities between this paper and [30] end here. In [30] refinement, together with two other operations, is used to define an optimization strategy which manipulates exclusively the constraints of the clauses and which is devised to reduce the overhead of the constraint solver in presence of the fixed left to right selection rule, ....

[Article contains additional citation context not shown here]

Kim Marriott and Peter J. Stuckey. The 3 r's of optimizing constraint logic programs: Refinement, removal and reordering. In POPL'93: Proceedings ACM SIGPLAN Symposium on Principles of Programming Languages, Charleston, January 1993.

....is now the study of optimization techniques for programs and modules. Concerning specifically the CLP paradigm, the literature on this subject can be divided into two main branches. On one hand we find methods which focus exclusively on the manipulation of the constraint for compile time [30] and for low level local optimization (in which the constraint solving may be partially compiled into imperative statements) 23] Compile time optimizations based on static analysis have also been investigated [29] On the other hand there are techniques such as the unfold fold transformation ....

Kim Marriott and Peter J. Stuckey. The 3 r's of optimizing constraint logic programs: Refinement, removal and reordering. In POPL'93: Proceedings ACM SIGPLAN Symposium on Principles of Programming Languages, Charleston, January 1993.

....is now the study of optimization techniques for programs and modules. Concerning specifically the CLP paradigm, the literature on this subject can be divided into two main branches. On one hand we find methods that focus exclusively on the manipulation of the constraints for compile time [MS93] and for lowlevel local optimization (in which the constraint solving may be partially compiled into imperative statements) JMM91] Compile time optimizations based on static analysis have also been investigated [MS90] On the other hand, there are techniques such as the unfold fold ....

Kim Marriott and Peter J. Stuckey. The 3 R's of optimizing constraint logic programs: Refinement, removal and reordering. In POPL'93: Proceedings ACM SIGPLAN Symposium on Principles of Programming Languages, New York, NY, January 1993. ACM Press.

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