( en | de | ru )

 

Disambiguation of "Lebègue, Patrick"

Author of the publication

copydeleteadd this publication to your clipboard
Towards Optimization of Full Prolog Programs Guided by Abstract Interpretation.

, , and . LOPSTR, page 228-241. Springer, (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Patrick Pfeffer

Optimiertes Design kombinatorischer Verbindungsbibliotheken durch genetische Algorithmen und deren Bewertung anhand wissensbasierter Protein-Ligand-Bindungsprofile. Uni Marburg, (2009)

Patrick Hansen

Entwicklung eines energetischen Sanierungsmodells für den europäischen Wohngebäudesektor unter dem Aspekt der Erstellung von Szenarien für Energie- und Co_1tn2-Einsparpotenziale bis 2030. Uni Siegen, (2009)

Patrick Mainka

Patrick Villwock

Patrick Steuer

 

Other publications of authors with the same name

Abstract Interpretation and Recursive Behaviour of Logic Programs., , and . LOPSTR, page 147-166. Springer, (1991)Weighted Systems Revisited., , and . WSA, volume 81-82 of Series Bigre, page 163-173. Atelier Irisa, IRISA, Campus de Beaulieu, (1992)The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable., , and . ILPS, page 250-265. MIT Press, (1993)Halting Problem of One Binary Horn Clause id Undecidable., , and . Structural Complexity and Recursion-theoretic methods in Logic-Programming, page 5-14. Mathematical Sciences Institute, Cornell University, (1992)Prolog Program Transformations and Meta-Interpreters., , and . LOPSTR, page 238-251. Springer, (1991)Une analyse du comportement récursif de programmes Prolog par une interprétation abstraite., , and . JTASPEFT/WSA, volume 74 of Series Bigre, page 62-69. Atelier Irisa, IRISA, Campus de Beaulieu, (1991)Halting Problem of One Binary Horn Clause is Undecidable., , and . STACS, volume 665 of Lecture Notes in Computer Science, page 48-57. Springer, (1993)Termination induction by means of an abstract OLDT resolution., , and . JFPL, page 353-373. (1992)Techniques de transformations de programmes Prolog généraux et validation de méta-interpréteurs., , and . JTASPEFT/WSA, volume 74 of Series Bigre, page 132-138. Atelier Irisa, IRISA, Campus de Beaulieu, (1991)Weighted Graphs: A Tool for Logic Programming., and . CAAP, volume 214 of Lecture Notes in Computer Science, page 100-111. Springer, (1986)