34 citations · 53 across the 6 of their papers we have counts for
6 papers
Automated Termination Analysis for Logic Programs with Cut
Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder +2
Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, wherea…
Improving Prolog programs: Refactoring for Prolog
Alexander Serebrenik, Tom Schrijvers, Bart Demoen
Refactoring is an established technique from the object-oriented (OO) programming community to restructure code: it aims at improving software readability, maintainability and exte…
Improving Prolog Programs: Refactoring for Prolog
Tom Schrijvers, Alexander Serebrenik
Refactoring is an established technique from the OO-community to restructure code: it aims at improving software readability, maintainability and extensibility. Although refactorin…
On termination of meta-programs
Alexander Serebrenik, Danny De Schreye
The term {\em meta-programming} refers to the ability of writing programs that have other programs as data and exploit their semantics. The aim of this paper is presenting a method…
Inference of termination conditions for numerical loops in Prolog
Alexander Serebrenik, Danny De Schreye
We present a new approach to termination analysis of numerical computations in logic programs. Traditional approaches fail to analyse them due to non well-foundedness of the intege…
A General Framework for Automatic Termination Analysis of Logic Programs
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv +1
This paper describes a general framework for automatic termination analysis of logic programs, where we understand by ``termination'' the finitenes s of the LD-tree constructed for…