Search Results for author:
Found 3 papers, 0 papers with code
On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits
We consider the problem EnumIP of enumerating prime implicants of Boolean functions represented by decision decomposable negation normal form (dec-DNNF) circuits.
A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints
Two major considerations when encoding pseudo-Boolean (PB) constraints into SAT are the size of the encoding and its propagation strength, that is, the guarantee that it has a good behaviour under unit propagation.
Lower Bounds for Approximate Knowledge Compilation
Moreover, there are known size lower bounds for d-DNNF which by relaxing to approximation one might be able to avoid.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
