Bucket elimination: A unifying framework for reasoning
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1222282
- Bucket elimination: a unifying framework for processing hard and soft constraints
- A unifying principle for clause elimination in first-order logic
- Unification algorithms for eliminating and introducing quantifiers in natural deduction automated theorem proving
- scientific article; zbMATH DE number 65539
- Reasoning with BKBs -- algorithms and complexity
- On probabilistic elimination of generalized quantifiers
- Computer Algebra in Scientific Computing
Cited in
(83)- 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
- Symbolic bucket elimination for piecewise continuous constrained optimization
- Probabilistic reasoning with graphical security models
- On conditional truncated densities Bayesian networks
- Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs
- Robustifying sum-product networks
- Quantum annealing with Markov chain Monte Carlo simulations and D-wave quantum computers
- Ordered valuation algebras: A generic framework for approximating inference
- Structured probabilistic inference
- Generating extended resolution proofs with a BDD-based SAT solver
- Residuation for soft constraints: lexicographic orders and approximation techniques
- Dual proof generation for quantified Boolean formulas with a BDD-based solver
- ProCount: weighted projected model counting with graded project-join trees
- Thirty years of credal networks: specification, algorithms and complexity
- New width parameters for SAT and \#SAT
- Sufficient and necessary conditions for solution finding in valuation-based systems
- MiniBrass: soft constraints for MiniZinc
- Bucket elimination: a unifying framework for processing hard and soft constraints
- Speeding-up structured probabilistic inference using pattern mining
- Probabilistic logic with independence
- A logical approach to efficient Max-SAT solving
- Semiring induced valuation algebras: exact and approximate local computation algorithms
- Multi-language evaluation of exact solvers in graphical model discrete optimization
- 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
- MPE inference in conditional linear Gaussian networks
- Dynamic Management of Heuristics for Solving Structured CSPs
- Depth-First Mini-Bucket Elimination
- Mini-bucket Elimination with Bucket Propagation
- Representing and solving finite-domain constraint problems using systems of polynomials
- Generic local computation
- scientific article; zbMATH DE number 1222282 (Why is no real title available?)
- Embedding Logics in the Local Computation Framework
- Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
- Risk-based predictive maintenance for safety-critical systems by using probabilistic inference
- A faster tree-decomposition based algorithm for counting linear extensions
- Bayesian networks: regenerative Gibbs samplings
- Sum-of-Products with Default Values: Algorithms and Complexity Results
- Scalable Online Planning for Multi-Agent MDPs
- Weighted heuristic anytime search: new schemes for optimization over graphical models
- Robust Solutions in Unstable Optimization Problems
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
- Treewidth in non-ground answer set solving and alliance problems in graphs
- SampleSearch: importance sampling in presence of determinism
- CLP( $\cal{BN}$ ): Constraint Logic Programming for Probabilistic Knowledge
- Efficient Algorithms for Functional Constraints
- A Logical Approach to Constraint Satisfaction
- Bucket renormalization for approximate inference
- Topological parameters for time-space tradeoff
- A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
- 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
- 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
- Clausal proofs for pseudo-Boolean reasoning
- Valued constraint satisfaction problems
- Uncertainty reasoning for probabilistic Petri nets via Bayesian networks
- Theoretical foundations for parent divorcing transformations in Bayesian networks
- Any-k algorithms for enumerating ranked answers to conjunctive queries
- Bayesian networks: Exact inference via macro-node polytrees
- A faster tree-decomposition based algorithm for counting linear extensions
- 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
This page was built for publication: Bucket elimination: A unifying framework for reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978379)
