A Bunched Logic for Conditional Independence

Independence and conditional independence are fundamental concepts for reasoning about groups of random variables in probabilistic programs. Verification methods for independence are still nascent, and existing methods cannot handle conditional independence. We extend the logic of bunched implicatio...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science s. 1 - 14
Hlavní autoři: Bao, Jialu, Docherty, Simon, Hsu, Justin, Silva, Alexandra
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 29.06.2021
Témata:
Cognition
Computational modeling
Computer science
Markov processes
Probabilistic logic
Random variables
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Independence and conditional independence are fundamental concepts for reasoning about groups of random variables in probabilistic programs. Verification methods for independence are still nascent, and existing methods cannot handle conditional independence. We extend the logic of bunched implications (BI) with a non-commutative conjunction and provide a model based on Markov kernels; conditional independence can be directly captured as a logical formula in this model. Noting that Markov kernels are Kleisli arrows for the distribution monad, we then introduce a second model based on the powerset monad and show how it can capture join dependency, a non-probabilistic analogue of conditional independence from database theory. Finally, we develop a program logic for verifying conditional independence in probabilistic programs.
DOI:10.1109/LICS52264.2021.9470712