# Backdoor Decomposable Monotone Circuits and their Propagation Complete Encodings

23 Nov 2018Petr KučeraPetr Savický

We describe a compilation language of backdoor decomposable monotone circuits (BDMCs) which generalizes several concepts appearing in the literature, e.g. DNNFs and backdoor trees. A $\mathcal{C}$-BDMC sentence is a monotone circuit which satisfies decomposability property (such as in DNNF) in which the inputs (or leaves) are associated with CNF encodings from a given base class $\mathcal{C}$... (read more)

PDF Abstract

No code implementations yet. Submit your code now