collaborators

1 paper

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…