5 citations · 9 across the 3 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2019★ 1 cited
Propagation complete encodings of smooth DNNF theories
Petr Kučera, Petr Savický
We investigate conjunctive normal form (CNF) encodings of a function represented with a decomposable negation normal form (DNNF). Several encodings of DNNFs and decision diagrams w…
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.…