Binary Non-Termination in Term Rewriting and Logic Programming

We present a new syntactic criterion for the automatic detection of non-termination in an abstract setting that encompasses a simplified form of term rewriting and logic programming.

Saved in:
Bibliographic Details
Main Author Payet, Étienne
Format Journal Article
LanguageEnglish
Published 21.07.2023
Subjects
Computer Science - Logic in Computer Science
Online AccessGet full text

Cover

More Information
Summary:We present a new syntactic criterion for the automatic detection of non-termination in an abstract setting that encompasses a simplified form of term rewriting and logic programming.
DOI:10.48550/arxiv.2307.11549