5 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.CC2024
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL
Leroy Chew, Alexis de Colnet, Friedrich Slivovsky +1
Parity reasoning is challenging for Conflict-Driven Clause Learning (CDCL) SAT solvers. This has been observed even for simple formulas encoding two contradictory parity constraint…
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…