Date: 09 Jun 2005

Automatic bottom-up analysis and transformation of logic programs

* Final gross prices may vary according to local VAT.

Get Access


The comparatively small size and clean declarative semantics of logic programs hide performance issues that must be accounted for if the programs are to be executed using the currently available technology. Proposals have been made to tackle these computational issues by analysing a program and trying to optimise its code. We introduce a bottom-up method for analysing logic programs. The method incrementally builds self-contained subtheories of the initial program, starting from facts and then picking up more complex clauses that depend on simpler, previously analysed constructs. A transformation system is then applied to these subtheories yielding more efficient subprograms. Eventually a subtheory that encompasses the full initial program is obtained.

This work was partially carried out while the first author was visiting the Department of Artificial Intelligence, University of Edinburgh, Scotland, Great Britain.
Sponsored by the Brazilian Research Council (CNPq), grant n∘ 300.968/95-7.