Bucket elimination: A unifying framework for reasoning
From MaRDI portal
Publication:1978379
DOI10.1016/S0004-3702(99)00059-4zbMath0939.68847MaRDI QIDQ1978379
Publication date: 4 June 2000
Published in: Artificial Intelligence (Search for Journal in Brave)
algorithms; dynamic programming; automated reasoning; inference; constraint networks; belief networks; rearch
68T35: Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence
Related Items
Embedding Logics in the Local Computation Framework, Robust Solutions in Unstable Optimization Problems, CLP( $\cal{BN}$ ): Constraint Logic Programming for Probabilistic Knowledge, Efficient Algorithms for Functional Constraints, A Logical Approach to Constraint Satisfaction, Topological parameters for time-space tradeoff, A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\), SampleSearch: importance sampling in presence of determinism, Constant-degree graph expansions that preserve treewidth, Algorithms and complexity results for persuasive argumentation, Decision making with multiple objectives using GAI networks, Multi-dimensional classification with Bayesian networks, PRM inference using Jaffray \& Faÿ's local conditioning, Practical solution techniques for first-order MDPs, Solving connected row convex constraints by variable elimination, Mixed deterministic and probabilistic networks, Optimal 2-constraint satisfaction via sum-product algorithms, Methods for constructing balanced elimination trees and other recursive decompositions, Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination, Understanding the scalability of Bayesian network inference using clique tree growth curves, 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, Resource bounded and anytime approximation of belief function computations., On the state of the art in machine learning: A personal review, Ordered valuation algebras: A generic framework for approximating inference, Probabilistic logic with independence, A logical approach to efficient Max-SAT solving, Semiring induced valuation algebras: exact and approximate local computation algorithms, Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks, 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, A logic of soft constraints based on partially ordered preferences, Bucket elimination for multiobjective optimization problems, Marginalization without Summation Exploiting Determinism in Factor Algebra, Dynamic Management of Heuristics for Solving Structured CSPs
