R. Agrawal, T. Imielinski, and A. Swami, Mining association rules between sets of items in large databases, Proc. of ACM SIGMOD Conference on Management of Data, pp.207-216, 1993.

R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. Verkamo, Fast discovery of association rules Advances in Knowledge Discovery and Data Mining, pp.307-328, 1996.

H. Arimura and T. Uno, An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees, Proc. 15th Conference on Inductive Logic Programming, pp.1-19, 2005.
DOI : 10.1007/11536314_1

J. Balcázar and G. Garriga, Horn axiomatizations for sequential data, Theoretical Computer Science, vol.371, issue.3, pp.247-264, 2007.
DOI : 10.1016/j.tcs.2006.11.009

Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. Lakhal, Mining minimal nonredundant association rules using frequent closed itemsets, Lecture Notes in Computer Science, pp.1861-972, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00467751

R. Blair, H. Fang, W. Branham, B. Hass, S. Dial et al., The Estrogen Receptor Relative Binding Affinities of 188 Natural and Xenochemicals: Structural Diversity of Ligands, Toxicological Sciences, vol.54, issue.1, pp.138-153, 2000.
DOI : 10.1093/toxsci/54.1.138

E. Boros, V. Gurvich, L. Khachiyan, and K. Makino, On maximal frequent and minimal infrequent sets in binary matrices, Annals of Mathematics and Artificial Intelligence, vol.39, issue.3, pp.211-221, 2003.
DOI : 10.1023/A:1024605820527

W. Branham, S. Dial, C. Moland, B. Hass, R. Blair et al., Binding of Phytoestrogens and Mycoestrogens to the rat uterine estrogen receptor, J. Nutr, vol.132, pp.658-664, 2002.

B. Bringmann and S. Nijssen, What Is Frequent in a Single Graph?, Proceedings 12th Pacific-Asia Conference on Knowledge Discovery in Databases, pp.858-863, 2008.
DOI : 10.1007/978-3-540-68125-0_84

L. De-raedt, Logical and Relational Learning, 2008.
DOI : 10.1007/978-3-540-88190-2_1

L. De-raedt and L. Dehaspe, Clausal discovery, Mach. Learn, vol.26, 1997.

L. De-raedt and J. Ramon, Condensed representations for Inductive Logic Programming, Proc. of the 9th International Conference on Principles of Knowledge Representation and Reasoning, pp.438-446, 2004.

L. Dehaspe and H. Toivonen, Discovery of Relational Association Rules, Relational Data Mining, pp.189-208, 2000.
DOI : 10.1007/978-3-662-04599-2_8

M. Deshpande, M. Kuramochi, and G. Karypis, Frequent sub-structure-based approaches for classifying chemical compounds, Third IEEE International Conference on Data Mining, pp.35-42, 2003.
DOI : 10.1109/ICDM.2003.1250900

D. Mauro, N. Basile, T. Ferilli, S. Esposito, F. Fanizzi et al., An Exhaustive Matching Procedure for the Improvement of Learning Efficiency, Proceedings 13th International Conference on Inductive Logic Programming, pp.112-129, 2003.
DOI : 10.1007/978-3-540-39917-9_9

H. Fang, W. Tong, L. Shi, R. Blair, R. Perkins et al., Structure???Activity Relationships for a Large Diverse Set of Natural, Synthetic, and Environmental Estrogens, Chemical Research in Toxicology, vol.14, issue.3, pp.280-294, 2001.
DOI : 10.1021/tx000208y

M. Fiedler and C. Borgelt, Support computation for mining frequent subgraphs in a single graph, Proceedings of the Workshop on Mining and Learning with Graphs, 2007.

B. Ganter and R. Wille, Formal Concept Analysis. mathematical foundations, 1998.

G. Garriga, R. Khardon, and L. De-raedt, On mining closed sets in multi-relational data, Proceedings of the 20th International Joint Conference on Artificial Intelligence, 2007.

B. Goethals and M. Zaki, Advances in frequent itemset mining implementations, ACM SIGKDD Explorations Newsletter, vol.6, issue.1, pp.109-117, 2004.
DOI : 10.1145/1007730.1007744

D. Gunopulos, R. Khardon, H. Mannila, S. Saluja, H. Toivonen et al., Discovering all most specific sentences, ACM Transactions on Database Systems, vol.28, issue.2, p.28, 2003.
DOI : 10.1145/777943.777945

J. Han, J. Pei, and Y. Yin, Mining frequent patterns without candidate generation, Proc. of the ACM SIGMOD International Conference on Management of Data, pp.1-12, 2000.

T. Horváth, Z. Alexin, T. Gyimóthy, and S. Wrobel, Application of Different Learning Methods to Hungarian Part-of-Speech Tagging, Proceedings 9th International Workshop on Inductive Logic Programming, pp.128-139, 1999.
DOI : 10.1007/3-540-48751-4_13

