( en | de | ru )

 

Disambiguation of "Schreye, Danny De"

Author of the publication

copydeleteadd this publication to your clipboard
Polytool: Proving Termination Automatically Based on Polynomial Interpretations.

, and . LOPSTR, volume 4407 of Lecture Notes in Computer Science, page 210-218. Springer, (2006)

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.

Danny Bachfeld

Analyse des Hygienestatus im Zentrum für Zahn-, Mund- und Kieferheilkunde der Universität Greifswald, ergänzt durch eine experimentelle Studie zur Wirkung von Guanidinthiocyanat auf Nickel-Titan-Instrumente. Uni Greifswald, (2009)

Danny Schulze

Danny Bot

Danny Ionescu

Danny Bartholome

 

Other publications of authors with the same name

A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs., , and . ISLP, page 117-131. MIT Press, (1991)Non-tranformational termination analysis of logic programs, based on general term-orderings., and . LOPSTR, volume UMCS-00-6-1 of Technical Report, Department of Computer Science, University of Manchester, (2000)The Abductive Event Calculus as a General Framework for Temporal Databases., , and . ICTL, volume 827 of Lecture Notes in Computer Science, page 301-316. Springer, (1994)Representing Incomplete Knowledge in Abductive Logic Programming., and . J. Log. Comput., 5 (5): 553-577 (1995)Semantic interpretation of temporal information by abductive inference, , , , and . CoRR, (2000)Termination Analysis for Tabled Logic Programming., , , , and . LOPSTR, volume 1463 of Lecture Notes in Computer Science, page 111-127. Springer, (1997)Termination Analysis of CHR Revisited., and . ICLP, volume 5366 of Lecture Notes in Computer Science, page 501-515. Springer, (2008)Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings., and . LOPSTR (LNCS 2042: Selected Papers), volume 2042 of Lecture Notes in Computer Science, page 69-85. Springer, (2000)Automatic Inference of Norms: A Missing Link in Automatic Termination Analysis., , and . ILPS, page 420-436. MIT Press, (1993)On Termination of Logic Programs with Floating Point Computations., and . SAS, volume 2477 of Lecture Notes in Computer Science, page 151-164. Springer, (2002)