AI Chat AI Image Generator AI Video Text to Speech

Binary Non-Termination in Term Rewriting and Logic Programming

07/21/2023

∙

by Etienne Payet, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 05/13/2009

Termination Prediction for General Logic Programs

We present a heuristic framework for attacking the undecidable terminati...

0 Yi-Dong Shen, et al. ∙

research

∙ 10/30/2019

Formalizing the Dependency Pair Criterion for Innermost Termination

Rewriting is a framework for reasoning about functional programming. The...

0 Ariane Alves Almeida, et al. ∙

research

∙ 05/19/2023

Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs

Dependency pairs are one of the most powerful techniques to analyze term...

0 Jan-Christoph Kassing, et al. ∙

research

∙ 12/07/2019

Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers

We present a new modular proof method of termination for second-order co...

0 Makoto Hamana, et al. ∙

research

∙ 06/21/2000

Verifying Termination of General Logic Programs with Concrete Queries

We introduce a method of verifying termination of logic programs with re...

0 Yi-Dong Shen, et al. ∙

research

∙ 03/09/2018

Clocked Definitions in HOL

Many potentially non-terminating functions cannot be directly defined in...

0 Ramana Kumar, et al. ∙

research

∙ 05/24/2017

Faithful (meta-)encodings of programmable strategies into term rewriting systems

Rewriting is a formalism widely used in computer science and mathematica...

0 Horatiu Cirstea, et al. ∙