A. Amarilli, Leveraging the Structure of Uncertain Data, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01345836

A. Amarilli, P. Bourhis, L. Jachiet, and S. Mengel, A circuit-based approach to efficient enumeration, ICALP, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01639179

A. Amarilli, P. Bourhis, M. Monet, and P. Senellart, Combined tractability of query evaluation via tree automata and cycluits, ICDT, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01439294

A. Amarilli, P. Bourhis, M. Monet, and P. Senellart, Combined tractability of query evaluation via tree automata and cycluits (Extended version, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01439309

A. Amarilli, P. Bourhis, and P. Senellart, Provenance circuits for trees and treelike instances (extended version). CoRR, abs/1511, 2015.
DOI : 10.1007/978-3-662-47666-6_5
URL : http://arxiv.org/pdf/1511.08723

A. Amarilli, P. Bourhis, and P. Senellart, Provenance Circuits for Trees and Treelike Instances, ICALP, 2015.
DOI : 10.1007/978-3-662-47666-6_5
URL : https://hal.archives-ouvertes.fr/hal-01178399

A. Amarilli, P. Bourhis, and P. Senellart, Tractable Lineages on Treelike Instances, Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS '16, 2016.
DOI : 10.1016/j.tcs.2007.05.023
URL : https://hal.archives-ouvertes.fr/hal-01336514

A. Amarilli, M. Monet, and P. Senellart, Connecting width and structure in knowledge compilation (extended version). CoRR, abs, 1709.
URL : https://hal.archives-ouvertes.fr/hal-01614551

P. Beame and V. Liew, New limits for knowledge compilation and applications to exact model counting, UAI, 2015.

L. Bodlaender, A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput, vol.25, issue.6, 1996.
DOI : 10.1137/s0097539793251219
URL : http://igitur-archive.library.uu.nl/math/2001-0625-164338/1992-27.pdf

S. Bova, SDDs are exponentially more succinct than OBDDs, AAAI, 2016.

S. Bova, F. Capelli, S. Mengel, and F. Slivovsky, A strongly exponential separation of DNNFs from CNF formulas, 1411.

S. Bova, F. Capelli, S. Mengel, and F. Slivovsky, Knowledge compilation meets communication complexity, IJCAI, 2016.

S. Bova and F. Slivovsky, On compiling structured CNFs to OBDDs, 2015.
DOI : 10.1007/978-3-319-20297-6_6
URL : http://arxiv.org/pdf/1411.5494

S. Bova and F. Slivovsky, On compiling structured CNFs to OBDDs, TCS, vol.61, issue.2, p.2017
DOI : 10.1007/978-3-319-20297-6_6
URL : http://arxiv.org/pdf/1411.5494

S. Bova and S. Szeider, Circuit Treewidth, Sentential Decision, and Query Compilation, Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems , PODS '17, 2017.
DOI : 10.1137/1.9780898719789
URL : http://arxiv.org/pdf/1701.04626

R. E. Bryant, Symbolic Boolean manipulation with ordered binary-decision diagrams, ACM Computing Surveys, vol.24, issue.3, 1992.
DOI : 10.1145/136035.136043
URL : http://www.cs.cmu.edu/~bryant/pubs.pdf

A. Calì, F. Capelli, and I. Razgon, Non-FPT lower bounds for structural restrictions of decision DNNF. CoRR, abs, 1708.

F. Capelli, Structural restrictions of CNF-formulas: applications to model counting and knowledge compilation, 2016.

F. Capelli, Understanding the complexity of #SAT using knowledge compilation, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017.
DOI : 10.1109/LICS.2017.8005121
URL : https://hal.archives-ouvertes.fr/hal-01836195

, 21

C. Chekuri and J. Chuzhoy, Polynomial bounds for the grid-minor theorem, STOC, 2014.

A. Darwiche, On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision, Journal of Applied Non-Classical Logics, vol.8, issue.1-2, 2001.
DOI : 10.1016/0304-3975(94)00078-W

A. Darwiche, A differential approach to inference in Bayesian networks, Journal of the ACM, vol.50, issue.3, 2003.
DOI : 10.1145/765568.765570

A. Darwiche, SDD: A new canonical representation of propositional knowledge bases, IJCAI, 2011.

A. Amarilli and M. Monet, and Pierre Senellart, vol.6, p.17

S. Devadas, Comparing two-level and ordered binary decision diagram representations of logic functions, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.12, issue.5, 1993.
DOI : 10.1109/43.277617

A. Ferrara, G. Pan, and M. Y. Vardi, Treewidth in Verification: Local vs. Global, LPAR, 2005.
DOI : 10.1007/11591191_34

D. Fierens, G. Van-den-broeck, J. Renkens, D. Shterionov, B. Gutmann et al., Abstract, Theory and Practice of Logic Programming, vol.35, issue.03, pp.15-2015
DOI : 10.1017/S1471068411000664

J. Flum, M. Frick, and M. Grohe, Query evaluation via tree-decompositions, J. ACM, vol.49, issue.6, 2002.

M. Grohe and D. Marx, On tree width, bramble size, and expansion, Journal of Combinatorial Theory, Series B, vol.99, issue.1, 2009.
DOI : 10.1016/j.jctb.2008.06.004
URL : https://doi.org/10.1016/j.jctb.2008.06.004

A. Kumar-jha, D. Olteanu, and D. Suciu, Bridging the gap between intensional and extensional query evaluation in probabilistic databases, EDBT, 2010.

A. Kumar, J. , and D. Suciu, Knowledge compilation meets database theory: compiling queries to decision diagrams, ICDT, 2011.

A. Kumar, J. , and D. Suciu, On the tractability of query compilation and bounded treewidth, ICDT, 2012.

L. Steffen, D. J. Lauritzen, and . Spiegelhalter, Local computations with probabilities on graphical structures and their application to expert systems, J. Royal Statistical Society. Series B, 1988.

A. Nordstrand, Exploring graph parameters similar to tree-width and pathwidth, 2017.

K. Pipatsrisawat and A. Darwiche, New compilation languages based on structured decomposability, AAAI, 2008.

K. Pipatsrisawat and A. Darwiche, A lower bound on the size of decomposable negation normal form, AAAI, 2010.

I. Razgon, On OBDDs for CNFs of bounded treewidth, In KR, 2014.

N. Robertson and P. Seymour, Graph minors. X. Obstructions to tree-decomposition, Journal of Combinatorial Theory, Series B, vol.52, issue.2, pp.153-190, 1991.
DOI : 10.1016/0095-8956(91)90061-N
URL : https://doi.org/10.1006/jctb.1999.1919

D. Suciu, D. Olteanu, C. Ré, and C. Koch, Probabilistic Databases, 2011.
DOI : 10.1007/978-1-4899-7993-3_275-2

M. Vatshelle, New width parameters of graphs, 2012.