W. Vanhoof, D. De Schreye, and B. Martens. A framework for bottom up specialisation of logic programs. In C. Palamidessi, H. Glaser, and K. Meinke, editors, Proceedings of the Joint International Symposia PLILP/ALP 1998, volume 1490 of Lecture Notes In Computer Science, pages 54-72. Springer-Verlag, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Framework for Bottom-up Specialisation of Logic Programs - Vanhoof, al. (1998) (4 citations) (Correct)
....respect to the definition of an abstract data type. Top down, goal directed specialisation often is not the most natural approach to achieve this kind of specialisation. 2 A Framework for Bottom up Specialisation The most important contribution of this work, the details of which can be found in [5], is the definition of a formal framework, capturing the notion of bottom up partial deduction. The transformation is based on a non ground T P operator, T C P , acting on sets of clauses instead of atoms, as in compositional semantics [2, 1] In order to define a finitary transformation, the ....
W. Vanhoof, D. De Schreye, and B. Martens. A framework for bottom up specialisation of logic programs. In Proceedings of the Joint International Symposia PLILP/ALP 1998, volume 1490 of Lecture Notes In Computer Science, pages 54--72. SpringerVerlag, 1998.
Bottom-up Specialisation of Logic Programs - Vanhoof, De Schreye, Martens (1998) (1 citation) (Correct)
....before (see e.g. 3] However, to the best of our knowledge, our ongoing effort is the first attempt to achieve these in a completely general and automatic way. 2 A Framework for Bottom up Specialisation The most important contribution of this work, the details of which can be found in [7], is the definition of a formal framework, capturing the notion of bottom up partial deduction. The transformation is based on a non ground TP operator, T C P , acting on sets of clauses instead of atoms, as in compositional semantics [2, 1] In order to define a finitary transformation, the ....
W. Vanhoof, D. De Schreye, and B. Martens. A framework for bottom up specialisation of logic programs. In Proceedings of the Joint International Symposia PLILP/ALP 1998, volume 1490 of Lecture Notes In Computer Science, pages 54--
Techniques for on- and Off-Line Specialisation of Logic Programs - Vanhoof (Correct)
....trip naar Australie en zo een werkbezoek om te vormen tot een prachtige mix van hard werken en vakantie, maar hen beide om een fantastische sfeer op bureau te creeren inclusief de vele aangename ko#epauzes maar bovenal om gewoonweg de beste bureaugenootjes ooit te zijn. Bedankt. Wim Vanhoof, juni 2001. v David Je#rey, David Overton, Peter Ross, Mark Brown and Anthony Senyard for explaining over and over again several implementation issues of the Melbourne Mercury compiler, but most of all for providing an environment which made my visit to Australia an unmatched and unforgettable ....
....me on a wonderful trip to Australia, as such transforming a work visit into a wonderful blend of hard work and holidays, but both of them for creating a fantastic atmosphere at the o#ce including the many pleasant co#ee breaks and simply for being the very best o#ce mates ever. Thanks. Wim Vanhoof, June 2001. vi PREFACE Structure of the Thesis This text describes research that was performed between October 1996 and December 2000. The text is structured as follows. The first two chapters are introductory chapters of which the first one aims at providing a gentle, informal and non technical ....
[Article contains additional citation context not shown here]
Vanhoof, W., D. D. Schreye, and B. Martens (1998c). A framework for bottom up specialisation of logic programs (abstract). In H. L. Poutre and J. van den Herik (Eds.), Proceedings of the 10th Netherlands/Belgium Conference on Artificial Intelligence (NAIC'98), pp. 277 -- 278.
Techniques for on- and Off-Line Specialisation of Logic Programs - Vanhoof (Correct)
.... conference ix proceedings, being joint work with Bern Martens, Danny De Schreye and Karel De Vlaminck (Vanhoof, Martens, Schreye, and Vlaminck 1998) This work was generalised into a framework of bottom up partial deduction, published in the LOPSTR 98 proceedings in the form of a small abstract (Vanhoof, Schreye, 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, ....
.... (Vanhoof, Martens, Schreye, and Vlaminck 1998) This work was generalised into a framework of bottom up partial deduction, published in the LOPSTR 98 proceedings in the form of a small abstract (Vanhoof, Schreye, 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, ....
[Article contains additional citation context not shown here]
Vanhoof, W., D. D. Schreye, and B. Martens (1998b). A framework for bottom up specialisation of logic programs. In C. Palamidessi, H. Glaser, and K. Meinke (Eds.), Proceedings of the Joint International Symposia PLILP/ALP 1998, Volume 1490 of Lecture Notes In Computer Science, Pisa, Italy, pp. 54--72. Springer-Verlag.
A Fixed Point Semantics for Logic Programs Extended.. - Vanhoof.. Self-citation (Vanhoof) (Correct)
No context found.
W. Vanhoof, D. De Schreye, and B. Martens. A framework for bottom up specialisation of logic programs. In C. Palamidessi, H. Glaser, and K. Meinke, editors, Proceedings of the Joint International Symposia PLILP/ALP 1998, volume 1490 of Lecture Notes In Computer Science, pages 54-72. Springer-Verlag, 1998.
Bottom-up Transformation for Programs with Procedural Control - Vanhoof, Bruynooghe Self-citation (Vanhoof) (Correct)
....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. A framework for bottom up specialisation of logic programs. In C. Palamidessi, H. Glaser, and K. Meinke, editors, Proceedings of the Joint International Symposia PLILP/ALP 1998, volume 1490 of Lecture Notes In Computer Science, pages 54-72. Springer-Verlag, 1998.
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