?. If, F ) is meet-irreducible then ? x (F ) is its unique cover. This implies that every ? x -closed set that contains ? x (F ), contains also ? x (F )

. To-sum-up, F ) is the only cover of ? x (F ) in F x \ ? ? * (x) and ? x (F ) is a subset of ? x (? x (F ) ? ? * (x)). We conclude that ? x (F ) is the only cover of ? x (F ) in F x

F. Fc and =. , Figure 7.4.2 depicts the correspondence between meet irreducible sets of F c and F cd . Then, table in figure 7.4.3 distinguishes closed sets in M 6 using the property 6. In this case M 6 = {{c}}. Then, we use property 7 to verify that ? d ({c}) is meet-irreducible in F cd : since ?({c} ? {d}) = {a, b, c, d} is equal to ?({b, c} ? {d}) = {a, b, c, d} where {b, c} is {c}'s cover that

M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, Bibliography, 1964.

K. V. Adaricheva and J. B. Nation, Largest extension of a finite convex geometry. algebra universalis, pp.185-195, 2004.
DOI : 10.1007/s00012-004-1844-6

URL : http://www.math.hawaii.edu/~jb/LE0514.ps

K. V. Adaricheva, V. A. Gorbunov, and V. I. Tumanov, Join-semidistributive lattices and convex geometries, Advances in Mathematics, vol.173, issue.1, pp.1-49, 2003.
DOI : 10.1016/S0001-8708(02)00011-7

URL : https://doi.org/10.1016/s0001-8708(02)00011-7

L. Akroun, B. Benatallah, L. Nourine, and F. Toumani, Decidability and Complexity of Simulation Preorder for Data-Centric Web Services, International Conference on Service-Oriented Computing, pp.535-542, 2014.
DOI : 10.1007/978-3-662-45391-9_46

URL : https://hal.archives-ouvertes.fr/tel-01155513

F. Guvery-stavo-alonso, H. Casati, V. Kuno, and . Machiraju, Web Services: Concepts, Architectures and Applications, 2010.

B. Benatallah, F. Casati, and F. Toumani, Web service conversation modeling: a cornerstone for e-business automation, IEEE Internet Computing, vol.8, issue.1, pp.46-54, 2004.
DOI : 10.1109/MIC.2004.1260703

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

D. Berardi, D. Calvanese, G. D. Giacomo, R. Hull, and M. Mecella, Automatic composition of transition-based semantic web services with messaging, Very Large Data Bases Conference VLDB, pp.613-624, 2005.

D. Berardi, D. Calvanese, G. D. Giacomo, R. Hull, and M. Mecella, Automatic composition of web services in colombo, Italian Symposium on Advanced Database Systems SEBD, pp.8-15, 2005.

D. Berardi, D. Calvanese, G. D. Giacomo, M. Lenzerini, and M. Mecella, Automatic Composition of E-services That Export Their Behavior, International Conference on Service-Oriented Computing, pp.43-58, 2003.
DOI : 10.1007/978-3-540-24593-3_4

URL : http://www.inf.unibz.it/%7Ecalvanese/papers/bera-etal-ICSOC-2003.pdf

G. Birkhoff, Lattice theory, 1948.
DOI : 10.1090/coll/025

J. Bordat, Calcul pratique du treillis de galois d'une correspondance, Mathématiques et Sciences humaines, vol.96, pp.31-47, 1986.

T. Brázdil, P. Jan?ar, and A. Ku?era, Reachability Games on Extended Vector Addition Systems with States, Automata, Languages and Programming, pp.478-489, 2010.
DOI : 10.1007/978-3-642-14162-1_40

A. Brogi and S. Corfini, Behaviour-Aware Discovery of Web Service Compositions, International Journal of Web Services Research, vol.4, issue.3, 2007.
DOI : 10.4018/jwsr.2007070101

URL : http://compass2.di.unipi.it/TR/Files/TR-06-08.pdf.gz

V. Bryant and R. Webster, Convexity spaces. I. The basic properties, Journal of Mathematical Analysis and Applications, vol.37, issue.1, pp.206-213, 1972.
DOI : 10.1016/0022-247X(72)90268-5

T. Bultan, X. Fu, R. Hull, and J. Su, Conversation specification, Proceedings of the twelfth international conference on World Wide Web , WWW '03, 2003.
DOI : 10.1145/775152.775210

J. Chaloupka, Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P, Reachability Problems, pp.104-119, 2010.
DOI : 10.1007/978-3-642-15349-5_7

S. Christensen, Decidability and decomposition in process algebras, 1993.

J. Courtois and S. Schmitz, Alternating Vector Addition Systems with States, Mathematical Foundations of Computer Science 2014, pp.220-231, 2014.
DOI : 10.1007/978-3-662-44522-8_19

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

B. A. Davey and H. A. Priestley, Introduction to lattices and order, 1991.
DOI : 10.1017/CBO9780511809088

J. Doignon and J. Falmagne, Spaces for the assessment of knowledge, International Journal of Man-Machine Studies, vol.23, issue.2, pp.175-196, 1985.
DOI : 10.1016/S0020-7373(85)80031-6

