How to build quickly an efficient implementation of the domain Prop with DyALog.
Download:
|
|
by E. Villemonte De La Clergerie
ftp://ftp.inria.fr/INRIA/Projects/Atoll/Eric.Clergerie/wILPS93.ps.Z
Add To MetaCart
Abstract:
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
Citations
| 45 | A generic abstract interpretation algorithm and its complexity analysis – Charlier, Musumbu, et al. - 1991 |
| 19 | Complete evaluation of Horn clauses: an automata theoretic approach – Lang - 1988 |
| 17 | Computations, abstractions and constraints in logic programs – Codognet, Fil'e - 1992 |
| 5 | Villemonte de la Clergerie. Subsumption--oriented Push-- Down Automata – Barth'elemy, E - 1992 |
| 1 | R'ealisation d'un Interpr 'eteur Abstrait de Programmes Logiques par Interfa��cage de l'Evaluateur de Programmes Logiques DyALog et du Solveur de Contraintes PECOS. M'emoire de Maitrise, Universit'e de – Lef`ebvre - 1993 |
| 1 | Villemonte de la Clergerie. Yet Another Implementation of the Domain Prop Using a "Logical Push-Down Automaton"-based Logic Program Interpreter and a Constraint Solver Over Finite Domains – Lef`ebvre, Charlier, et al. - 1993 |
