An important advantage of Logic Programming (LP) is that a declarative programming style leads to more understandable and
less error-prone computations. However, a declarative programming style also leads to less efficient, and in the extreme case,
in non-terminating computations. Therefore, an important aspect of proving correctness of a program, is the analysis of the
termination behavior of the program for a class of queries.