5 citations · 5 across the 4 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2023★ 5 cited
On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits
Alexis de Colnet, Pierre Marquis
We consider the problem EnumIP of enumerating prime implicants of Boolean functions represented by decision decomposable negation normal form (dec-DNNF) circuits. We study EnumIP f…
cs.AI2021
A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints
Alexis de Colnet
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…