Like OBDDs, SDDs allow for tractable Boolean operations, while being exponentially more succinct.
[2] Provided that they satisfy additional properties known as compression and trimming (which are analogous to ROBDDs), SDDs are a canonical representation of Boolean functions; that is, they are unique given a vtree.
[2] Like OBDDs, they allow for operations such as conjunction, disjunction and negation to be computed directly on the representation in polynomial time, while being potentially more compact.
[5] SDDs are used as a compilation target for probabilistic logic programs by the ProbLog 2 system since they support tractable (weighted) model counting as well as tractable negation, conjunction and disjunction while being more succinct than BDDs.
[3] SDDs have also been extended to model probability distributions, in which context they are known as probabilistic sentential decision diagrams (PSDD).