Optimal Upper and Lower Bounds for Boolean Expressions by Dissociation

Details Optimal Upper and Lower Bounds for Boolean Expressions by Dissociation Optimal Upper and Lower Bounds for Boolean Expressions by Dissociation

2011-05-13

arxiv.org/abs/1105.2813v1

Computer Science

Artificial Intelligence

7 pages, 2 figures; for details see the project page: http://LaPushDB.com/

Scientific paper

This paper develops upper and lower bounds for the probability of Boolean expressions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. Our technique generalizes and extends the underlying idea of a number of recent approaches which are varyingly called node splitting, variable renaming, variable splitting, or dissociation for probabilistic databases. We prove that the probabilities we assign to new variables are the best possible in some sense.

Affiliated with

Also associated with

No associations

Rating

Optimal Upper and Lower Bounds for Boolean Expressions by Dissociation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal Upper and Lower Bounds for Boolean Expressions by Dissociation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Upper and Lower Bounds for Boolean Expressions by Dissociation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-28125