Lower Bounds for Possibly Divergent Probabilistic Programs.
Shenghua FengMingshuai ChenHan SuBenjamin Lucien KaminskiJoost-Pieter KatoenNaijun ZhanPublished in: CoRR (2023)
Keyphrases
- lower bound
- upper bound
- objective function
- lower and upper bounds
- branch and bound
- bayesian networks
- branch and bound algorithm
- probabilistic model
- information theoretic
- data driven
- generative model
- search algorithm
- logic programs
- data sets
- worst case
- np hard
- posterior probability
- belief networks
- answer sets
- optimal solution
- probabilistic logic
- lower bounding
- optimal cost
- randomly generated problems
- probabilistic logic programs