Probabilistic Horn abduction and Bayesian networks
Artificial Intelligence
On the hardness of approximate reasoning
Artificial Intelligence
A probabilistic relational algebra for the integration of information retrieval and database systems
ACM Transactions on Information Systems (TOIS)
A revolution: belief propagation in graphs with cycles
NIPS '97 Proceedings of the 1997 conference on Advances in neural information processing systems 10
Mini-buckets: A general scheme for bounded inference
Journal of the ACM (JACM)
Boolean Functions
Efficient query evaluation on probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
On probabilistic inference by weighted model counting
Artificial Intelligence
MCDB: a monte carlo approach to managing uncertain data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Using OBDDs for Efficient Query Evaluation on Probabilistic Databases
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
Integrating and Ranking Uncertain Scientific Data
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Journal of Artificial Intelligence Research
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
Proceedings of the 13th International Conference on Extending Database Technology
A constraint store based on multivalued decision diagrams
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Structural relaxations by variable renaming and their compilation for solving MinCostSAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Clone: solving weighted Max-SAT in a reduced search space
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Computing query probability with incidence algebras
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Read-once functions and query evaluation in probabilistic databases
Proceedings of the VLDB Endowment
SampleSearch: Importance sampling in presence of determinism
Artificial Intelligence
On the optimal approximation of queries using tractable propositional languages
Proceedings of the 14th International Conference on Database Theory
Manipulating MDD relaxations for combinatorial optimization
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Relax, compensate and then recover
JSAI-isAI'10 Proceedings of the 2010 international conference on New Frontiers in Artificial Intelligence
Lifted probabilistic inference by first-order knowledge compilation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Hi-index | 0.00 |
This article 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, that is, when the new probabilities are chosen independently 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.