Compiling Probabilistic Graphical Models Using Sentential Decision Diagrams

DOI10.1007/978-3-642-39091-3_11zbMath1390.68640OpenAlexW207890491MaRDI QIDQ5326412

Arthur Choi, Doğa Gizem Kisa, Adnan Darwiche

Publication date: 5 August 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39091-3_11

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (10)

\(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs ⋮ Weighted positive binary decision diagrams for exact probabilistic inference ⋮ Approximate Counting with Deterministic Guarantees for Affinity Computation ⋮ kProbLog: an algebraic Prolog for machine learning ⋮ Definability for model counting ⋮ A compositional approach to probabilistic knowledge compilation ⋮ \textsc{Strudel}: A fast and accurate learner of structured-decomposable probabilistic circuits ⋮ Advanced SMT techniques for weighted model integration ⋮ Multi-Label Classification Neural Networks with Hard Logical Constraints ⋮ Weighted model counting without parameter variables

This page was built for publication: Compiling Probabilistic Graphical Models Using Sentential Decision Diagrams