Non-Termination of Logic Programs Using Patterns

Abstract

In this paper, we consider an approach introduced in term rewriting for the automatic detection of non-looping non-termination from patterns of rules. We adapt it to logic programming by defining a new unfolding technique that produces patterns describing possibly infinite sets of finite rewrite sequences. We present an experimental evaluation of our contributions that we implemented in our tool NTI.

25 pages, presented at the 41st International Conference on Logic Programming, ICLP 2025