Establishes a complete axiomatization for probabilistic Boolean circuits via Markov kernel semantics, using intermediate completeness theorems for partial Boolean circuits and probabilistic Boolean tapes in rig categories.
27 Elena Di Lavore, Mario Román, and Pawel Sobocinski
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Completeness for Probabilistic Boolean Tapes
Establishes a complete axiomatization for probabilistic Boolean circuits via Markov kernel semantics, using intermediate completeness theorems for partial Boolean circuits and probabilistic Boolean tapes in rig categories.