Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Principles of artificial intelligence
Principles of artificial intelligence
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Tree clustering for constraint networks (research note)
Artificial Intelligence
Valuation-based systems for Bayesian decision analysis
Operations Research
Edge-valued binary decision diagrams for multi-level hierarchical verification
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Algebraic decision diagrams and their applications
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
The disjunctive decomposition of logic functions
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
Model checking
Boolean function representation and spectral characterization using AND/OR graphs
Integration, the VLSI Journal
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Disjoint pattern database heuristics
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Symbolic Model Checking
Factored Edge-Valued Binary Decision Diagrams
Formal Methods in System Design
Hierarchical Representations of Discrete Functions, with Application to Model Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Hybrid backtracking bounded by tree-decomposition of constraint networks
Artificial Intelligence
K*BMDs: A New Data Structure for Verification
EDTC '96 Proceedings of the 1996 European conference on Design and Test
Algorithms and Complexity Results for #SAT and Bayesian Inference
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Probabilistic decision graphs-combining verification and AI techniques for probabilistic inference
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems - New trends in probabilistic graphical models
Mixtures of deterministic-probabilistic networks and their AND/OR search space
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Case-factor diagrams for structured probabilistic modeling
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Unifying tree decompositions for reasoning in graphical models
Artificial Intelligence
Adopt: asynchronous distributed constraint optimization with quality guarantees
Artificial Intelligence - Special issue: Distributed constraint satisfaction
A survey on knowledge compilation
AI Communications
AND/OR search spaces for graphical models
Artificial Intelligence
IEEE Transactions on Computers
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
On compiling system models for faster and more scalable diagnosis
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
On valued negation normal form formulas
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Compiling Bayesian networks using variable elimination
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
DPLL with a trace: from SAT to knowledge compilation
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Decision diagrams for the computation of semiring valuations
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Compiling Bayesian networks with local structure
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Compiling relational Bayesian networks for exact inference
International Journal of Approximate Reasoning
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
New advances in inference by recursive conditioning
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Value elimination: bayesian inference via backtracking search
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Interactive cost configuration over decision diagrams
Journal of Artificial Intelligence Research
Existential closures for knowledge compilation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Algorithms for generating ordered solutions for explicit and/or structures
Journal of Artificial Intelligence Research
Knowledge compilation for model counting: affine decision trees
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
The inclusion-exclusion rule and its application to the junction tree algorithm
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
Inspired by the recently introduced framework of AND/OR search spaces for graphical models, we propose to augment Multi-Valued Decision Diagrams (MDD) with AND nodes, in order to capture function decomposition structure and to extend these compiled data structures to general weighted graphical models (e.g., probabilistic models). We present the AND/OR Multi-Valued Decision Diagram (AOMDD) which compiles a graphical model into a canonical form that supports polynomial (e.g., solution counting, belief updating) or constant time (e.g. equivalence of graphical models) queries. We provide two algorithms for compiling the AOMDD of a graphical model. The first is search-based, and works by applying reduction rules to the trace of the memory intensive AND/OR search algorithm. The second is inference-based and uses a Bucket Elimination schedule to combine the AOMDDs of the input functions via the the APPLY operator. For both algorithms, the compilation time and the size of the AOMDD are, in the worst case, exponential in the treewidth of the graphical model, rather than pathwidth as is known for ordered binary decision diagrams (OBDDs). We introduce the concept of semantic treewidth, which helps explain why the size of a decision diagram is often much smaller than the worst case bound. We provide an experimental evaluation that demonstrates the potential of AOMDDs.