S. Abiteboul, R. Hull, and V. Vianu, Fondements des bases de données, 2000.

R. Agrawal, T. Imielinski, and A. Swami, Mining associations between sets of items in massive databases, ACM SIGMOD 1993, pp.207-216, 1993.

H. Arimura and T. Uno, Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems, In SDM, pp.1087-1098, 2009.
DOI : 10.1137/1.9781611972795.93

M. Boley, T. Horváth, A. Poigné, and S. Wrobel, Listing closed sets of strongly accessible set systems with applications to data mining, Theoretical Computer Science, vol.411, issue.3, pp.691-700, 2010.
DOI : 10.1016/j.tcs.2009.10.024

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

A. Brian, H. A. Davey, and . Priestley, Introduction to Lattices and Order, 1990.

L. Dehaspe and H. Toivonen, Discovery of frequent datalog patterns, Data Mining and Knowledge Discovery, vol.3, issue.1, pp.7-36, 1999.
DOI : 10.1023/A:1009863704807

F. De, M. , and J. Petit, Zigzag: a new algorithm for mining large inclusion dependencies in databases, ICDM'03, pp.27-34, 2003.

T. Eiter and G. Gottlob, Identifying the Minimal Transversals of a Hypergraph and Related Problems, SIAM Journal on Computing, vol.24, issue.6, pp.1278-1304, 1995.
DOI : 10.1137/S0097539793250299

T. Eiter, G. Gottlob, and K. Makino, New Results on Monotone Dualization and Generating Hypergraph Transversals, SIAM Journal on Computing, vol.32, issue.2, pp.514-537, 2003.
DOI : 10.1137/S009753970240639X

URL : http://arxiv.org/abs/cs/0204009

M. Khaled and . Elbassioni, Algorithms for dualization over products of partially ordered sets, SIAM J. Discrete Math, vol.23, issue.1, pp.487-510, 2009.

L. Michael, L. Fredman, and . Khachiyan, On the complexity of dualization of monotone disjunctive normal forms, J. Algorithms, vol.21, issue.3, pp.618-628, 1996.

B. Goethals and J. Van-den-bussche, Relational Association Rules: Getting Warmer, Pattern Detection and Discovery, pp.125-139, 2002.
DOI : 10.1007/3-540-45728-3_10

URL : http://arxiv.org/abs/cs/0206023

B. Goethals, W. L. Page, and H. Mannila, Mining Association Rules of Simple Conjunctive Queries, SDM, pp.96-107, 2008.
DOI : 10.1137/1.9781611972788.9

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, pp.140-174, 2003.
DOI : 10.1145/777943.777945

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.1494

D. Gunopulos, R. Khardon, H. Mannila, and H. Toivonen, Data mining, hypergraph transversals, and machine learning, Proceedings of the 16 th ACM Symposium on Principles of Database Systems, pp.209-216, 1997.
DOI : 10.1145/263661.263684

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.1843

D. Tao-yuan-jen, N. Laurent, and . Spyratos, Mining all frequent projection-selection queries from a relational table, EDBT, pp.368-379, 2008.

V. Mamadou-moustapha-kanté, A. Limouzy, L. Mary, and . Nourine, On the Enumeration of Minimal Dominating Sets and Related Notions, SIAM Journal on Discrete Mathematics, vol.28, issue.4, pp.1916-1929, 2014.
DOI : 10.1137/120862612

M. Moustapha, K. , and L. Nourine, Minimal dominating set enumeration, Encyclopedia of Algorithms, 2015.

H. Mannila and K. Räihä, Algorithms for inferring functional dependencies from relations, Data & Knowledge Engineering, vol.12, issue.1, pp.83-99, 1994.
DOI : 10.1016/0169-023X(94)90023-X

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

B. Negrevergne, A. Termier, M. Rousset, and J. Méhaut, Para Miner: a generic pattern mining algorithm for multi-core architectures, Data Mining and Knowledge Discovery, vol.1, issue.1, 2013.
DOI : 10.1007/s10618-013-0313-2

L. Nourine and J. Petit, Extending Set-Based Dualization: Application to Pattern Mining, ECAI 2012, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01353000

L. Nourine and J. Petit, Dualization on Partially Ordered Sets: Preliminary Results, Post-Proceedings of the ISIP 2014 Workshop, 2014.
DOI : 10.1007/978-3-319-38901-1_2

URL : https://hal.archives-ouvertes.fr/hal-01229022

L. Nourine and J. Petit, Beyond Hypergraph Dualization, Encyclopedia of Algorithms, 2015.
DOI : 10.1007/978-3-642-27848-8_719-1

URL : https://hal.archives-ouvertes.fr/hal-01229015

M. Wild, Cover-preserving order embeddings into Boolean lattices, Order, vol.3, issue.3, pp.209-232, 1992.
DOI : 10.1007/BF00383945