How to build quickly an efficient implementation of the domain Prop with DyALog.
Philip J. Lefebvre, Éric Villemonte de la Clergerie · 1993
DyALog, a tabular logic program evaluator with a modular architecture, is used to develop quickly an efficient interpreter for logic programs with boolean constraints [CLP(Boole)programs]. This is done by a coupling DyALog with PECOS, a constraint solver over finite domains. This experiment, done in the context of Abstract Interpretation of logic programs, illustrates the "genericity" of our approach for developing interpretations on various abstract domains and for various semantics. 1 Introduction DyALog 1 is an evaluator of logic programs which ensures answer completeness, computation sharing, and, for function-free programs, termination. All kinds of resolution strategies can be simulated via the use of Logic Push-- Down Automata [LPDA]. Dynamic Programming techniques (especially tabulation) are used to evaluate these automata[BVdlC92]. The underlying theory and the current modular architecture of DyALog offer the possibility of using DyALog as an generic evaluator of programs o...