AND/OR search spaces for graphical models

DOI10.1016/j.artint.2006.11.003zbMath1168.68549MaRDI QIDQ1028898

Rina Dechter, Robert Mateescu

Publication date: 9 July 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2006.11.003

zbMATH Keywords

Bayesian networks; decomposition; search; constraint networks; graphical models; AND/OR search

Mathematics Subject Classification ID

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Robust Solutions in Unstable Optimization Problems, Concurrent forward bounding for distributed constraint optimization problems, Max margin learning of hierarchical configural deformable templates (HCDTs) for efficient object parsing and pose estimation, Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models, SampleSearch: importance sampling in presence of determinism, Mixed deterministic and probabilistic networks, Efficient sequence alignment with side-constraints by cluster tree elimination, AND/OR branch-and-bound search for combinatorial optimization in graphical models, Memory intensive AND/OR search for combinatorial optimization in graphical models, Importance sampling-based estimation over AND/OR search spaces for graphical models, Evaluating the impact of AND/OR search on 0-1 integer linear programming, On probabilistic inference by weighted model counting, Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks, Computational protein design as an optimization problem, Case-factor diagrams for structured probabilistic modeling, Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets

Uses Software

• AIS-BN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph driven BDDs -- a new data structure for Boolean functions
• Hybrid backtracking bounded by tree-decomposition of constraint networks
• Graph minors. I. Excluding a forest
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• Network-based heuristics for constraint-satisfaction problems
• Tree clustering for constraint networks
• Quickly excluding a forest
• Backjump-based backtracking for constraint satisfaction problems
• Resolution versus search: Two strategies for SAT
• Bucket elimination: A unifying framework for reasoning
• Compiling CSPs into tree-driven automata for interactive solving
• Unifying tree decompositions for reasoning in graphical models
• Adopt: asynchronous distributed constraint optimization with quality guarantees
• Case-factor diagrams for structured probabilistic modeling
• A differential approach to inference in Bayesian networks
• Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
• Graph-Based Algorithms for Boolean Function Manipulation
• Valuation-Based Systems for Bayesian Decision Analysis
• Efficient Boolean manipulation with OBDD's can be extended to FBDD's
• GRASP: a search algorithm for propositional satisfiability
• Interpolants and Symbolic Model Checking
• Principles and Practice of Constraint Programming – CP 2003
• Recursive conditioning