We discuss semantic intricacies of conditioning, a main feature in probabilistic programming, and propose how to deal with these issues in an operational way and in a weakest pre-condition semantics. This includes the interplay between conditioning and possible non-termination as well as between conditioning and non-determinism. Furthermore, we propose a program transformation that eliminates conditioning from programs at the expense of introducing loops.
Sat 23 JanDisplayed time zone: Guadalajara, Mexico City, Monterrey change
16:30 - 18:00
|eXchangeable Random Primitives|
|An Application of Computable Distributions to the Semantics of Probabilistic Programs|
|On The Semantic Intricacies of Conditioning|
Friedrich Gretz RWTH Aachen University, Nils Jansen RWTH Aachen University, Benjamin Lucien Kaminski RWTH Aachen University, Joost-Pieter Katoen RWTH Aachen University, Federico Olmedo RWTH Aachen UniversityPre-print