Binary Non-Termination in Term Rewriting and Logic Programming

2023/07/21 by Étienne Payet, Payet, Étienne
Computer Science · #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Semantic Web and Ontologies

paper · pdf · doi:10.48550/arxiv.2307.11549

openalex publication_date 2023/07/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Non-Termination in Term Rewriting and Logic Programming
• Non-Termination of Logic Programs Using Patterns
• Non-termination using Regular Languages
• Automated Termination Proofs for Logic Programs by Term Rewriting
• An Improved Non-Termination Criterion for Binary Constraint Logic Programs