A framework for bottom-up specialisation of logic programs

Wim Vanhoof; Danny De Schreye; Bern Martens

doi:10.1007/BFb0056607

A framework for bottom-up specialisation of logic programs

Wim Vanhoof, Danny De Schreye, Bern Martens

Faculte d'informatique

Résultats de recherche: Contribution dans un livre/un catalogue/un rapport/dans les actes d'une conférence › Article dans les actes d'une conférence/un colloque

Résumé

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.

langue originale	Anglais
titre	Principles of Declarative Programming
Sous-titre	10th International Symposium, PLILP’98 Held Jointly with the 6th International Conference, ALP’98 Pisa, Italy, September 16–18, 1998 Proceedings
rédacteurs en chef	Catuscia Palamidessi, Hugh Glaser, Karl Meinke
Editeur	Springer
Pages	54-72
ISBN (Electronique)	978-3-540-49766-0
ISBN (imprimé)	978-3-540-65012-6
Les DOIs	https://doi.org/10.1007/BFb0056607
Etat de la publication	Publié - 1998
Evénement	6th International Conference on Algebraic and Logic Programming - Pise, Italie Durée: 16 sept. 1998 → 18 sept. 1998

Série de publications

Nom	Lecture Notes in Computer Science
Editeur	Springer
Volume	1490
ISSN (imprimé)	0302-9743
ISSN (Electronique)	1611-3349

Une conférence

Une conférence	6th International Conference on Algebraic and Logic Programming
Titre abrégé	APL'98
Pays/Territoire	Italie
La ville	Pise
période	16/09/98 → 18/09/98

Accès au document

10.1007/BFb0056607

Contient cette citation

Vanhoof, W., De Schreye, D., & Martens, B. (1998). A framework for bottom-up specialisation of logic programs. Dans C. Palamidessi, H. Glaser, & K. Meinke (eds.), Principles of Declarative Programming: 10th International Symposium, PLILP’98 Held Jointly with the 6th International Conference, ALP’98 Pisa, Italy, September 16–18, 1998 Proceedings (p. 54-72). (Lecture Notes in Computer Science; Vol 1490). Springer. https://doi.org/10.1007/BFb0056607

Vanhoof, Wim ; De Schreye, Danny ; Martens, Bern. / A framework for bottom-up specialisation of logic programs. Principles of Declarative Programming: 10th International Symposium, PLILP’98 Held Jointly with the 6th International Conference, ALP’98 Pisa, Italy, September 16–18, 1998 Proceedings. Editeur / Catuscia Palamidessi ; Hugh Glaser ; Karl Meinke. Springer, 1998. p. 54-72 (Lecture Notes in Computer Science).

@inproceedings{065010157b824f5898d882303c76cddc,

title = "A framework for bottom-up specialisation of logic programs",

abstract = "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.",

author = "Wim Vanhoof and {De Schreye}, Danny and Bern Martens",

year = "1998",

doi = "10.1007/BFb0056607",

language = "English",

isbn = "978-3-540-65012-6",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "54--72",

editor = "Catuscia Palamidessi and Hugh Glaser and Karl Meinke",

booktitle = "Principles of Declarative Programming",

note = "6th International Conference on Algebraic and Logic Programming, APL'98 ; Conference date: 16-09-1998 Through 18-09-1998",

}

Vanhoof, W, De Schreye, D & Martens, B 1998, A framework for bottom-up specialisation of logic programs. Dans C Palamidessi, H Glaser & K Meinke (eds), Principles of Declarative Programming: 10th International Symposium, PLILP’98 Held Jointly with the 6th International Conference, ALP’98 Pisa, Italy, September 16–18, 1998 Proceedings. Lecture Notes in Computer Science, VOL. 1490, Springer, p. 54-72, 6th International Conference on Algebraic and Logic Programming, Pise, Italie, 16/09/98. https://doi.org/10.1007/BFb0056607

A framework for bottom-up specialisation of logic programs. / Vanhoof, Wim; De Schreye, Danny; Martens, Bern.
Principles of Declarative Programming: 10th International Symposium, PLILP’98 Held Jointly with the 6th International Conference, ALP’98 Pisa, Italy, September 16–18, 1998 Proceedings. Ed. / Catuscia Palamidessi; Hugh Glaser; Karl Meinke. Springer, 1998. p. 54-72 (Lecture Notes in Computer Science; Vol 1490).

Résultats de recherche: Contribution dans un livre/un catalogue/un rapport/dans les actes d'une conférence › Article dans les actes d'une conférence/un colloque

TY - GEN

T1 - A framework for bottom-up specialisation of logic programs

AU - Vanhoof, Wim

AU - De Schreye, Danny

AU - Martens, Bern

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

U2 - 10.1007/BFb0056607

DO - 10.1007/BFb0056607

M3 - Conference contribution

SN - 978-3-540-65012-6

T3 - Lecture Notes in Computer Science

SP - 54

EP - 72

BT - Principles of Declarative Programming

A2 - Palamidessi, Catuscia

A2 - Glaser, Hugh

A2 - Meinke, Karl

PB - Springer

T2 - 6th International Conference on Algebraic and Logic Programming

Y2 - 16 September 1998 through 18 September 1998

ER -

Vanhoof W, De Schreye D, Martens B. A framework for bottom-up specialisation of logic programs. Dans Palamidessi C, Glaser H, Meinke K, rédacteurs en chef, Principles of Declarative Programming: 10th International Symposium, PLILP’98 Held Jointly with the 6th International Conference, ALP’98 Pisa, Italy, September 16–18, 1998 Proceedings. Springer. 1998. p. 54-72. (Lecture Notes in Computer Science). doi: 10.1007/BFb0056607

A framework for bottom-up specialisation of logic programs

Résumé

Série de publications

Une conférence

Accès au document

Empreinte digitale

Contient cette citation