Completeness for Probabilistic Boolean Tapes
Year: 2026
Type: preprint
Abstract: Probabilistic Boolean circuits have recently been proposed as a string-diagrammatic foundation for finite probabilistic programming. In this paper, we present a complete set of axioms for their semantics in terms of Markov kernels. Our approach is based on two intermediate results: completeness for \emph{partial} Boolean circuits and completeness for probabilistic Boolean tapes, a diagrammatic language for rig categories.
Source: arXiv (Cornell University)
Authors: Bonchi, Filippo, Cioffo, Cipriano Junior
Institution: University of Pisa
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7165155674
Cites:
Cited by:
Related to: