Aiming Low Is Harder - Inductive Proof Rules for Lower Bounds on Weakest Preexpectations in Probabilistic Program Verification.
Marcel HarkBenjamin Lucien KaminskiJürgen GieslJoost-Pieter KatoenPublished in: CoRR (2019)
Keyphrases
- lower bound
- np hard
- upper bound
- logical rules
- cost based abduction
- probabilistic relational
- rule learning
- branch and bound algorithm
- inductive logic programming
- branch and bound
- np complete
- probabilistic model
- bayesian networks
- background knowledge
- inductive learning
- generative model
- classification rules
- optimal solution
- neural network
- worst case
- theorem proving
- lower and upper bounds
- association rules
- machine learning
- logic programming
- boolean expressions
- optimal cost
- online algorithms
- linear programming relaxation
- production rules
- theorem prover
- uncertain data
- linear programming