The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Patrick Lebègue: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Philippe Devienne, Patrick Lebègue
    Weighted Graphs: A Tool for Logic Programming. [Citation Graph (0, 0)][DBLP]
    CAAP, 1986, pp:100-111 [Conf]
  2. Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier
    Halting Problem of One Binary Horn Clause id Undecidable. [Citation Graph (0, 0)][DBLP]
    Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992, pp:5-14 [Conf]
  3. Christophe Lecoutre, Philippe Devienne, Patrick Lebègue
    Termination induction by means of an abstract OLDT resolution. [Citation Graph (0, 0)][DBLP]
    JFPL, 1992, pp:353-373 [Conf]
  4. Christophe Lecoutre, Philippe Devienne, Patrick Lebègue
    Abstract Interpretation and Recursive Behaviour of Logic Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1991, pp:147-166 [Conf]
  5. Anne Parrain, Philippe Devienne, Patrick Lebègue
    Prolog Program Transformations and Meta-Interpreters. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1991, pp:238-251 [Conf]
  6. Anne Parrain, Philippe Devienne, Patrick Lebègue
    Towards Optimization of Full Prolog Programs Guided by Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1992, pp:228-241 [Conf]
  7. Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier
    Weighted Systems Revisited. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:163-173 [Conf]
  8. Christophe Lecoutre, Philippe Devienne, Patrick Lebègue
    Une analyse du comportement récursif de programmes Prolog par une interprétation abstraite. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:62-69 [Conf]
  9. Anne Parrain, Philippe Devienne, Patrick Lebègue
    Techniques de transformations de programmes Prolog généraux et validation de méta-interpréteurs. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:132-138 [Conf]
  10. Anne Parrain, Philippe Devienne, Patrick Lebègue
    Towards Optimization of Full Prolog Programs guided by Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:295-303 [Conf]
  11. Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier
    The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable. [Citation Graph (0, 0)][DBLP]
    ILPS, 1993, pp:250-265 [Conf]
  12. Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier
    Halting Problem of One Binary Horn Clause is Undecidable. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:48-57 [Conf]
  13. Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier, Jörg Würtz
    One Binary Horn Clause is Enough. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:21-32 [Conf]
  14. Philippe Devienne, Patrick Lebègue, Anne Parrain, Jean-Christophe Routier, Jörg Würtz
    Smallest Horn Clause Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1996, v:27, n:3, pp:227-267 [Journal]
  15. Philippe Devienne, Patrick Lebègue, Max Dauchet
    Weighted Systems of Equations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:119, n:1, pp:39-62 [Journal]

Search in 0.042secs, Finished in 0.043secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002