O. Bangsø, Object Oriented Bayesian Networks, 2004.

O. Bangsø, N. Sønderberg-madsen, and F. Jensen, A bn framework for the construction of virtual agents with human-like behaviour, Proc. of PGM'06, 2006.

O. Bangsø and P. H. Wuillemin, Top-down construction and repetitive structures representation in Bayesian networks, Proc. of FLAIRS'00, pp.282-286, 2000.

R. Dechter, Bucket elimination: A unifying framework for reasoning, Artificial Intelligence, vol.113, issue.1-2, pp.41-85, 1999.
DOI : 10.1016/S0004-3702(99)00059-4

N. Friedman, L. Getoor, D. Koller, and A. Pfeffer, Learning probabilistic relational models, Proc. of IJCAI'99, 1999.

M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

L. Getoor, N. Friedman, D. Koller, A. Pfeffer, and B. Taskar, Probabilistic relational models, An Introduction to Statistical Relational Learning, 2007.

L. Getoor, D. Koller, B. Taskar, and N. Friedman, Learning probabilistic relational models with structural uncertainty, ICML-2000 Workshop on Attribute-Value and Relational Learning: Crossing the Boundaries, 2000.

M. Halldórsson, Approximations of weighted independent set and hereditary subset problems, Journal of Graph Algorithms and Applications, 2000.

D. Heckerman, C. Meek, and D. Koller, Probabilistic models for relational data, Tech. rep, 2004.

J. S. Ide, F. G. Cozman, and F. T. Ramos, Generating random Bayesian networks with constraints on induced width, Proc. of ECAI'04, pp.323-327, 2004.

A. Inokuchi, T. Washio, and H. Motoda, A general framework for mining frequent subgraphs from labeled graphs, Fundamenta Informaticae, 2005.

K. Kersting and L. D. Raedt, Bayesian logic programs, 2001.

D. Koller and A. Pfeffer, Object-oriented Bayesian networks, Proc. of AAAI'97, pp.302-313, 1997.

M. Kuramochi and G. Karypis, Frequent subgraph discovery, Proceedings 2001 IEEE International Conference on Data Mining, 2001.
DOI : 10.1109/ICDM.2001.989534
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.7488

A. Madsen and F. Jensen, Lazy propagation: A junction tree inference algorithm based on lazy evaluation, Artificial Intelligence, vol.113, issue.1-2, pp.203-245, 1999.
DOI : 10.1016/S0004-3702(99)00062-4

S. Mahoney and K. Laskey, Network engineering for complex belief networks, Proc. of UAI'96, 1996.

J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, 1988.

A. Pfeffer, D. Koller, B. Milch, and K. Takusagawa, SPOOK: A system for probabilistic object-oriented knowledge representation, Proc. of UAI'99, 1999.

A. Pfeffer, Probabilistic Reasoning for Complex Systems, 2000.

D. Rose, G. Lueker, and R. Tarjan, Algorithmic Aspects of Vertex Elimination on Graphs, SIAM Journal on Computing, vol.5, issue.2, pp.266-283, 1976.
DOI : 10.1137/0205021

D. Rose, Triangulated graphs and the elimination process, Journal of Mathematical Analysis and Applications, vol.32, issue.3, 1970.
DOI : 10.1016/0022-247X(70)90282-9

L. Torti and P. H. Wuillemin, Structured value elimination with d-separation analysis, Proc. of FLAIRS'10, pp.122-127, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00627846

L. Torti, P. H. Wuillemin, and C. Gonzales, Reinforcing the object-oriented aspect of probabilistic relational models, Proc. of PGM, p.10, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00627823

X. Yan and J. Han, gSpan: Graph-based substructure pattern mining, Proc. of ICDM'02, 2002.