K. Ennaoui and L. Nourine, Hybrid algorithms for candidate keys enumeration for a relational schema, Conférence sur la Gestion de Données -Principes, Technologies et Applications BDA, 2016.

K. Ennaoui, L. Nourine, and F. Toumani, Complexity aspects of web services composition, International Workshop on Petri Nets and Software Engineering, pp.85-104, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01179719

B. Ganter, Two Basic Algorithms in Concept Analysis, 1984.
DOI : 10.1007/978-3-642-11928-6_22

B. Ganter and H. Reppe, Base Points, Non-unit Implications, and Convex Geometries, International Conference on Formal Concept Analysis, pp.210-220, 2007.
DOI : 10.1007/978-3-540-70901-5_14

W. Geyer, The generalized doubling construction and formal concept analysis, Algebra Universalis, vol.17, issue.3, pp.341-367, 1994.
DOI : 10.1007/978-94-009-7798-3_15

M. Habib and L. Nourine, A representation theorem for lattice via set-colored posets, p.2012
DOI : 10.1016/j.dam.2018.03.068

L. Ramy-ragab-hassen, F. Nourine, and . Toumani, Protocol-Based Web Service Composition, International Conference on Service-Oriented Computing, pp.38-53, 2008.
DOI : 10.2307/2370405

M. Rauch-henzinger, A. Thomas, . Henzinger, W. Peter, and . Kopke, Computing simulations on finite and infinite graphs, Proceedings of IEEE 36th Annual Foundations of Computer Science, pp.453-462, 1995.
DOI : 10.1109/SFCS.1995.492576

W. Hodges, Tarski's truth definitions, 2014.

D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou, On generating all maximal independent sets, Information Processing Letters, vol.27, issue.3, pp.119-123, 1988.
DOI : 10.1016/0020-0190(88)90065-8

J. Kennedy and . Kurt-gödel, The Stanford Encyclopedia of Philosophy, 2016.

H. Kreger, Web services conceptual architecture (wsca 1.0). IBM Software Group, pp.6-7, 2001.

K. Kritikos, B. Pernici, P. Plebani, C. Cappiello, M. Comuzzi et al., A survey on service quality description, ACM Computing Surveys, vol.46, issue.1, p.1, 2013.
DOI : 10.1145/2522968.2522969

URL : http://www.infosys.tuwien.ac.at/staff/ivona/papers/kritikos.pdf

S. Lasota, EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system, Information Processing Letters, vol.109, issue.15, pp.850-855, 2009.
DOI : 10.1016/j.ipl.2009.04.003

URL : http://www.mimuw.edu.pl/~sl/PAPERS/ipl09.pdf

S. Lopes, J. Petit, and L. Lakhal, Functional and approximate dependency mining: database and FCA points of view, Journal of Experimental & Theoretical Artificial Intelligence, vol.29, issue.2-3, pp.93-114, 2002.
DOI : 10.1145/347090.347101

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

L. Cláudio, S. L. Lucchesi, and . Osborn, Candidate keys for relations, Journal of Computer and System Sciences, vol.17, issue.2, pp.270-279, 1978.

A. Muscholl and I. Walukiewicz, A lower bound on web services composition, Logical Methods in Computer Science, vol.4, issue.2, 2008.
DOI : 10.2168/lmcs-4(2:5)2008

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

L. Nourine and O. Raynaud, A fast algorithm for building lattices, Information Processing Letters, vol.71, issue.5-6, pp.199-204, 1999.
DOI : 10.1016/S0020-0190(99)00108-8

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

. Ramy-ragab-hassen, Automatic composition of prototocol-based Web services, 2009.

H. Saiedian and T. Spencer, An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema, The Computer Journal, vol.39, issue.2, pp.124-132, 1996.
DOI : 10.1093/comjnl/39.2.124

Z. Quan, X. Sheng, A. V. Qiao, C. Vasilakos, S. Szabo et al., Web services composition: A decade's overview, Information Sciences, vol.280, pp.218-238, 2014.

B. Srivastava and J. Koehler, Web service composition-current solutions and open problems, ICAPS 2003 workshop on Planning for Web Services, pp.28-35, 2003.

N. Veyrat-charvillon, B. Gérard, M. Renauld, and F. Standaert, An Optimal Key Enumeration Algorithm and Its Application to Side-Channel Attacks, International Conference on Selected Areas in Cryptography, pp.390-406, 2012.
DOI : 10.1007/978-3-642-35999-6_25

URL : https://eprint.iacr.org/2011/610.pdf

M. Wild, The joy of implications, aka pure Horn formulas: Mainly a survey, Theoretical Computer Science, vol.658, pp.264-292, 2017.
DOI : 10.1016/j.tcs.2016.03.018

URL : http://arxiv.org/pdf/1411.6432

R. Wille, Subdirect decomposition of concept lattices. algebra universalis, pp.275-287, 1983.
DOI : 10.1007/bf01194537

H. Yoshikawa, H. Hirai, and K. Makino, A representation of antimatroids by Horn rules and its application to educational systems, Journal of Mathematical Psychology, vol.77, 2016.
DOI : 10.1016/j.jmp.2016.09.002

URL : http://arxiv.org/pdf/1508.05465