This approach reveals non-termination in logic programs, suggesting patterns improve detection methods.
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 programing 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 (Non-Termination Inference) .
No takes yet. Share an insight, caveat, or question.
Étienne Payet (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: