( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Replacement Can Preserve Termination.

, и . LOPSTR, том 1207 из Lecture Notes in Computer Science, стр. 104-129. Springer, (1996)

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.

Christelle Cocco

Nicoletta Kiefer

Nicoletta Grillo

Nicoletta Vieler

Nicoletta Laue

 

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

Transformation of Left Terminating Programs: the Reordering Problem., , и . LOPSTR, том 1048 из Lecture Notes in Computer Science, стр. 33-45. Springer, (1995)Transforming Normal Programs by Replacement., , и . META, том 649 из Lecture Notes in Computer Science, стр. 265-279. Springer, (1992)On Modular Termination Proofs of General Logic Programs, , , и . CoRR, (2000)Termination of Well-Moded Programs., , и . J. Log. Program., 38 (2): 243-257 (1999)A Divide-and-Conquer Approach to General Context-Free Parsing., , и . Inf. Process. Lett., 16 (4): 203-208 (1983)Declarative Semantics of Input Consuming Logic Programs., , , и . Program Development in Computational Logic, том 3049 из Lecture Notes in Computer Science, Springer, (2004)Petri Nets for Modelling and Analysing Trophic Networks., , , , , и . Fundam. Informaticae, 160 (1-2): 27-52 (2018)Representing and Comparing Metabolic Pathways as Petri Nets with MPath2PN and CoMeta., , и . CS2Bio, том 299 из Electronic Notes in Theoretical Computer Science, стр. 5-13. Elsevier, (2013)Transformation of Left Terminating Programs., , и . LOPSTR, том 1817 из Lecture Notes in Computer Science, стр. 156-175. Springer, (1999)Replacement Can Preserve Termination., и . LOPSTR, том 1207 из Lecture Notes in Computer Science, стр. 104-129. Springer, (1996)