{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:45:41Z","timestamp":1762458341466,"version":"3.44.0"},"reference-count":74,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3796,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0166-218x(02)00209-3","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"241-269","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":112,"title":["The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey"],"prefix":"10.1016","volume":"127","author":[{"given":"Nathalie","family":"Caspard","sequence":"first","affiliation":[]},{"given":"Bernard","family":"Monjardet","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00209-3_BIB1","first-page":"385","article-title":"Characterization of finite lattices of sublattices","volume":"30","author":"Adaricheva","year":"1991","journal-title":"Algebra i logica"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB2","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF01233912","article-title":"Two embedding theorems for lower bounded lattices","volume":"36","author":"Adaricheva","year":"1996","journal-title":"Algebra Universalis."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB3","first-page":"129","article-title":"The number of families of subsets closed with respect to intersection","volume":"1","author":"Alexseev","year":"1989","journal-title":"Diskrete Math."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB4","first-page":"580","article-title":"Dependency structures of data base relationships","volume":"74","author":"Armstrong","year":"1974","journal-title":"Inform. Process."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB5","doi-asserted-by":"crossref","unstructured":"M. Barbut, Note sur l'alg\u00e8bre des techniques d'analyse hi\u00e9rarchique, in: B. Matalon (Ed.), L'analyse hi\u00e9rarchique, Gauthier-Villars, Paris, 1965.","DOI":"10.1515\/9783111540924-010"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB6","unstructured":"M. Barbut and B. Monjardet, Ordre et Classification, Alg\u00e8bre et Combinatoire, tomes I and II, Hachette, Paris, 1970."},{"year":"1967","series-title":"Lattice Theory","author":"Birkhoff","key":"10.1016\/S0166-218X(02)00209-3_BIB7"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB8","doi-asserted-by":"crossref","unstructured":"G.H. Bordalo, B. Monjardet, The lattice of strict completions of a finite lattice, Algebra Universalis 47 (2002) \u2013200.","DOI":"10.1007\/s00012-002-8183-2"},{"year":"1989","series-title":"Finite Automata, their Algebras and Grammars. Towards a Theory of Formal Expressions","author":"Buchi","key":"10.1016\/S0166-218X(02)00209-3_BIB9"},{"issue":"3","key":"10.1016\/S0166-218X(02)00209-3_BIB10","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0022-2496(91)90052-U","article-title":"Organization by rules in finite sequences","volume":"35","author":"Burigana","year":"1991","journal-title":"J. Math. Psych."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB11","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF00337692","article-title":"The poset of closures as a model of changing databases","volume":"4","author":"Burosch","year":"1987","journal-title":"Order"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB12","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0304-3975(91)90359-A","article-title":"On the number of databases and closure operations","volume":"78","author":"Burosch","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB13","unstructured":"G. Burosch, J. Demetrovics, G.O.H. Katona, D.J. Kleitman, A. Sapozhenko, On the number of closure operators, in the book Combinatorics, Paul Erd\u00f6s is Eighty, Vol. 1, J\u00e0nos Bolyai Mathematical Society, Budapest, 1993 pp. 91\u201395."},{"issue":"3","key":"10.1016\/S0166-218X(02)00209-3_BIB14","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1006444906980","article-title":"A characterization theorem for the canonical basis of a closure operator","volume":"16","author":"Caspard","year":"1999","journal-title":"Order"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB15","doi-asserted-by":"crossref","DOI":"10.1016\/S1571-0653(04)00013-7","article-title":"The lattice of Moore families and closure operators on a finite set","volume":"2","author":"Caspard","year":"1999","journal-title":"Electronic Notes in Discrete Mathematics"},{"year":"1990","series-title":"Introduction to Lattices and Order","author":"Davey","key":"10.1016\/S0166-218X(02)00209-3_BIB16"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB17","doi-asserted-by":"crossref","first-page":"69","DOI":"10.4153\/CJM-1979-008-x","article-title":"Characterizations of finite lattices that are bounded-homomorphic images or sublattices of free lattices","volume":"31","author":"Day","year":"1979","journal-title":"Canad. J. Math."},{"issue":"4","key":"10.1016\/S0166-218X(02)00209-3_BIB18","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1142\/S0218196792000256","article-title":"The lattice theory of functional dependencies and normal decompositions","volume":"2","author":"Day","year":"1992","journal-title":"Internat. J. Algebra Comput."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB19","series-title":"Extremal Problems for Finite Sets","first-page":"199","article-title":"Databases, closure operations and Sperner families","author":"Demetrovics","year":"1991"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB20","doi-asserted-by":"crossref","unstructured":"J. Demetrovics, L.O. Libkin, I.B. Muchnik, Functional dependencies and the semilattice of closed classes, Proceedings of MFDBS 89, Lecture Notes in Computer Science, Vol. 364, Springer, Berlin, 1989, pp. 136\u2013147.","DOI":"10.1007\/3-540-51251-9_10"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB21","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(92)90028-9","article-title":"Functional dependencies in relational databases","volume":"40","author":"Demetrovics","year":"1992","journal-title":"Discrete Appl. Math."},{"year":"1995","series-title":"Categorical Structure of Closure Operators: with Applications to Topology, Algebra and Discrete Mathematics","author":"Dikranjan","key":"10.1016\/S0166-218X(02)00209-3_BIB22"},{"year":"1999","series-title":"Knowledge Spaces","author":"Doignon","key":"10.1016\/S0166-218X(02)00209-3_BIB23"},{"issue":"3","key":"10.1016\/S0166-218X(02)00209-3_BIB24","first-page":"311","article-title":"How to build a knowledge space by querying an expert","volume":"34","author":"Doignon","year":"1989","journal-title":"J. Math. Psych."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB25","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1006\/jmps.2000.1316","article-title":"A note on the correspondence among entail relations, rough set dependencies and logical consequence","volume":"45","author":"Duntsch","year":"2001","journal-title":"J. Math. Psych."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB26","series-title":"Beitraege zur Begriffsanalyse","first-page":"213","article-title":"Contextual implications between attributes and some representation properties for finite lattices","author":"Duquenne","year":"1987"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB27","unstructured":"V. Duquenne, The lattice of all 1-meet-subsemilattices of a finite lattice, 1987 (unpublished notes)."},{"issue":"2\u20133","key":"10.1016\/S0166-218X(02)00209-3_BIB28","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0012-365X(91)90005-M","article-title":"The core of finite lattice","volume":"88","author":"Duquenne","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB29","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S0304-3975(98)00279-5","article-title":"Latticial structure in data analysis","volume":"217","author":"Duquenne","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB30","first-page":"56","article-title":"A general dependence relation for lattices","volume":"7","author":"Finkbeiner","year":"1951","journal-title":"Proc. Amer. Math. Soc. 2"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB31","article-title":"Free lattices","volume":"Vol. 42","author":"Freese","year":"1991"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB32","series-title":"Beitraege zur Begriffsanalyse","first-page":"241","article-title":"Two basic algorithms in concept analysis, report 831 TH Darsmastadt, FB Mathematik 1984; published as Algorithmen zur formalen Begriffsanalyse","author":"Ganter","year":"1987"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB33","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0304-3975(98)00271-0","article-title":"Attribute exploration with background knowledge","volume":"217","author":"Ganter","year":"1999","journal-title":"Theoret. Comput. Sci."},{"year":"1999","series-title":"Formal Concept Analysis, Mathematical Foundations","author":"Ganter","key":"10.1016\/S0166-218X(02)00209-3_BIB34"},{"year":"1978","series-title":"General Lattice Theory","author":"Gr\u00e4tzer","key":"10.1016\/S0166-218X(02)00209-3_BIB35"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB36","first-page":"5","article-title":"Familles minimales d'implications informatives r\u00e9sultant d'une table de donn\u00e9es binaires","volume":"95","author":"Guigues","year":"1986","journal-title":"Math. Sci. Humaines"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB37","unstructured":"M. Habib, L. Nourine, Algorithms for Moore families generation, preprint, 2000."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB38","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01190438","article-title":"The lattice of closure relations on a poset","volume":"30","author":"Hawrylycz","year":"1993","journal-title":"Algebra Universalis"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB39","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0012-365X(97)00099-X","article-title":"Lattices of closure operators","volume":"179","author":"Higuchi","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB40","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/S1385-7258(51)50045-8","article-title":"On closure operation in lattice theory","volume":"13","author":"Iseki","year":"1951","journal-title":"Nederl. Akad. Wetensch. Proc. Ser. A 54; Indag. Math."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB41","first-page":"535","article-title":"Copoints in antimatro\u0131\u0308ds","volume":"29","author":"Jamison","year":"1980","journal-title":"Congr. Numer."},{"issue":"1","key":"10.1016\/S0166-218X(02)00209-3_BIB42","doi-asserted-by":"crossref","first-page":"115","DOI":"10.2140\/pjm.1981.96.115","article-title":"Partition numbers for trees and ordered sets","volume":"96","author":"Jamison-Waldner","year":"1981","journal-title":"Pacific J. Math."},{"issue":"1","key":"10.1016\/S0166-218X(02)00209-3_BIB43","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0165-4896(98)00044-4","article-title":"Choice functions and abstract convex geometries","volume":"38","author":"Koshevoy","year":"1999","journal-title":"Math. Social Sci."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB44","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01190769","article-title":"direct subdecomposition of atomistic algebraic lattices","volume":"33","author":"Libkin","year":"1995","journal-title":"Algebra Universalis"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB45","first-page":"101","article-title":"On a subsemilattice-lattice of a semilattice","volume":"39","author":"Libkin","year":"1988","journal-title":"MTA SZTAKI K\u00f6lem\u00e9nyek"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB46","first-page":"83","article-title":"Separatory subsemilattices and their properties","volume":"39","author":"Libkin","year":"1988","journal-title":"MTA SZTAKI K\u00f6lem\u00e9nyek"},{"year":"1983","series-title":"The Theory of Relational Data Bases","author":"Maier","key":"10.1016\/S0166-218X(02)00209-3_BIB47"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB48","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0165-4896(93)00742-D","article-title":"Path independence in serial-parallel data processing","volume":"27","author":"Malishevski","year":"1994","journal-title":"Math. Social Sci."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB49","series-title":"Ordinal and Symbolic Data Analysis, Studies in Classification, Data Analysis and Knowledge Organization","first-page":"319","article-title":"Structural characterization of the path independence property for set transformations","author":"Malishevski","year":"1996"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB50","unstructured":"G. Markowsky, Some combinatorial aspects of lattice theory, Proceedings of Houston Lattice Theory Conference, University of Houston, Houston, 1973, pp. 36\u201368."},{"year":"1996","series-title":"Closure Spaces and Logic","author":"Martin","key":"10.1016\/S0166-218X(02)00209-3_BIB51"},{"issue":"1","key":"10.1016\/S0166-218X(02)00209-3_BIB52","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0165-4896(90)90077-K","article-title":"Arrowian characterizations of latticial federation consensus functions","volume":"20","author":"Monjardet","year":"1990","journal-title":"Math. Social Sci."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB53","series-title":"The Dilworth Theorems Selected papers of Robert P. Dilworth","first-page":"192","article-title":"The consequences of Dilworth's work on lattices with unique irreducible decompositions","author":"Monjardet","year":"1990"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB54","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1016\/S0012-365X(96)00196-3","article-title":"On a dependance relation in finite lattices","volume":"165\/166","author":"Monjardet","year":"1997","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/S0166-218X(02)00209-3_BIB55","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0165-4896(00)00061-5","article-title":"The duality between the semi-lattices of anti-exchange closure operators and path-independent choice operators","volume":"41","author":"Monjardet","year":"2001","journal-title":"Math. Social Sci."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB56","first-page":"158","article-title":"Caract\u00e9risation de l'op\u00e9ration de fermeture par un seul axiome","volume":"4","author":"Monteiro","year":"1943","journal-title":"Portugal. Math."},{"issue":"3","key":"10.1016\/S0166-218X(02)00209-3_BIB57","first-page":"155","article-title":"A characterization of closure operators by means of one axiom","volume":"21","author":"Morgado","year":"1962","journal-title":"Portugal. Math."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB58","first-page":"11","article-title":"Note on the distributive closure operators of a complete lattice","volume":"23","author":"Morgado","year":"1964","journal-title":"Portugal. Math."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB59","series-title":"Mathematical Psychology in Progress","article-title":"A procedure for facilitating an expert's judgements on a set of rules","author":"M\u00fcller","year":"1989"},{"issue":"1","key":"10.1016\/S0166-218X(02)00209-3_BIB60","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1005805026315","article-title":"The lattice of completions of an ordered set","volume":"14","author":"Nation","year":"1997","journal-title":"Order"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB61","series-title":"Theory of Matroids","article-title":"Axiom systems","author":"Nicoletti","year":"1988"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB62","doi-asserted-by":"crossref","first-page":"514","DOI":"10.2307\/1968978","article-title":"Combinations of closure relations","volume":"44","author":"\u00d6re","year":"1943","journal-title":"Ann. Math."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB63","unstructured":"V. Raderanirina, Treillis de familles de Moore et de fonctions de choix. Applications aux probl\u00e8mes de consensus, Th\u00e8se Universit\u00e9 Paris 1, 2001."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB64","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/BF02573581","article-title":"On finite lattices which are embeddable in subsemigroups lattices","volume":"46","author":"Repnitskii","year":"1993","journal-title":"Semigroup Forum"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB65","series-title":"Data Analysis and Information Systems","article-title":"Knowledge spaces and formal concept analysis","author":"Rusch","year":"1996"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB66","unstructured":"V. Soltan, Abstract convexity, Shtiintsa, Kishinev, 1984 (in Russian)."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB67","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF02945028","article-title":"Supersolvable Lattices","volume":"2","author":"Stanley","year":"1972","journal-title":"Algebra Universalis"},{"year":"1999","series-title":"Semimodular Lattices","author":"Stern","key":"10.1016\/S0166-218X(02)00209-3_BIB68"},{"year":"1963","series-title":"Introduction to Lattice Theory","author":"Sz\u00e0sz","key":"10.1016\/S0166-218X(02)00209-3_BIB69"},{"year":"1993","series-title":"Theory of Convex Structures","author":"Van den Vel","key":"10.1016\/S0166-218X(02)00209-3_BIB70"},{"issue":"1","key":"10.1016\/S0166-218X(02)00209-3_BIB71","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1006\/aima.1994.1069","article-title":"A theory of finite closure spaces based on implications","volume":"108","author":"Wild","year":"1994","journal-title":"Adv. Math."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB72","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BFb0030825","article-title":"Computations with finite closure systems and implications","volume":"959","author":"Wild","year":"1995","journal-title":"Lecture Notes in Comput. Sci."},{"key":"10.1016\/S0166-218X(02)00209-3_BIB73","doi-asserted-by":"crossref","first-page":"156","DOI":"10.4064\/fm-26-1-156-166","article-title":"On the combination of topologies","volume":"26","author":"Birkhoff","year":"1936","journal-title":"Fundamenta Mathematicae"},{"key":"10.1016\/S0166-218X(02)00209-3_BIB74","first-page":"56","article-title":"Les ensembles fem\u00e9s et les fondements de la topologie","volume":"2","author":"Monteiro","year":"1941","journal-title":"Portugal. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002093?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002093?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T11:57:07Z","timestamp":1759060627000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02002093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":74,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0166218X02002093"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00209-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2003,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0166-218X(02)00209-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}