{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:09Z","timestamp":1759639089465,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030214616"},{"type":"electronic","value":"9783030214623"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-21462-3_7","type":"book-chapter","created":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T19:05:15Z","timestamp":1560452715000},"page":"89-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dualization in Lattices Given by Implicational Bases"],"prefix":"10.1007","author":[{"given":"Oscar","family":"Defrain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lhouari","family":"Nourine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,23]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-20514-9_5","volume-title":"Formal Concept Analysis","author":"MA Babin","year":"2011","unstructured":"Babin, M.A., Kuznetsov, S.O.: Enumerating minimal hypotheses and dualizing monotone boolean functions on lattices. In: Valtchev, P., J\u00e4schke, R. (eds.) ICFCA 2011. LNCS (LNAI), vol. 6628, pp. 42\u201348. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20514-9_5"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.tcs.2016.01.005","volume":"658","author":"MA Babin","year":"2017","unstructured":"Babin, M.A., Kuznetsov, S.O.: Dualization in lattices given by ordered sets of irreducibles. Theor. Comput. Sci. 658, 316\u2013326 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1215\/S0012-7094-37-00334-X","volume":"3","author":"G Birkhoff","year":"1937","unstructured":"Birkhoff, G.: Rings of sets. Duke Math. J. 3(3), 443\u2013454 (1937)","journal-title":"Duke Math. J."},{"key":"7_CR4","volume-title":"Lattice Theory","author":"G Birkhoff","year":"1940","unstructured":"Birkhoff, G.: Lattice Theory, vol. 25. American Mathematical Society, New York (1940)"},{"issue":"1\u20133","key":"7_CR5","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0012-365X(93)90065-2","volume":"118","author":"KP Bogart","year":"1993","unstructured":"Bogart, K.P.: An obvious proof of Fishburn\u2019s interval order theorem. Discrete Mathe. 118(1\u20133), 239\u2013242 (1993)","journal-title":"Discrete Mathe."},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Creignou, N., Kr\u00f6ll, M., Pichler, R., Skritek, S., Vollmer, H.: A complexity theory for hard enumeration problems. Discrete Appl. Math. (2019). https:\/\/doi.org\/10.1016\/j.dam.2019.02.025","DOI":"10.1016\/j.dam.2019.02.025"},{"key":"7_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"BA Davey","year":"2002","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (2002)"},{"issue":"6","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24(6), 1278\u20131304 (1995)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1137\/S009753970240639X","volume":"32","author":"T Eiter","year":"2003","unstructured":"Eiter, T., Gottlob, G., Makino, K.: New results on monotone dualization and generating hypergraph transversals. SIAM J. Comput. 32(2), 514\u2013537 (2003)","journal-title":"SIAM J. Comput."},{"issue":"11","key":"7_CR10","doi-asserted-by":"publisher","first-page":"2035","DOI":"10.1016\/j.dam.2007.04.017","volume":"156","author":"T Eiter","year":"2008","unstructured":"Eiter, T., Makino, K., Gottlob, G.: Computational aspects of monotone dualization: a brief survey. Discrete Appl. Math. 156(11), 2035\u20132049 (2008)","journal-title":"Discrete Appl. Math."},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/3-540-45749-6_39","volume-title":"Algorithms \u2014 ESA 2002","author":"KM Elbassioni","year":"2002","unstructured":"Elbassioni, K.M.: An algorithm for dualization in products of lattices and its applications. In: M\u00f6hring, R., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 424\u2013435. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45749-6_39"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1137\/050622250","volume":"23","author":"KM Elbassioni","year":"2009","unstructured":"Elbassioni, K.M.: Algorithms for dualization over products of partially ordered sets. SIAM J. Discrete Math. 23(1), 487\u2013510 (2009)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0022-2496(70)90062-3","volume":"7","author":"PC Fishburn","year":"1970","unstructured":"Fishburn, P.C.: Intransitive indifference with unequal indifference intervals. J. Math. Psychol. 7(1), 144\u2013149 (1970)","journal-title":"J. Math. Psychol."},{"issue":"3","key":"7_CR14","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"ML Fredman","year":"1996","unstructured":"Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21(3), 618\u2013628 (1996)","journal-title":"J. Algorithms"},{"key":"7_CR15","volume-title":"Computers and Intractability","author":"MR Garey","year":"2002","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 29. W. H. Freeman, New York (2002)"},{"key":"7_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-0018-1","volume-title":"Lattice Theory: Foundation","author":"G Gr\u00e4tzer","year":"2011","unstructured":"Gr\u00e4tzer, G.: Lattice Theory: Foundation. Springer, Basel (2011). https:\/\/doi.org\/10.1007\/978-3-0348-0018-1"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Gunopulos, D., Mannila, H., Khardon, R., Toivonen, H.: Data mining, hypergraph transversals, and machine learning. In: PODS, pp. 209\u2013216. ACM (1997)","DOI":"10.1145\/263661.263684"},{"issue":"3","key":"7_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"3\u20134","key":"7_CR19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0020-0190(00)00023-5","volume":"74","author":"DJ Kavvadias","year":"2000","unstructured":"Kavvadias, D.J., Sideri, M., Stavropoulos, E.C.: Generating all maximal models of a boolean expression. Inf. Process. Lett. 74(3\u20134), 157\u2013162 (2000)","journal-title":"Inf. Process. Lett."},{"key":"7_CR20","unstructured":"Nourine, L., Petit, J.M.: Extending set-based dualization: application to pattern mining. In: Proceedings of the 20th European Conference on Artificial Intelligence, pp. 630\u2013635. IOS Press (2012)"},{"key":"7_CR21","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-319-38901-1_2","volume-title":"Information Search, Integration and Personalization","author":"L Nourine","year":"2016","unstructured":"Nourine, L., Petit, J.M.: Dualization on partially ordered sets: preliminary results. In: Kotzinos, D., Choong, Y.W., Spyratos, N., Tanaka, Y. (eds.) ISIP 2014. CCIS, vol. 497, pp. 23\u201334. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-38901-1_2"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.tcs.2016.03.018","volume":"658","author":"M Wild","year":"2017","unstructured":"Wild, M.: The joy of implications, aka pure horn formulas: mainly a survey. Theor. Comput. Sci. 658, 264\u2013292 (2017)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21462-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:56:38Z","timestamp":1710233798000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21462-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030214616","9783030214623"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21462-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICFCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Concept Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Frankfurt","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfca2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.informatik.fb2.frankfurt-university.de\/~icfca2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"plus 4 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}