R. Bayardo and J. Pehoushek, Counting Models Using Connected Components, AAAI, pp.157-162, 2000.

A. Darwiche, New Advances in Compiling CNF into Decomposable Negation Normal Form, ECAI, pp.328-332, 2004.

R. Dechter and R. Mateescu, The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting, CP, pp.731-736, 2004.
DOI : 10.1007/978-3-540-30201-8_56

A. Favier, S. De-givry, and P. Jégou, Exploiting Problem Structure for Solution Counting, CP, pp.335-343, 2009.
DOI : 10.1007/11499107_24
URL : http://www.inra.fr/bia/T/degivry/Favier09a.pdf

V. Gogate and R. Dechter, Approximate Solution Sampling (and Counting) on AND/OR search spaces, CP, pp.534-538, 2008.
DOI : 10.1007/978-3-540-85958-1_37
URL : http://www.ics.uci.edu/~csp/r161.pdf

P. Jégou, H. Kanso, and C. Terrioux, Improving Exact Solution Counting for Decomposition Methods, 2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI), pp.327-334, 2016.
DOI : 10.1109/ICTAI.2016.0057

N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.
DOI : 10.1016/0196-6774(86)90023-4
URL : https://doi.org/10.1006/jctb.1996.0059

T. Sang, F. Bacchus, P. Beame, H. Kautz, and T. Pitassi, Combining Component Caching and Clause Learning for Effective Model Counting, SAT, 2004.

M. Thurley, sharpSAT ??? Counting Models with Advanced Component Caching and Implicit BCP, SAT, pp.424-429, 2006.
DOI : 10.1007/11814948_38

L. Valiant, The complexity of computing the permanent, Theoretical Computer Science, vol.8, issue.2, pp.189-201, 1979.
DOI : 10.1016/0304-3975(79)90044-6