This work proposes a novel knowledge compilation approach, named KC-min, that enables efficient counting of minimal models of Boolean formulas.
