Operations Research
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
A machine program for theorem-proving
Communications of the ACM
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
Counting Models Using Connected Components
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
On the Forward Checking Algorithm
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Algorithms and Complexity Results for #SAT and Bayesian Inference
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Context-specific independence in Bayesian networks
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
AND/OR search spaces for graphical models
Artificial Intelligence
Case-factor diagrams for structured probabilistic modeling
Journal of Computer and System Sciences
On probabilistic inference by weighted model counting
Artificial Intelligence
Mixed deterministic and probabilistic networks
Annals of Mathematics and Artificial Intelligence
Memory intensive branch-and-bound search for graphical models
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Exploiting tree decomposition and soft local consistency in weighted CSP
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models
Artificial Intelligence
Memory intensive AND/OR search for combinatorial optimization in graphical models
Artificial Intelligence
Generalized graphical abstractions for statistical machine translation
NAACL-Short '07 Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers
DC-SSAT: a divide-and-conquer approach to solving stochastic satisfiability problems efficiently
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Performing Bayesian inference by weighted model counting
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
Journal of Artificial Intelligence Research
A dynamic approach to MPE and weighted MAX-SAT
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
ACM Transactions on Computation Theory (TOCT)
Recognizing activities with multiple cues
Proceedings of the 2nd conference on Human motion: understanding, modeling, capture and animation
Improvements to message computation in lazy propagation
International Journal of Approximate Reasoning
Join-graph propagation algorithms
Journal of Artificial Intelligence Research
Heuristics for fast exact model counting
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
A search problem in complex diagnostic Bayesian networks
Knowledge-Based Systems
Importance sampling-based estimation over AND/OR search spaces for graphical models
Artificial Intelligence
Anytime AND/OR depth-first search for combinatorial optimization
AI Communications - The Symposium on Combinatorial Search
Hi-index | 0.01 |
We present Value Elimination, a new algorithm for Bayesian Inference. Given the same variable ordering information, Value Elimination can achieve performance that is within a constant factor of variable elimination or recursive conditioning, and on some problems it can perform exponentially better, irrespective of the variable ordering used by these algorithms. Value Elimination's other features include: (1) it can achieve the same space-time tradeoff guarantees as recursive conditioning; (2) it can utilize all of the logical reasoning techniques used in state of the art SAT solvers; these techniques allow it to obtain considerable extra mileage out of zero entries in the CPTs; (3) it can be naturally and easily extended to take advantage of context specific structure; and (4) it supports dynamic variable orderings which might be particularly advantageous in the presence of context specific structure. We have implemented a version of Value Elimination that demonstrates very promising performance, often being one or two orders of magnitude faster than a commercial Bayes inference engine, despite the fact that it does not as yet take advantage of context specific structure.