Efficient counting of models for boolean formulas represented by embedded cycles.
Guillermo De Ita Luna, Pedro Bello, Meliza Contreras González · 2007
To compute the number of models of a 2-CF (conjunction of clauses with two literals at most), the well-known problem as #2-SAT, is a classical #P-complete problem. We show here an extensive class of instances of 2CF’s where to compute the number of models can be done