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

📅 2024-12-29
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
This work addresses the lack of a purely logical characterization and formal semantic foundation for Bayesian inference. We propose a proof-theoretic modeling framework based on multivalued linear logic, establishing—for the first time—a rigorous correspondence between Bayesian networks and multiplicative proof nets: joint probability distributions are semantically encoded as proof structures, and Bayesian inference is reformulated as proof reduction. Leveraging categorical semantics, we uncover a computational isomorphism between probabilistic graphical models and structured proofs. The resulting framework provides a purely logical representation of Bayesian inference, enabling verifiable probabilistic computation. Moreover, it delivers the first formal semantics for probabilistic programming languages grounded in linear logic, thereby bridging the theoretical gap between probabilistic reasoning and logical computation.

Technology Category

Application Category

📝 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.
Problem

Research questions and friction points this paper is trying to address.

Bayesian Networks
Linear Logic Proof Nets
Simplified Understanding
Innovation

Methods, ideas, or system contributions that make the work stand out.

Bayesian Networks
Linear Logic Proof Nets
Simpler Bayesian Inference
🔎 Similar Papers
No similar papers found.
T
T. Ehrhard
Université de Paris, CNRS, IRIF, F-75013, Paris, France
C
C. Faggian
Université de Paris, CNRS, IRIF, F-75013, Paris, France
Michele Pagani
Michele Pagani
Professor of Computer Science, ENS de Lyon
Semantics of Programming LanguagesLinear LogicProof TheoryLambda Calculus