Model counting is the problem of calculating the number of truth assignments (or models) satisfying a given propositional formula (typically represented as a CNF). While SAT solving is known to be one of famous NP-complete problems, model couting is known to be #P-complete.
Our research focus is projected model counting and enumeration. In projected model counting, given a propositional formula F and a subset P of variables (called projection variables), we count models of F with respect to P. We are developing solvers for projected model counting and enumeration.
GPMC is an exact projected model counter for CNF formulas.
PC2BDD constructs a BDD which represents a set of projected models for a CNF formula and a set of projection variables.
Last modified: Sep.15.2021.