LIPIcs - Leibniz International Proceedings in Informatics. 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023)
Doi
Abstract
We consider an extension of multiplicative linear logic which encompasses bayesian networks and expresses samples sharing and marginalisation with the polarised rules of contraction and weakening. We introduce the necessary formalism to import exact inference algorithms from bayesian networks, giving the sum-product algorithm as an example of calculating the weighted relational semantics of a multiplicative proof-net improving runtime performance by storing intermediate results
