Oblivious Bounds on the Probability of Boolean Functions

09/21/2014
by   Wolfgang Gatterbauer, et al.
0

This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an exact characterization of optimal oblivious bounds, i.e. when the new probabilities are chosen independent of the probabilities of all other variables. Our motivation comes from the weighted model counting problem (or, equivalently, the problem of computing the probability of a Boolean function), which is #P-hard in general. By performing several dissociations, one can transform a Boolean formula whose probability is difficult to compute, into one whose probability is easy to compute, and which is guaranteed to provide an upper or lower bound on the probability of the original formula by choosing appropriate probabilities for the dissociated variables. Our new bounds shed light on the connection between previous relaxation-based and model-based approximations and unify them as concrete choices in a larger design space. We also show how our theory allows a standard relational database management system (DBMS) to both upper and lower bound hard probabilistic queries in guaranteed polynomial time.

READ FULL TEXT
research
05/13/2011

Optimal Upper and Lower Bounds for Boolean Expressions by Dissociation

This paper develops upper and lower bounds for the probability of Boolea...
research
08/15/2020

On Partial Differential Encodings, with Application to Boolean Circuits

The present work argues that strong arithmetic circuit lower bounds yiel...
research
10/06/2019

On the Probabilistic Degrees of Symmetric Boolean functions

The probabilistic degree of a Boolean function f:{0,1}^n→{0,1} is define...
research
08/19/2020

Tractable Inference in Credal Sentential Decision Diagrams

Probabilistic sentential decision diagrams are logic circuits where the ...
research
02/13/2013

Independence with Lower and Upper Probabilities

It is shown that the ability of the interval probability representation ...
research
01/13/2023

Constriction for sets of probabilities

Given a set of probability measures 𝒫 representing an agent's knowledge ...
research
10/21/2019

Maximum Probability Principle and Black-Box Priors

We present an axiomatic way of assigning probabilities to black box mode...

Please sign up or login with your details

Forgot password? Click here to reset