We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
A technique for transformation of definite logic programs is presented. A first phase performs an analysis of the extended call/exit patterns of the source program. It is shown tha...
We propose an approach for the integration of abduction and induction in Logic Programming. In particular, we show how it is possible to learn an abductive logic program starting f...
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
Agostino Cortesi, Baudouin Le Charlier, Pascal Van...