W. Vanhoof, D. De Schreye, and B. Martens. Bottom-up partial deduction of logic programs. The Journal of Functional and Logic Programming, 1999:1-33, 1999.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Techniques for on- and Off-Line Specialisation of Logic Programs - Vanhoof (Correct)
....and Martens 1998a) and in more detail in the PLILP 98 conference proceedings (Vanhoof, Schreye, and Martens 1998b) Both papers were co authored by Danny De Schreye and Bern Martens. An elaborated version of the PLILP 98 paper was published in the Journal of Functional and Logic Programming (Vanhoof, Schreye, and Martens 1999), while an abstract appeared in the NAIC 98 conference proceedings (Vanhoof, Schreye, and Martens 1998c) An extended abstract of the material presented in Chapter 5 (joint work with Maurice Bruynooghe) on binding time analysis by termination analysis was presented at the Fifth International ....
Vanhoof, W., D. D. Schreye, and B. Martens (1999). Bottom-up partial deduction of logic programs. The Journal of Functional and Logic Programming 1999, 1--33.
A Fixed Point Semantics for Logic Programs Extended.. - Vanhoof.. Self-citation (Vanhoof) (Correct)
No context found.
W. Vanhoof, D. De Schreye, and B. Martens. Bottom-up partial deduction of logic programs. The Journal of Functional and Logic Programming, 1999:1-33, 1999.
Bottom-up Transformation for Programs with Procedural Control - Vanhoof, Bruynooghe Self-citation (Vanhoof) (Correct)
....process. The result of these partial derivations is recorded in a new program, the specialised program, which can be evaluated for instances of the partial deduction query. Partial deduction can also be achieved by propagating information upwards in the program, starting from the unit clauses [9, 26]. In this case, the resulting program is not specialised for a particular query but, due to the upward propagation of information, solving a query in the resulting program might again require substantially less computation than in the original program. Example 1. Assume we have the program ....
....P ) indeed is nite, sine the programs constituting the ILP problem often lack recursion. If lfp(T P ) is not nite, one should endorse T P with abstraction and generate a nite set of partial bottom up derivations rather than an in nite set of complete bottom up derivations. In previous work [26, 25] we have shown that this can be achieved by rede ning the immediate consequences operator over a domain of clauses, rather than atoms (like e.g. in [5, 6] and combining it with an abstraction function that replaces a clause A B that represents a partial derivation under construction with a ....
W. Vanhoof, D. De Schreye, and B. Martens. Bottom-up partial deduction of logic programs. The Journal of Functional and Logic Programming, 1999:1-33, 1999.
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