# A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting

arXiv: https://arxiv.org/abs/2309.00344 · HTML: https://mlsanity.com/paper/2309.00344/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 1 Sep 2023.

## Built on by (most cited first, 1 of 1)

- [A Distribution Semantics for Probabilistic Term Rewriting](https://mlsanity.com/paper/2410.15081/) (2024)

## Abstract (arXiv)

Recently, the well-known dependency pair (DP) framework was adapted to a dependency tuple framework in order to prove almost-sure innermost termination (iAST) of probabilistic term rewrite systems. While this approach was incomplete, in this paper, we improve it into a complete criterion for iAST by presenting a new, more elegant definition of DPs for probabilistic term rewriting. Based on this, we extend the probabilistic DP framework by new transformations. Our implementation in the tool AProVE shows that they increase its power considerably.