Bucket elimination: A unifying framework for reasoning

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

(79)

Quantum annealing with Markov chain Monte Carlo simulations and D-wave quantum computers
Structured probabilistic inference
Semiring induced valuation algebras: exact and approximate local computation algorithms
Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
Dynamic Management of Heuristics for Solving Structured CSPs
A general scheme for automatic generation of search heuristics from specification $dependencies^{*}$
A Logical Approach to Constraint Satisfaction
Generating extended resolution proofs with a BDD-based SAT solver
AND/OR branch-and-bound search for combinatorial optimization in graphical models
Scalable Online Planning for Multi-Agent MDPs
ProCount: weighted projected model counting with graded project-join trees
Multi-dimensional classification with Bayesian networks
Symbolic bucket elimination for piecewise continuous constrained optimization
A logic of soft constraints based on partially ordered preferences
Bucket elimination for multiobjective optimization problems
Resource bounded and anytime approximation of belief function computations.
Practical solution techniques for first-order MDPs
Bucket elimination: a unifying framework for processing hard and soft constraints
Embedding Logics in the Local Computation Framework
Mixed deterministic and probabilistic networks
On conditional truncated densities Bayesian networks
A faster tree-decomposition based algorithm for counting linear extensions
Optimal 2-constraint satisfaction via sum-product algorithms
Dual proof generation for quantified Boolean formulas with a BDD-based solver
A faster tree-decomposition based algorithm for counting linear extensions
Residuation for soft constraints: lexicographic orders and approximation techniques
Sequential inference with reliable observations: Learning to construct force-dynamic models
MiniBrass: soft constraints for MiniZinc
Robustifying sum-product networks
Multi-language evaluation of exact solvers in graphical model discrete optimization
Representing and solving finite-domain constraint problems using systems of polynomials
Memory intensive AND/OR search for combinatorial optimization in graphical models
Thirty years of credal networks: specification, algorithms and complexity
Generic local computation
Algorithms and complexity results for persuasive argumentation
Depth-First Mini-Bucket Elimination
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
Probabilistic logic with independence
Decision making with multiple objectives using GAI networks
Probabilistic reasoning with graphical security models
Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs
scientific article; zbMATH DE number 1222282 (Why is no real title available?)
Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
New width parameters for SAT and \#SAT
Constant-degree graph expansions that preserve treewidth
Ordered valuation algebras: A generic framework for approximating inference
Unifying tree decompositions for reasoning in graphical models
Robust Solutions in Unstable Optimization Problems
Bayesian networks: regenerative Gibbs samplings
Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
Weighted heuristic anytime search: new schemes for optimization over graphical models
Methods for constructing balanced elimination trees and other recursive decompositions
CLP( $\cal{BN}$ ): Constraint Logic Programming for Probabilistic Knowledge
A logical approach to efficient Max-SAT solving
PRM inference using Jaffray \& Faÿ's local conditioning
On the state of the art in machine learning: A personal review
Understanding the scalability of Bayesian network inference using clique tree growth curves
Risk-based predictive maintenance for safety-critical systems by using probabilistic inference
SampleSearch: importance sampling in presence of determinism
Topological parameters for time-space tradeoff
Solving connected row convex constraints by variable elimination
AND/OR search spaces for graphical models
Sufficient and necessary conditions for solution finding in valuation-based systems
Speeding-up structured probabilistic inference using pattern mining
Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs
Exploiting Database Management Systems and Treewidth for Counting
Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
Valued constraint satisfaction problems
Mini-bucket Elimination with Bucket Propagation
Connected search for a lazy robber
Visualizing SAT instances and runs of the DPLL algorithm
Bucket renormalization for approximate inference
Clausal proofs for pseudo-Boolean reasoning
Marginalization without summation. Exploiting determinism in factor algebra
Virtual pairwise consistency in cost function networks
Generating Extended Resolution Proofs with a BDD-Based SAT Solver
Sum-of-Products with Default Values: Algorithms and Complexity Results
MPE inference in conditional linear Gaussian networks
Efficient Algorithms for Functional Constraints

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)