Termination is an important property of programs, and is notably required for programs
formulated in proof assistants. It is a very active subject of research in the Turing-complete …

There exist many powerful techniques to analyze termination and complexity of term rewrite
systems (TRSs). Our goal is to use these techniques for the analysis of other programming …

There are two kinds of approaches for termination analysis of logic programs:“
transformational” and “direct” ones. Direct approaches prove termination directly on the …

Automated analysis of recursive derivations in logic programming is known to be a hard
problem. Both termination and non-termination are undecidable problems in Turing …

Recent years have witnessed an increasing interest in enhancing answer set solvers by
allowing function symbols. Since the introduction of function symbols makes common …

Recently, there has been an increasing interest in the bottom-up evaluation of the semantics
of logic programs with complex terms. The presence of function symbols in the program may …

A declarative program P is a theory in a given computational logic L, so that computation
with such a program is efficiently implemented as deduction in L. That is why inference …

While function symbols are widely acknowledged as an important feature in logic
programming, they make common inference tasks undecidable. To cope with this problem …

In this paper we propose a new technique for checking whether the bottom-up evaluation of
logic programs with function symbols terminates. The technique is based on the definition of …

Our goal is to study the feasibility of porting termination analysis techniques developed for
one programming paradigm to another paradigm. In this paper, we show how to adapt …