An Abstract Interpreter for Improving the Eciency of Dynamic Modular Logic Languages an Abstract Interpreter for Improving the Eciency of Dynamic Modular Logic Languages

In this work, we focus on modular logic languages where module composition is performed through union of clauses and where the set of denitions to be used in order to evaluate a goal can be extended during the computation through implication goals. In order to improve the implementation of these languages, we consider the application of static analysis techniques. In particular, we apply abstract interpretation in order to compute the minimal sets of modules () which are needed for any successful computation for a given predicate. The results of the analysis are exploited by the underlying implementation in order to reduce the overhead due to failing, useless computations. The abstract interpreter has been implemented in Prolog, through meta-interpretation techniques.