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:
| Published in | arXiv.org |
|---|---|
| Main Author | |
| Format | Paper |
| Language | English |
| Published |
Ithaca
Cornell University Library, arXiv.org
21.07.2023
|
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| 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. |
|---|---|
| ISSN: | 2331-8422 |