2 papers
cs.LO2020
Bounds on the size of PC and URC formulas
Petr Kučera, Petr Savický
In this paper we investigate CNF formulas, for which the unit propagation is strong enough to derive a contradiction if the formula together with a partial assignment of the variab…
cs.AI2018
Backdoor Decomposable Monotone Circuits and their Propagation Complete Encodings
Petr Kučera, Petr 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.…