Binary Non-Termination in Term Rewriting and Logic Programming
Logic in Computer Science
2023-07-24 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2307.11549,
title = {Binary Non-Termination in Term Rewriting and Logic Programming},
author = {Étienne Payet},
journal= {arXiv preprint arXiv:2307.11549},
year = {2023}
}
Comments
Presented at WST 2023