Bucket elimination: A unifying framework for reasoning
From MaRDI portal
Publication:1978379
DOI10.1016/S0004-3702(99)00059-4zbMath0939.68847OpenAlexW1982333717WikidataQ127740623 ScholiaQ127740623MaRDI QIDQ1978379
Publication date: 4 June 2000
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(99)00059-4
Related Items
Ordered valuation algebras: A generic framework for approximating inference ⋮ Practical solution techniques for first-order MDPs ⋮ Solving connected row convex constraints by variable elimination ⋮ MPE Inference in Conditional Linear Gaussian Networks ⋮ Mixed deterministic and probabilistic networks ⋮ Bayesian networks: regenerative Gibbs samplings ⋮ Optimal 2-constraint satisfaction via sum-product algorithms ⋮ Probabilistic logic with independence ⋮ A logical approach to efficient Max-SAT solving ⋮ Semiring induced valuation algebras: exact and approximate local computation algorithms ⋮ Sum-of-Products with Default Values: Algorithms and Complexity Results ⋮ Scalable Online Planning for Multi-Agent MDPs ⋮ Multi-language evaluation of exact solvers in graphical model discrete optimization ⋮ Representing and solving finite-domain constraint problems using systems of polynomials ⋮ Probabilistic reasoning with graphical security models ⋮ On conditional truncated densities Bayesian networks ⋮ Exploiting Database Management Systems and Treewidth for Counting ⋮ Connected search for a lazy robber ⋮ Virtual pairwise consistency in cost function networks ⋮ Generating Extended Resolution Proofs with a BDD-Based SAT Solver ⋮ Resource bounded and anytime approximation of belief function computations. ⋮ Generic local computation ⋮ Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks ⋮ Constant-degree graph expansions that preserve treewidth ⋮ Structured probabilistic inference ⋮ Thirty years of credal networks: specification, algorithms and complexity ⋮ Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs ⋮ Dynamic Management of Heuristics for Solving Structured CSPs ⋮ Algorithms and complexity results for persuasive argumentation ⋮ Decision making with multiple objectives using GAI networks ⋮ Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs ⋮ Multi-dimensional classification with Bayesian networks ⋮ PRM inference using Jaffray \& Faÿ's local conditioning ⋮ Robustifying sum-product networks ⋮ Risk-based predictive maintenance for safety-critical systems by using probabilistic inference ⋮ Solving Graph Problems via Potential Maximal Cliques ⋮ Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering ⋮ Sequential inference with reliable observations: Learning to construct force-dynamic models ⋮ Unifying tree decompositions for reasoning in graphical models ⋮ Visualizing SAT instances and runs of the DPLL algorithm ⋮ New width parameters for SAT and \#SAT ⋮ A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions ⋮ Marginalization without Summation Exploiting Determinism in Factor Algebra ⋮ Weighted heuristic anytime search: new schemes for optimization over graphical models ⋮ Methods for constructing balanced elimination trees and other recursive decompositions ⋮ SampleSearch: importance sampling in presence of determinism ⋮ Topological parameters for time-space tradeoff ⋮ A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\) ⋮ Robust Solutions in Unstable Optimization Problems ⋮ Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination ⋮ Understanding the scalability of Bayesian network inference using clique tree growth curves ⋮ A logic of soft constraints based on partially ordered preferences ⋮ Bucket elimination for multiobjective optimization problems ⋮ Quantum annealing with Markov chain Monte Carlo simulations and D-wave quantum computers ⋮ CLP( $\cal{BN}$ ): Constraint Logic Programming for Probabilistic Knowledge ⋮ Generating extended resolution proofs with a BDD-based SAT solver ⋮ Embedding Logics in the Local Computation Framework ⋮ Sufficient and necessary conditions for solution finding in valuation-based systems ⋮ Residuation for soft constraints: lexicographic orders and approximation techniques ⋮ Dual proof generation for quantified Boolean formulas with a BDD-based solver ⋮ Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited ⋮ AND/OR search spaces for graphical models ⋮ AND/OR branch-and-bound search for combinatorial optimization in graphical models ⋮ Memory intensive AND/OR search for combinatorial optimization in graphical models ⋮ MiniBrass: soft constraints for MiniZinc ⋮ A faster tree-decomposition based algorithm for counting linear extensions ⋮ Efficient Algorithms for Functional Constraints ⋮ A Logical Approach to Constraint Satisfaction ⋮ Bucket renormalization for approximate inference ⋮ On the state of the art in machine learning: A personal review ⋮ Speeding-up structured probabilistic inference using pattern mining ⋮ ProCount: weighted projected model counting with graded project-join trees
