Abstract
Partial deduction is an important transformation technique for logic programs, capable of removing inefficiencies from programs [4,5]. As an on-line specialisation technique, it is based on an evaluation mechanism for logic programs. The input to a typical partial deducer is a program and a partially instantiated query. The instantiated part represents the information with respect to which one would like to specialise; the uninstantiated part represents the information not yet known. Therefore, all classical partial deduction techniques use top-down evaluation (or SLD-resolution) to evaluate the program parts that depend on the known input and generate a new program that computes its result using only the remainder of the input. Since the new program has less computations to perform, in general, it will be more efficient.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli. The S-semantics approach: Theory and applications. Journal of Logic Programming, 19/20:149–197, 1994.
A. Bossi, M. Gabbrielli, G. Levi, and M. C. Meo. A compositional semantics for logic programs. Theoretical Computer Science, 122(1–2):3–47, 1994.
Y. Cosmadopoulos, M. Sergot, and R. W. Southwick. Data-driven transformation of meta-interpreters: A sketch. In H. Boley and M. M. Richter, editors, Proceedings of the International Workshop on Processing Declarative Knowledge (PDK’91), volume 567 of LNAI, pages 301–308. Springer Verlag, 1991.
J. Gallagher. Specialisation of logic programs: A tutorial. In Proceedings PEPM’93, ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 88–98, Copenhagen, June 1993. ACM Press.
J. W. Lloyd and J. C. Shepherdson. Partial evaluation in logic programming. Journal of Logic Programming, 11(3&4):217–242, 1991.
W. Vanhoof, B. Martens, D. De Schreye, and K. De Vlaminck. Specialising the other way around. In J. Jaffar, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, Manchester, United Kingdom, June 1998. MIT-Press.
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. Springer-Verlag, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vanhoof, W., De Schreye, D., Martens, B. (1999). Bottom-Up Specialisation of Logic Programs. In: Flener, P. (eds) Logic-Based Program Synthesis and Transformation. LOPSTR 1998. Lecture Notes in Computer Science, vol 1559. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48958-4_23
Download citation
DOI: https://doi.org/10.1007/3-540-48958-4_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65765-1
Online ISBN: 978-3-540-48958-0
eBook Packages: Springer Book Archive