Binary Non-Termination in Term Rewriting and Logic Programming

Etienne Payet

doi:10.48550/arXiv.2307.11549

Conference Papers Year : 2023

Binary Non-Termination in Term Rewriting and Logic Programming

(1)

Etienne Payet

Function : Author
PersonId : 1243814
IdHAL : etienne-payet
ORCID : 0000-0002-3519-025X

Laboratoire d'Informatique et de Mathématiques

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

Term Rewriting Logic Programming Theory of computation Logic in Computer Science Computer and information sciences Rewrite systems Program analysis phrases Non-Termination Constraint and logic programming

Domains

Logic in Computer Science [cs.LO]

Fichier principal

wst23.pdf (462.45 Ko)

Origin : Files produced by the author(s)
Licence : CC BY NC ND - Attribution - NonCommercial - NoDerivatives

Etienne Payet : Connect in order to contact the contributor

https://hal.univ-reunion.fr/hal-04315644

Submitted on : Thursday, November 30, 2023-12:53:11 PM

Last modification on : Monday, April 29, 2024-11:28:04 AM

Dates and versions

hal-04315644 , version 1 (30-11-2023)

Licence

Attribution - NonCommercial - NoDerivatives

Identifiers

HAL Id : hal-04315644 , version 1
ARXIV : 2307.11549
DOI : 10.48550/arXiv.2307.11549

Cite

Etienne Payet. Binary Non-Termination in Term Rewriting and Logic Programming. Workshop on Termination (WST), Akihisa Yamada, Aug 2023, Obergurgl, Austria. ⟨10.48550/arXiv.2307.11549⟩. ⟨hal-04315644⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

AFRIQ UNIV-REUNION LIM PAPANGUE FST-REUNION

22 View

6 Download

Binary Non-Termination in Term Rewriting and Logic Programming

Abstract

Keywords

Domains

Dates and versions

Licence

Identifiers

Cite

Export

Collections

Altmetric

Share