1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.LO2025★ 1 cited
Non-Termination of Logic Programs Using Patterns
Etienne Payet
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 programm…
cs.LO2023
Non-Termination in Term Rewriting and Logic Programming
Etienne Payet
In this paper, we define two particular forms of non-termination, namely loops and binary chains, in an abstract framework that encompasses term rewriting and logic programming. Th…