5 results
Automated termination analysis for logic programs with cut*
-
- Journal:
- Theory and Practice of Logic Programming / Volume 10 / Issue 4-6 / July 2010
- Published online by Cambridge University Press:
- 09 July 2010, pp. 365-381
-
- Article
- Export citation
Improving Prolog programs: Refactoring for Prolog
-
- Journal:
- Theory and Practice of Logic Programming / Volume 8 / Issue 2 / March 2008
- Published online by Cambridge University Press:
- 01 March 2008, pp. 201-215
-
- Article
- Export citation
Recurrence with affine level mappings is P-time decidable for CLP
-
- Journal:
- Theory and Practice of Logic Programming / Volume 8 / Issue 1 / January 2008
- Published online by Cambridge University Press:
- 01 January 2008, pp. 111-119
-
- Article
- Export citation
On termination of meta-programs
-
- Journal:
- Theory and Practice of Logic Programming / Volume 5 / Issue 3 / May 2005
- Published online by Cambridge University Press:
- 09 May 2005, pp. 355-390
-
- Article
- Export citation
Inference of termination conditions for numerical loops in Prolog
-
- Journal:
- Theory and Practice of Logic Programming / Volume 4 / Issue 5-6 / September 2004
- Published online by Cambridge University Press:
- 12 August 2004, pp. 719-751
-
- Article
- Export citation