Scholarlink

In this short paper, we consider non-looping non-termination in term rewriting and logic programming. We describe a strict generalisation of the recurrent pair approach that we introduced previously. We also present an experimental evaluation of our contribution that we implemented in our tool NTI.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Recurrent Pairs Revisited

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Etienne Payet

摘要

In this short paper, we consider non-looping non-termination in term rewriting and logic programming. We describe a strict generalisation of the recurrent pair approach that we introduced previously. We also present an experimental evaluation of our contribution that we implemented in our tool NTI.