The following publications are possibly variants of this publication:
- Non-transformational Termination Analysis of Logic Programs, Based on General Term-OrderingsAlexander Serebrenik, Danny De Schreye. LOPSTR 2001: 69-85 [doi]
- A General Framework for Automatic Termination Analysis of Logic ProgramsNachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik. aaecc, 12(1/2):117-156, 2001. [doi]
- Non-termination Analysis of Logic Programs Using TypesDean Voets, Danny De Schreye. LOPSTR 2011: 133-148 [doi]
- Non-termination analysis of logic programs with integer arithmeticsDean Voets, Danny De Schreye. tplp, 11(4-5):521-536, 2011. [doi]
- Automated Termination Analysis for Logic Programs by Term RewritingPeter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann. LOPSTR 2007: 177-193 [doi]
- Constraint-based termination analysis of logic programsStefaan Decorte, Danny De Schreye, Henk Vandecasteele. TOPLAS, 21(6):1137-1195, 1999. [doi]
- Termination prediction for general logic programsYi-Dong Shen, Danny De Schreye, Dean Voets. tplp, 9(6):751-780, 2009. [doi]
- A New Approach to Non-termination Analysis of Logic ProgramsDean Voets, Danny De Schreye. ICLP 2009: 220-234 [doi]