Work

On Probabilistic Term Rewriting

Year: 2018

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1802.09774

Authors: Avanzini, Martin, Lago, Ugo Dal, Yamada, Akihisa

Institutions: Institut national de recherche en sciences et technologies du numérique, Centre Inria d'Université Côte d'Azur, University of Bologna, National Institute of Informatics

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Agence Nationale de la Recherche, Austrian Science Fund

Award: G7558042017

OpenAlex ID: W2951737181

Cites:

Cited by:

Related to: 10