In recent years we have viewed tremendous improvements in the field of Propositional satisfiability (SAT). Many NPcomplete problems from a variety of domains, such as classic planning problems (Kautz 1999), have been compiled into SAT instances, and solved effectively by SAT solvers (Zhang et al 2001). On the other hand, the problem of counting the number of models of a prepositional formula (#...