On Probabilistic Term Rewriting

2018/02/27 by Avanzini, Martin, Lago, Ugo Dal, Yamada, Akihisa · 1 citation
#FOS: Computer and information sciences #Symbolic Computation (cs.SC)

paper · doi:10.48550/arxiv.1802.09774

Abstract

We study the termination problem for probabilistic term rewrite systems. We prove that the interpretation method is sound and complete for a strengthening of positive almost sure termination, when abstract reduction systems and term rewrite systems are considered. Two instances of the interpretation method - polynomial and matrix interpretations - are analyzed and shown to capture interesting and nontrivial examples when automated. We capture probabilistic computation in a novel way by way of multidistribution reduction sequences, this way accounting for both the nondeterminism in the choice of the redex and the probabilism intrinsic in firing each rule.

Cited by

• Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting

Related

• From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
• From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
• A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
• Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
• A Distribution Semantics for Probabilistic Term Rewriting