A Compositional Atlas for Algebraic Circuits

The key feature of circuits is that they enable one to precisely characterize tractability conditions (structural properties of the circuit) under which a given inference query can be computed exactly and efficiently. One can then enforce these circuit properties when compiling or learning a model to enable tractable inference.