Non-Termination of Logic Programs Using Patterns
Logic in Computer Science
2026-01-14 v1
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.
Cite
@article{arxiv.2507.09390,
title = {Non-Termination of Logic Programs Using Patterns},
author = {Etienne Payet},
journal= {arXiv preprint arXiv:2507.09390},
year = {2026}
}
Comments
25 pages, presented at the 41st International Conference on Logic Programming, ICLP 2025