Theories for mutagenicity: a study in first-order and feature-based induction
Artificial Intelligence - Special volume on empirical methods
Top-down induction of first-order logical decision trees
Artificial Intelligence
Program Transformations and WAM-Support for the Compilation of Definite Metaprograms
Proceedings of the First Russian Conference on Logic Programming
ALT '95 Proceedings of the 6th International Conference on Algorithmic Learning Theory
A brief history of just-in-time
ACM Computing Surveys (CSUR)
Improving the efficiency of inductive logic programming through the use of query packs
Journal of Artificial Intelligence Research
Demand-driven indexing of prolog clauses
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Theory and Practice of Logic Programming - Prolog Systems
| Hi-index | 0.00 |
Control flow compilation is a hybrid between classical WAM compilation and meta-call, limited to the compilation of non-recursive clause bodies. This approach is used successfully for the execution of dynamically generated queries in an inductive logic programming setting (ILP). Control flow compilation reduces compilation times up to an order of magnitude, without slowing down execution. A lazy variant of control flow compilation is also presented. By compiling code by need, it removes the overhead of compiling unreached code (a frequent phenomenon in practical ILP settings), and thus reduces the size of the compiled code. Both dynamic compilation approaches have been implemented and were combined with query packs, an efficient ILP execution mechanism. It turns out that locality of data and code is important for performance. The experiments reported in the paper show that lazy control flow compilation is superior in both artificial and real life settings.