One Binary Horn Clause is Enough | 3 | 0.40 | 1994 |
The emptiness problem of one binary recursive horn clause is undecidable | 4 | 0.46 | 1993 |
Weighted systems of equations | 2 | 0.54 | 1993 |
Halting Problem of One Binary Horn Clause is Undecidable | 21 | 1.27 | 1993 |
Termination induction by means of an abstract OLDT resolution | 1 | 0.37 | 1992 |
Weighted Systems Revisited | 0 | 0.34 | 1992 |
Towards Optimization of Full Prolog Programs guided by Abstract Interpretation. | 0 | 0.34 | 1992 |
Prolog Program Transformations and Meta-Interpreters | 1 | 0.37 | 1991 |
Une analyse du comportement récursif de programmes Prolog par une interprétation abstraite | 0 | 0.34 | 1991 |
Abstract Interpretation and Recursive Behaviour of Logic Programs | 1 | 0.37 | 1991 |
Techniques de transformations de programmes Prolog généraux et validation de méta-interpréteurs | 0 | 0.34 | 1991 |