HackerPapers

arXiv:2412.20540cs.LO

Bayesian Networks and Proof-Nets: a proof-theoretical account of Bayesian Inference

Thomas Ehrhard, Claudia Faggian, Michele Pagani

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

We uncover a strong correspondence between Bayesian Networks and (Multiplicative) Linear Logic Proof-Nets, relating the two as a representation of a joint probability distribution and at the level of computation, so yielding a proof-theoretical account of Bayesian Inference.

arXiv comments
Presented at the Workshop "Logic of Probabilistic Programming" (CIRM Marseille, 31 Jan- 4 Feb 2022): \url{https://conferences.cirm-math.fr/2507.html}
Journal reference
DOI
Subjects
cs.LOLogic in Computer Science

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Jan 2025 to Jan 2025. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.