Aiming low is harder: induction for lower bounds in probabilistic program verification.
Marcel HarkBenjamin Lucien KaminskiJürgen GieslJoost-Pieter KatoenPublished in: Proc. ACM Program. Lang. (2020)
Keyphrases
- lower bound
- np hard
- upper bound
- branch and bound algorithm
- bayesian networks
- objective function
- probabilistic model
- np complete
- inductive learning
- branch and bound
- rule induction
- generative model
- worst case
- uncertain data
- vc dimension
- high levels
- quadratic assignment problem
- lower bounding
- data sets
- subgroup discovery
- upper and lower bounds
- lower and upper bounds
- concept learning
- posterior probability
- linear programming