S. Abiteboul, R. Hull, and V. Vianu, Foundations of databases, 1995.

A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, 1974.

A. Amarilli, P. Bourhis, L. Jachiet, and S. Mengel, A circuit-based approach to efficient enumeration URL: https, 2017.

A. Amarilli, P. Bourhis, and P. Senellart, Provenance circuits for trees and treelike instances URL: https, ICALP, 2015.
DOI : 10.1007/978-3-662-47666-6_5
URL : http://arxiv.org/pdf/1511.08723

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

G. Bagan, MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay, CSL, 2006.
DOI : 10.1007/11874683_11

G. Bagan, A. Durand, E. Filiot, and O. Gauwin, Efficient Enumeration for Conjunctive Queries over X-underbar Structures, CSL, 2010. URL
DOI : 10.1007/978-3-642-15205-4_10
URL : https://hal.archives-ouvertes.fr/hal-00489955

G. Bagan, A. Durand, and E. Grandjean, On Acyclic Conjunctive Queries and Constant Delay Enumeration, CSL, 2007.
DOI : 10.1007/978-3-540-74915-8_18
URL : https://hal.archives-ouvertes.fr/hal-00195010

G. Bagan, A. Durand, E. Grandjean, and F. Olive, Computing the jth solution of a first-order query URL: https, ITA, vol.42, issue.1, 2008.

T. 10-nurzhan-bakibayev, D. Ko?isk-`-ko?isk-`-y, J. Olteanu, and . Závodn, Závodn`y. Aggregation and ordering in factorised databases URL: https, 2013.

A. David, N. Mix-barrington, H. Immerman, and . Straubing, On uniformity within NC 1, JCSS, vol.41, issue.3, 1990.

S. Bova, F. Capelli, S. Mengel, and F. Slivovsky, On Compiling CNFs into Structured Deterministic DNNFs, SAT, 2015.
DOI : 10.1007/978-3-642-45030-3_63

S. Bova and S. Szeider, Circuit treewidth, sentential decision, and query compilation URL: https, PODS, 2017.
DOI : 10.1145/3034786.3034787

A. Choi and A. Darwiche, Dynamic minimization of sentential decision diagrams, AAAI, 2013.

T. Colcombet, A combinatorial theorem for trees URL: https: //www.irif.fr/~colcombe, ICALP, 2007.
DOI : 10.1007/978-3-540-73420-8_77

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 and P. Marquis, A knowledge compilation map URL: https://www.jair.org/media, JAIR, vol.17989, 2002.

A. Durand and E. Grandjean, First-order queries on structures of bounded degree are computable with constant delay URL: https://arxiv, TOCL, vol.8, issue.4, p.507020, 2007.

A. Durand, N. Schweikardt, and L. Segoufin, Enumerating answers to firstorder queries over databases of low degree URL: https, PODS, 2014.
DOI : 10.1145/2594538.2594539
URL : http://www.lsv.ens-cachan.fr/%7Esegoufin/Papers/Mypapers/cdlin-lowdeg.pdf

J. Huang and A. Darwiche, DPLL with a trace: From SAT to knowledge compilation, IJCAI, 2005. URL: https://ijcai.org/Proceedings/05/Papers/0876.pdf

K. Jha and D. Suciu, Knowledge compilation meets database theory, Proceedings of the 14th International Conference on Database Theory, ICDT '11, p.2013
DOI : 10.1145/1938551.1938574

W. Kazana, Query evaluation with constant delay École normale supérieure de Cachan URL: https, 2013.

W. Kazana and L. Segoufin, Enumeration of first-order queries on classes of structures with bounded expansion URL: https, PODS. ACM, 2013.

W. Kazana and L. Segoufin, Enumeration of monadic second-order queries on trees URL: https://hal.archives-ouvertes.fr, 2013.

L. Libkin, Elements of Finite Model Theory 28 Katja Losemann and Wim Martens. MSO queries on trees: enumerating answers under updates, CSL-LICS, 2004.

D. Olteanu and J. Závodn, Size Bounds for Factorised Representations of Query Results, ACM Transactions on Database Systems, vol.40, issue.1, 2015.
DOI : 10.14778/2536222.2536232

U. Oztok and A. Darwiche, A top-down compiler for sentential decision diagrams URL: http://reasoning.cs.ucla.edu/fetch.php?id=157&type=pdf. 31 Knot Pipatsrisawat and Adnan Darwiche. New compilation languages based on structured decomposability, IJCAI AAAI, pp.8-082, 2008.

A. Raz, A. Shpilka, and . Yehudayoff, A lower bound for the size of syntactically multilinear arithmetic circuits, SIAM J. Comput, vol.38, issue.4, pp.10-1137, 2008.

. Segoufin, A glimpse on constant delay enumeration (invited talk), STACS, 2014.
DOI : 10.1145/2783888.2783894
URL : http://www.sigmod.org/publications/sigmod-record/1503/pdfs/05_principles_Segoufin.pdf

V. Strassen, Vermeidung von divisionen URL: https://eudml, Journal für die reine und angewandte Mathematik, p.151394, 1973.

W. James, J. B. Thatcher, and . Wright, Generalized finite automata theory with an application to a decision problem of second-order logic, Math. Systems Theory, vol.2, issue.1, 1968.

K. Wasa, Enumeration of enumeration algorithms

I. Wegener, Branching programs and binary decision diagrams, SIAM, 2000.
DOI : 10.1137/1.9780898719789