Probabilistic Linear Logic Programming with an Application to Bayesian Network Computations (Extended Version)
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915812826152960 |
|---|---|
| author | Acclavio, Matteo Maieli, Roberto |
| author_facet | Acclavio, Matteo Maieli, Roberto |
| contents | Bayesian networks are a canonical formalism for representing probabilistic dependencies, yet their integration within logic programming frameworks remains a nontrivial challenge, mainly due to the complex structure of these networks. In this paper, we propose probLO (probabilistic Linear Objects) an extension of Andreoli and Pareschi's LO language which embeds Bayesian network representation and computation within the framework of multiplicative-additive linear logic programming. The key novelty is the use of multi-head Prolog-like methods to reconstruct network structures, which are not necessarily trees, and the operation of slicing, standard in the literature of linear logic, enabling internal numerical probability computations without relying on external semantic interpretation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_13270 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Probabilistic Linear Logic Programming with an Application to Bayesian Network Computations (Extended Version) Acclavio, Matteo Maieli, Roberto Logic in Computer Science Bayesian networks are a canonical formalism for representing probabilistic dependencies, yet their integration within logic programming frameworks remains a nontrivial challenge, mainly due to the complex structure of these networks. In this paper, we propose probLO (probabilistic Linear Objects) an extension of Andreoli and Pareschi's LO language which embeds Bayesian network representation and computation within the framework of multiplicative-additive linear logic programming. The key novelty is the use of multi-head Prolog-like methods to reconstruct network structures, which are not necessarily trees, and the operation of slicing, standard in the literature of linear logic, enabling internal numerical probability computations without relying on external semantic interpretation. |
| title | Probabilistic Linear Logic Programming with an Application to Bayesian Network Computations (Extended Version) |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2601.13270 |