Author of the publication

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.

 

Other publications of authors with the same name

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