5 citations · 5 across the 4 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.CC2021
Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation
Alexis de Colnet, Stefan Mengel
Bottom-up knowledge compilation is a paradigm for generating representations of functions by iteratively conjoining constraints using a so-called apply function. When the input is…
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…