arXiv Open Access 2018

On Probabilistic Term Rewriting

Martin Avanzini Ugo Dal Lago Akihisa Yamada

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.SC

Penulis (3)

Martin Avanzini

Ugo Dal Lago

Akihisa Yamada

Format Sitasi

APA MLA BibTeX

Avanzini, M., Lago, U.D., Yamada, A. (2018). On Probabilistic Term Rewriting. https://arxiv.org/abs/1802.09774

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2018
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