From post

Halting Problem of One Binary Horn Clause id Undecidable.

, , и . Structural Complexity and Recursion-theoretic methods in Logic-Programming, стр. 5-14. Mathematical Sciences Institute, Cornell University, (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.

 

Другие публикации лиц с тем же именем

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