























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.
From: Cipriano Junior Cioffo [view email]
[v1]
Wed, 17 Jun 2026 12:39:15 UTC (8,257 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。