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

A. Amarilli, P. Bourhis, and P. Senellart, Provenance Circuits for Trees and Treelike Instances, Proc. 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.1145/2902251.2902301
URL : https://hal.archives-ouvertes.fr/hal-01336514

H. Andréka, I. Németi, and J. Van-benthem, Modal Languages and Bounded Fragments of Predicate Logic, Journal of Philosophical Logic, vol.60, issue.5, 1998.
DOI : 10.1023/A:1004275029985

S. Arnborg, D. G. Corneil, and A. Proskurowski, -Tree, SIAM Journal on Algebraic Discrete Methods, vol.8, issue.2, 1987.
DOI : 10.1137/0608024

P. B. Baeza, Querying graph databases, Proc. PODS, 2013.

M. Benedikt, P. Bourhis, M. Vanden, and . Boom, A Step Up in Expressiveness of Decidable Fixpoint Logics, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, 2016.
DOI : 10.1145/2933575.2933592
URL : https://hal.archives-ouvertes.fr/hal-01413890

M. Benedikt, B. Ten-cate, T. Colcombet, and M. V. Boom, The Complexity of Boundedness for Guarded Logics, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015.
DOI : 10.1109/LICS.2015.36

D. Berwanger and E. Grädel, Games and Model Checking for Guarded Logics, Proc. LPAR, 2001.
DOI : 10.1007/3-540-45653-8_5

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, vol.85, issue.1, 1990.
DOI : 10.1016/0890-5401(90)90043-H
URL : https://hal.archives-ouvertes.fr/hal-00353765

N. Dalvi and D. Suciu, Efficient query evaluation on probabilistic databases, VLDBJ, vol.16, issue.4, 2007.

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.141, issue.10, 2001.
DOI : 10.1145/136035.136043

G. Gottlob, R. Pichler, and F. Wei, Monadic Datalog over finite structures of bounded treewidth, TOCL, vol.12, issue.1, 2010.

E. Grädel and M. Otto, On logics with two variables, Theoretical Computer Science, vol.224, issue.1-2, 1999.
DOI : 10.1016/S0304-3975(98)00308-9

J. Huang, L. Antova, C. Koch, and D. Olteanu, MayBMS, Proceedings of the 35th SIGMOD international conference on Management of data, SIGMOD '09, 2009.
DOI : 10.1145/1559845.1559984

S. L. Lauritzen and D. J. Spiegelhalter, Local computations with probabilities on graphical structures and their application to expert systems, JRSS Ser. B, 1988.

S. Maniu, R. Cheng, and P. Senellart, ProbTree: A query-efficient representation of probabilistic graphs, Proc. BUDA, 2014.

M. Monet, Probabilistic Evaluation of Expressive Queries on Bounded-Treewidth Instances, Proceedings of the 2016 on SIGMOD'16 PhD Symposium, SIGMOD'16 PhD, 2016.
DOI : 10.1145/2926693.2929905

F. Wei, TEDI, Proceedings of the 2010 international conference on Management of data, SIGMOD '10, 2010.
DOI : 10.1145/1807167.1807181

M. Yannakakis, Algorithms for acyclic database schemes, Proc. VLDB, 1981.