27 citations · 64 across the 14 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.LO2015
On the Hardness of Almost-Sure Termination
Benjamin Lucien Kaminski, Joost-Pieter Katoen
This paper considers the computational hardness of computing expected outcomes and deciding (universal) (positive) almost-sure termination of probabilistic programs. It is shown th…
cs.PL2015★ 7 cited
Conditioning in Probabilistic Programming
Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski +3
We investigate the semantic intricacies of conditioning, a main feature in probabilistic programming. We provide a weakest (liberal) pre-condition (w(l)p) semantics for the element…