Showing papers by "Antonio Brogi published in 1996"
28 Mar 1996
TL;DR: The use of pruning operators for reducing the search space of logic programming computations is analyzed and the commit operator featured by the language Godel is examined.
Abstract: We analyse the use of pruning operators for reducing the search space of logic programming computations. The synthesis of a few key choices arising in the implementation of pruning operators allows us to compare alternative pruning strategies at a suitably abstract level. In this perspective, we examine the commit operator featured by the language Godel.
3 citations
28 Aug 1996
TL;DR: In this article, the authors describe a declarative program specialiser that suitably transforms such metainterpreters so as to sensibly reduce the overhead due to the handling of program compositions.
Abstract: Meta-level compositions of object logic programs are naturally implemented by means of meta-programming techniques. Metainterpreters defining program compositions however suffer from a computational overhead that is due partly to the interpretation layer present in all meta-programs, and partly to the specific interpretation layer needed to deal with program compositions. We show that meta-interpreters implementing compositions of object programs can be fruitfully specialised w.r.t. meta-level queries of the form Demo(E,G), where E denotes a program expression and G denotes a (partially instantiated) object level query. More precisely, we describe the design and implementation of a declarative program specialiser that suitably transforms such metainterpreters so as to sensibly reduce — if not to completely remove — the overhead due to the handling of program compositions. In many cases the specialiser succeeds in eliminating also the overhead due to meta-interpretation.
2 citations