1. Lecture Notes in Computer Science;O. Angelsmark,2003
2. Dahllöf, V., Jonsonn, P., Wahlström, M.: Counting models for 2SAT and 3SAT formulae. J. Theoretical Computer Sciences 332(1-3), 265–291 (2005)
3. Darwiche, A.: On the Tractability of Counting Theory Models and its Application to Belief Revision and Truth Maintenance. J. of Applied Non-classical Logics 11(1-2), 11–34 (2001)
4. De Ita, G., Tovar, M.: Applying Counting Models of Boolean Formulas to Propositional Inference. J. Advances in Computer Science and Engineering Researching in Computing Science 19, 159–170 (2006)
5. De Ita, G., Bello, P., Contreras, M.: New Polynomial Classes for #2SAT Established via Graph-Topological Structure. Engineering Letters 15(2), 250–258 (2007)