Siegfried Nijssen’s Post

Last week, Alexandre Dubray presented "Anytime Weighted Model Counting with Approximation Guarantees for Probabilistic Inference", joined work with Pierre Schaus, at the Constraint Programming conference. In this work, we show how to modify a model counting solver to calculate an approximate model count, with approximation guarantees at any moment the solver is stopped. We believe such a solver can be useful for inference tasks on many probabilistic models: Bayesian networks, neurosymbolic models, and more. https://lnkd.in/eg8FQcBc

Anytime Weighted Model Counting with Approximation Guarantees for Probabilistic Inference

Anytime Weighted Model Counting with Approximation Guarantees for Probabilistic Inference

drops.dagstuhl.de

To view or add a comment, sign in

Explore topics