Weighted Graphs: A Tool for Logic Programming. - Philippe Devienne; Patrick Lebègue (CAAP, 1986)

Abstract Interpretation and Recursive Behaviour of Logic Programs. - Christophe Lecoutre; Philippe Devienne; Patrick Lebègue (LOPSTR, 1991)

Prolog Program Transformations and Meta-Interpreters. - Anne Parrain; Philippe Devienne; Patrick Lebègue (LOPSTR, 1991)

Une analyse du comportement récursif de programmes Prolog par une interprétation abstraite. - Christophe Lecoutre; Philippe Devienne; Patrick Lebègue (JTASPEFT/WSA, 1991)

Techniques de transformations de programmes Prolog généraux et validation de méta-interpréteurs. - Anne Parrain; Philippe Devienne; Patrick Lebègue (JTASPEFT/WSA, 1991)

Halting Problem of One Binary Horn Clause id Undecidable. - Philippe Devienne; Patrick Lebègue; Jean-Christophe Routier (Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992)

Termination induction by means of an abstract OLDT resolution. - Christophe Lecoutre; Philippe Devienne; Patrick Lebègue (JFPL, 1992)

Towards Optimization of Full Prolog Programs Guided by Abstract Interpretation. - Anne Parrain; Philippe Devienne; Patrick Lebègue (LOPSTR, 1992)

Weighted Systems Revisited. - Philippe Devienne; Patrick Lebègue; Jean-Christophe Routier (WSA, 1992)

The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable. - Philippe Devienne; Patrick Lebègue; Jean-Christophe Routier (ILPS, 1993)

Halting Problem of One Binary Horn Clause is Undecidable. - Philippe Devienne; Patrick Lebègue; Jean-Christophe Routier (STACS, 1993)

Weighted Systems of Equations. - Philippe Devienne; Patrick Lebègue; Max Dauchet (Theor. Comput. Sci., 1993)

One Binary Horn Clause is Enough. - Philippe Devienne; Patrick Lebègue; Jean-Christophe Routier; Jörg Würtz (STACS, 1994)

Smallest Horn Clause Programs. - Philippe Devienne; Patrick Lebègue; Anne Parrain; Jean-Christophe Routier; Jörg Würtz (J. Log. Program., 1996)