Non-Termination of Logic Programs Using Patterns

2025/07/12 by Payet, Etienne
#FOS: Computer and information sciences #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.2507.09390

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.

Citations

• Non-Termination in Term Rewriting and Logic Programming
• Non-Termination Inference of Logic Programs
• Nontermination inference of logic programs

Related

• Non-Termination in Term Rewriting and Logic Programming
• Binary Non-Termination in Term Rewriting and Logic Programming
• Non-termination using Regular Languages
• Automated Termination Proofs for Logic Programs by Term Rewriting
• Proving Looping and Non-Looping Non-Termination by Finite Automata