Graph-Based Algorithms for Boolean Function Manipulation

By Sofia Cassel. 2012

748 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/f5c1b943517eabf5ef33d95d922f1343e88960d0

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Dan Suciu
2. Guy Van den Broeck
3. Frédéric Koriche
4. Anton Lykov
5. Maximilian Schleich
6. Berk Ustun

Citations in the corpus

• On the Tractability of SHAP Explanations (2020, background): “Expectations can be computed in time linear in the size of various circuit representations, called d-DNNF, which includes binary decision diagrams (OBDD, FBDD) and SDDs (Bryant 1986; Darwiche and Marquis 2002).”
• Compiling Combinatorial Prediction Games (2018, methodology): “(2018) used the class of Ordered Binary Decision Diagrams (OBDDs) (Bryant, 1986) for implementing the EWA forecaster in combinatorial bandits.”