T. Horváth and G. Turán, Learning logic programs with structured background knowledge??????An extended abstract of this paper appeared in: L.??De Raedt (Ed.), Proceedings of the Fifth International Workshop on Inductive Logic Programming, Tokyo, Japan, 1995, pp. 53???76, Scientific Report of the Department of Computer Science, Katholieke Universiteit Leuven, and also in the post-conference volume: L.??De Raedt (Ed.), Advances in Inductive Logic Programming, IOS Press, Amsterdam/Ohmsha, Tokyo, 1996, pp. 172???191., Artificial Intelligence, vol.128, issue.1-2, pp.31-97, 2001.
DOI : 10.1016/S0004-3702(01)00062-5

S. Kramer and L. De-raedt, Feature construction with version spaces for biochemical applications, Proceedings of the 18th International Conference on Machine Learning, pp.258-265, 2001.

M. Kuramochi and G. Karypis, Finding frequent patterns in a large sparse graph, Proceedings of the Fourth SIAM International Conference on Data Mining. SIAM, 2004.

S. Kuznetsov, Learning of Simple Conceptual Graphs from Positive and Negative Examples, Proceedings of the 3rd European Conference on Principles and Practive of Knowledge Discovery in Databases, pp.384-391, 1999.
DOI : 10.1007/978-3-540-48247-5_47

S. Kuznetsov, Machine Learning and Formal Concept Analysis, Proceedings of the 2nd International Conference on Formal Concept Analysis, pp.287-312, 2004.
DOI : 10.1007/978-3-540-24651-0_25

S. Kuznetsov and M. Samokhin, Learning Closed Sets of Labeled Graphs for Chemical Applications, Proceedings of the 15th International Conference on Inductive Logic Programming, pp.190-208, 2005.
DOI : 10.1007/11536314_12

J. Lloyd, Foundations of logic programming, 1987.

D. Malerba and F. Lisi, Discovering Associations between Spatial Objects: An ILP Application, 11th International Conference on ILP, pp.156-163, 2001.
DOI : 10.1007/3-540-44797-0_13

J. Maloberti and E. Suzuki, Improving Efficiency of Frequent Query Discovery by Eliminating Non-relevant Candidates, Discovery Science, pp.220-232, 2003.
DOI : 10.1007/978-3-540-39644-4_19

H. Mannila and H. Toivonen, Levelwise search and borders of theories in knowledgediscovery, Data Mining and Knowledge Discovery, vol.1, issue.3, pp.241-258, 1997.
DOI : 10.1023/A:1009796218281

A. Mccallum, K. Nigam, J. Rennie, and K. Seymore, A machine learning approach to building domain-specific search engines, Proc. of the 16th International Joint Conference on Artificial Intelligence, 1999.

S. Muggleton and L. De-raedt, Inductive Logic Programming: Theory and methods, The Journal of Logic Programming, vol.19, issue.20, pp.629-679, 1994.
DOI : 10.1016/0743-1066(94)90035-3

S. Nienhuys-cheng and R. De-wolf, Foundations of inductive logic programming. No. 1228 in Lecture Notes in Artificial Intelligence, 1997.

S. Nijssen and J. Kok, Efficient Frequent Query Discovery in Farmer, Proc. of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, pp.350-362, 2003.
DOI : 10.1007/978-3-540-39804-2_32

J. Pei, J. Han, and R. Mao, CLOSET: An efficient algorithm for mining frequent closed itemsets, Proc. of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp.21-30, 2000.

G. D. Plotkin, A note on inductive generalization, Machine intelligence 5, pp.153-163, 1970.

L. Schietgat, F. Costa, J. Ramon, and L. De-raedt, Effective feature construction by maximum common subgraph sampling, Machine Learning, pp.137-161, 2011.
DOI : 10.1007/s10994-010-5193-8

T. Uno, T. Asai, Y. Uchida, and H. Arimura, An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases, Proceedings of the 7th International Conference on Discovery Science, pp.16-31, 2004.
DOI : 10.1007/978-3-540-30214-8_2

X. Yan and J. Han, gSpan: Graph-based substructure pattern mining, Proceedings of the 2nd IEEE International Conference on Data Mining, pp.721-724, 2002.

X. Yan and J. Han, CloseGraph, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.286-295, 2003.
DOI : 10.1145/956750.956784

M. Zaki, Mining Non-Redundant Association Rules, Data Mining and Knowledge Discovery, vol.9, issue.3, pp.223-248, 2004.
DOI : 10.1023/B:DAMI.0000040429.96086.c7

M. Zaki and C. Hsiao, CHARM: An Efficient Algorithm for Closed Itemset Mining, Proc. of the 2nd. SIAM International Conference on Data Mining, 2002.
DOI : 10.1137/1.9781611972726.27