A framework for bottom-up specialisation of logic programs

Wim Vanhoof, Danny De Schreye, Bern Martens

Research output: Contribution in Book/Catalog/Report/Conference proceedingConference contribution


In this paper, we develop a solid theoretical foundation for a bottom up program transformation, capable of specialising a logic program with respect to a set of unit clauses. Extending a well-known operator, originally introduced for composing logic programs, we define a bottom up partial deduction operator and prove correctness of the transformation with respect to the S-semantics. We also show how, within this framework, a concrete control strategy can be designed.

The transformation can be used as a stand-alone specialisation technique, useful when a program needs to be specialised w.r.t. its internal structure (e.g. a library of predicates w.r.t. an abstract data type) instead of a goal. On the other hand, the bottom up transformation can be combined with a more traditional top down partial deduction strategy. We conjecture that such a combined approach will finally enable good automatic specialisation of meta-programs.
Original languageEnglish
Title of host publicationPrinciples of Declarative Programming
Subtitle of host publication10th International Symposium, PLILP’98 Held Jointly with the 6th International Conference, ALP’98 Pisa, Italy, September 16–18, 1998 Proceedings
EditorsCatuscia Palamidessi, Hugh Glaser, Karl Meinke
ISBN (Electronic)978-3-540-49766-0
ISBN (Print)978-3-540-65012-6
Publication statusPublished - 1998
Event6th International Conference on Algebraic and Logic Programming - Pise, Italy
Duration: 16 Sep 199818 Sep 1998

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference6th International Conference on Algebraic and Logic Programming
Abbreviated titleAPL'98


Dive into the research topics of 'A framework for bottom-up specialisation of logic programs'. Together they form a unique fingerprint.

Cite this