From the 1 of 5 linked papers with an AI index.
5 papers
Quantum Bayesian Networks: Compositionality and Typing via Linear Logic
Rémi Di Guardia, Thomas Ehrhard, Claudia Faggian
The paper introduces a compositional and typed framework for quantum Bayesian networks using linear logic proof‑nets, showing that it matches classical Bayesian semantics when caus…
Bayesian Networks and Proof-Nets: the proof-theory of Bayesian Inference
Rémi Di Guardia, Thomas Ehrhard, Jérôme Evrard +1
We study the correspondence between Bayesian Networks and graphical representation of proofs in linear logic. The goal of this paper is threefold: to develop a proof-theoretical ac…
A Rewriting Theory for Quantum Lambda-Calculus
Claudia Faggian, Gaetan Lopez, Benoît Valiron
Quantum lambda calculus has been studied mainly as an idealized programming language -- the evaluation essentially corresponds to a deterministic abstract machine. Very little work…
Variable Elimination as Rewriting in a Linear Lambda Calculus
Thomas Ehrhard, Claudia Faggian, Michele Pagani
Variable Elimination (VE) is a classical exact inference algorithm for probabilistic graphical models such as Bayesian Networks, computing the marginal distribution of a subset of…
Bayesian Networks and Proof-Nets: a proof-theoretical account of Bayesian Inference
Thomas Ehrhard, Claudia Faggian, Michele Pagani
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…