{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:20:11Z","timestamp":1775053211905,"version":"3.50.1"},"publisher-location":"Berlin\/Heidelberg","reference-count":30,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540582746","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0019423","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T06:16:42Z","timestamp":1132640202000},"page":"1-12","source":"Crossref","is-referenced-by-count":10,"title":["Bit-vector encoding for partially ordered sets"],"prefix":"10.1007","author":[{"given":"Michel","family":"Habib","sequence":"first","affiliation":[]},{"given":"Lhouari","family":"Nourine","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Rakesh Agrawal, Alex Borgida, and H.V. Jagadish. Efficient management of transitive relationships in large data bases, including is-a hierarchies. ACM SIGMOD, 1989.","DOI":"10.1145\/67544.66950"},{"issue":"1","key":"1_CR2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/59287.59293","volume":"11","author":"H. A\u00eft-Kaci","year":"1989","unstructured":"Hassan A\u00eft-Kaci, Robert Boyer, Patrick Lincoln, and Roger Nasr. Efficient implementation of lattice operations. ACM Transactions on Programming Langages and Systems, 11(1):115\u2013146, January 1989.","journal-title":"ACM Transactions on Programming Langages and Systems"},{"issue":"25","key":"1_CR3","first-page":"149","volume":"C","author":"G. Behrendt","year":"1988","unstructured":"G. Behrendt. Maximal antichains in partially ordered sets. Ars Combin., C(25):149\u2013157, 1988.","journal-title":"Ars Combin."},{"key":"1_CR4","volume-title":"volume 25 of Coll. Publ. XXV","author":"G. Birkhoff","year":"1967","unstructured":"G. Birkhoff. Lattice Theory, volume 25 of Coll. Publ. XXV. American Mathematical Society, Providence, 3rd edition, 1967.","edition":"3rd edition"},{"key":"1_CR5","first-page":"31","volume":"96","author":"J.P. Bordat","year":"1986","unstructured":"J.P. Bordat. Calcul pratique du treillis de gallois d'une correspondance. In Math. Sci. Hum, 96, pages 31\u201347, 1986.","journal-title":"Math. Sci. Hum"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"A. Bouchet. Codages et dimensions de relations binaires. Annals of Discrete Mathematics 23, Ordres: Description and Roles, (M. Pouzet, D. Richard eds), 1984.","DOI":"10.1016\/S0304-0208(08)73833-7"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Yves Caseau. Efficient handling of multiple inheritance hierarchies. In OOPSLA '93, pages 271\u2013287, 1993.","DOI":"10.1145\/165854.165905"},{"key":"1_CR8","volume-title":"PhD thesis","author":"B. Charron-Bost","year":"1989","unstructured":"B. Charron-Bost. Mesures de la Concurrence et du Parall\u00e9lisme des Calculs R\u00e9partis. PhD thesis, Universit\u00e9 Paris VII, Paris, France, Septembre 1989."},{"key":"1_CR9","unstructured":"B. A. Davey and H. A. Priestley. Introduction to lattices and orders. Cambridge University Press, second edition, 1991."},{"key":"1_CR10","series-title":"Lecture Notes in Artificial Intelligence 699","volume-title":"Conceptual Graphs for knowledge representation","author":"G. Ellis","year":"1993","unstructured":"G. Ellis. Efficient retrieval from hierarchies of objects using lattice operations. In Conceptual Graphs for knowledge representation, (Proc. International conference on Conceptual Structures, Quebec City, Canada, August 4\u20137, 1993), G. W. Mineau, B. Moulin and J. Sowa, Eds, Lecture Notes in Artificial Intelligence 699, Springer, Berlin, 1993."},{"key":"1_CR11","volume-title":"Lecture Notes in Artificial Intelligence","author":"G. Ellis","year":"1994","unstructured":"G. Ellis and F. Lehmann. Exploiting the induced order on type-labeled graphs for fast knowledge retrieval. In Proc. of the 2nd International conference on Conceptual Structures, August 16\u201320, 1994), College Park, Maryland, Lecture Notes in Artificial Intelligence, Springer-Verlag, Berlin, 1994."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"G. Gambosi, J. Nesetril, and M. Talamo. Efficient representation of taxonomies. In TAP-SOFT, CAAP Conf. Pisa, pages 232\u2013240, 1987.","DOI":"10.1007\/3-540-17660-8_58"},{"key":"1_CR13","volume-title":"Lecture Notes in Computer Science 267","author":"G. Gambosi","year":"1987","unstructured":"G. Gambosi, J. Nesetril, and M. Talamo. Posets, boolean representations and quick path searching. In Proc. of the 14th International colloque on Automata, Languages and Programming, Lecture Notes in Computer Science 267, Springer-Verlag, Berlin, 1987."},{"issue":"70","key":"1_CR14","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(90)90125-2","volume":"3","author":"G. Gambosi","year":"1990","unstructured":"G. Gambosi, J. Nesetril, and M. Talamo. On locally presented posets. Theoretical Comp. Sci., 3(70):251\u2013260, 1990.","journal-title":"Theoretical Comp. Sci."},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"R. Godin and H. Mili. Building and maintening analysis-level class hierarchies using galois lattices. In OOPSLA '93, pages 394\u2013410, 1993.","DOI":"10.1145\/165854.165931"},{"key":"1_CR16","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/0097-3165(84)90085-2","volume":"A","author":"J.R. Griggs","year":"1984","unstructured":"J.R. Griggs, J. Stahl, and W.T. Trotter. A sperner theorem on unrelated chains of subsets. J. Comb. theory. (A), pages 124\u2013127, 1984.","journal-title":"J. Comb. theory."},{"issue":"313","key":"1_CR17","first-page":"893","volume":"I","author":"M. Habib","year":"1991","unstructured":"M. Habib, M. Morvan, M. Pouzet, and J.-X. Rampon. Extensions intervallaires minimales. C. R. Acad. Sci. Paris, I(313):893\u2013898, 1991.","journal-title":"C. R. Acad. Sci. Paris"},{"key":"1_CR18","volume-title":"Research Report 92-012","author":"M. Habib","year":"1993","unstructured":"M. Habib and L. Nourine. A linear time algorithm to recognize distributive lattices. Research Report 92-012, submitted to Order, LIRMM, Montpellier, France, March 1993."},{"key":"1_CR19","volume-title":"Research report","author":"M. Habib","year":"1994","unstructured":"M. Habib and L. Nourine. Tree structure for distributive lattices and its applications. Research report, LIRMM, Montpellier, France, Avril 1994."},{"key":"1_CR20","volume-title":"Thechnical report","author":"C. Jard","year":"1994","unstructured":"C. Jard, G.-V. Jourdan, and J.-X. Rampon. Computing on-line the lattice of maximal antichains of posets. Thechnical report, IRISA, Rennes, France, February 1994."},{"key":"1_CR21","unstructured":"G. Markowsky. Some combinatorial aspects of lattice theory. In Houston Lattice Theory Conf., editor, Proc. Univ. of Houston, pages 36\u201368, 1973."},{"key":"1_CR22","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1090\/S0002-9947-1975-0360386-3","volume":"203","author":"G. Markowsky","year":"1975","unstructured":"G. Markowsky. The factorization and representation of lattices. Trans. of Amer. Math. Soc., 203:185\u2013200, 1975.","journal-title":"Trans. of Amer. Math. Soc."},{"key":"1_CR23","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF00383950","volume":"9","author":"G. Markowsky","year":"1992","unstructured":"G. Markowsky. Primes, irreducibles and extremal lattices. Order, 9:265\u2013290, 1992.","journal-title":"Order"},{"key":"1_CR24","first-page":"215","volume-title":"Parallel and Distributed Algorithms","author":"F. Mattern","year":"1989","unstructured":"F. Mattern. Virtual time and global states of distributed systems. In M. Cosnard and al., editors, Parallel and Distributed Algorithms, pages 215\u2013226. Elsevier \/ North-Holland, 1989."},{"key":"1_CR25","first-page":"129","volume":"I","author":"M. Morvan","year":"1993","unstructured":"M. Morvan and L. Nourine. Sur la distributivit\u00e9 du treillis des anticha\u00eenes maximales d'un ensemble ordonn\u00e9. C.R. Acad. Sci., t. 317-S\u00e9rie I:129\u2013133, 1993.","journal-title":"C.R. Acad. Sci., t. 317-S\u00e9rie"},{"key":"1_CR26","volume-title":"PhD thesis","author":"L. Nourine","year":"1993","unstructured":"L. Nourine. Quelques propri\u00e9t\u00e9s algorithmiques des treillis. PhD thesis, Universit\u00e9 Montpellier II, Montpellier, France, June 1993."},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"K. Reuter. The jump number and the lattice of maximal antichains. Discrete Mathematics, 1991.","DOI":"10.1016\/0012-365X(91)90016-U"},{"key":"1_CR28","unstructured":"J. Stahl and R. Wille. Preconcepts of contexts. in Proc. Universal Algebra (Sienna), 1984."},{"key":"1_CR29","doi-asserted-by":"crossref","DOI":"10.56021\/9780801844256","volume-title":"Combinatorics and Partially Ordered Sets: Dimension Theory","author":"W.T. Trotter","year":"1992","unstructured":"W.T. Trotter. Combinatorics and Partially Ordered Sets: Dimension Theory. Press, Baltimore. John Hopkins University, 1992."},{"key":"1_CR30","series-title":"NATO ASI","volume-title":"Ordered sets","author":"R. Wille","year":"1982","unstructured":"R. Wille. Restructuring lattice theory. in Ordered sets, I. Rival, Eds. NATO ASI No 83, Reidel, Dordecht, Holland, 1982."}],"container-title":["Lecture Notes in Computer Science","Orders, Algorithms, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0019423","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T14:35:00Z","timestamp":1683297300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019423"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540582746"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/bfb0019423","relation":{},"subject":[]}}