{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T10:11:47Z","timestamp":1781086307214,"version":"3.54.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030214616","type":"print"},{"value":"9783030214623","type":"electronic"}],"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_17","type":"book-chapter","created":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T19:04:14Z","timestamp":1560452654000},"page":"259-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Formal Context for Closures of Acyclic Hypergraphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2896-2247","authenticated-orcid":false,"given":"Jaume","family":"Baixeries","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,5,23]]},"reference":[{"key":"17_CR1","volume-title":"Foundations of Databases","author":"S Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)"},{"key":"17_CR2","unstructured":"Baixeries, J.: A formal concept analysis framework to model functional dependencies. In: Mathematical Methods for Learning (2004)"},{"key":"17_CR3","unstructured":"Baixeries, J.: Lattice characterization of Armstrong and symmetric dependencies (Ph.D. thesis). Universitat Polit\u00e8cnica de Catalunya (2007)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-78137-0_7","volume-title":"Formal Concept Analysis","author":"J Baixeries","year":"2008","unstructured":"Baixeries, J.: A formal context for symmetric dependencies. In: Medina, R., Obiedkov, S. (eds.) ICFCA 2008. LNCS (LNAI), vol. 4933, pp. 90\u2013105. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78137-0_7"},{"key":"17_CR5","unstructured":"Baixeries, J.: A new formal context for symmetric dependencies (2011)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-319-60438-1_55","volume-title":"Foundations of Intelligent Systems","author":"J Baixeries","year":"2017","unstructured":"Baixeries, J.: A formal context for acyclic join dependencies. In: Kryszkiewicz, M., Appice, A., \u015al\u0119zak, D., Rybinski, H., Skowron, A., Ra\u015b, Z.W. (eds.) ISMIS 2017. LNCS (LNAI), vol. 10352, pp. 563\u2013572. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-60438-1_55"},{"key":"17_CR7","unstructured":"Baixeries, J., Balc\u00e1zar, J.L.: Discrete deterministic data mining as knowledge compilation. In: Proceedings of Workshop on Discrete Mathematics and Data Mining - SIAM (2003)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-32262-7_11","volume-title":"Formal Concept Analysis","author":"J Baixeries","year":"2005","unstructured":"Baixeries, J., Balc\u00e1zar, J.L.: Characterization and Armstrong relations for degenerate multivalued dependencies using formal concept analysis. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol. 3403, pp. 162\u2013175. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-32262-7_11"},{"key":"17_CR9","unstructured":"Baixeries, J., Balc\u00e1zar, J.L.: A lattice representation of relations, multivalued dependencies and Armstrong relations. In: ICCS, pp. 13\u201326 (2005)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Baixeries, J., Codocedo, V., Kaytoue, M., Napoli, A.: Characterizing approximate-matching dependencies in formal concept analysis with pattern structures. Discrete Appl. Math. 249, 18\u201327 (2018). Concept Lattices and Applications: Recent Advances and New Opportunities","DOI":"10.1016\/j.dam.2018.03.073"},{"key":"17_CR11","unstructured":"Baixeries, J., Kaytoue, M., Napoli, A.: Computing functional dependencies with pattern structures. In: Szathmary, L., Priss, U. (eds.) CLA, volume 972 of CEUR Workshop Proceedings, pp. 175\u2013186. CEUR-WS.org (2012)"},{"key":"17_CR12","unstructured":"Baixeries, J., Kaytoue, M., Napoli, A.: Computing similarity dependencies with pattern structures. In: Ojeda-Aciego, M., Outrata, J. (eds.) CLA, volume 1062 of CEUR Workshop Proceedings, pp. 33\u201344. CEUR-WS.org (2013)"},{"issue":"1\u20132","key":"17_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10472-014-9400-3","volume":"72","author":"J Baixeries","year":"2014","unstructured":"Baixeries, J., Kaytoue, M., Napoli, A.: Characterizing functional dependencies in formal concept analysis with pattern structures. Ann. Math. Artif. Intell. 72(1\u20132), 129\u2013149 (2014)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. J. ACM 30(3), 479\u2013513 (1983)","journal-title":"J. ACM"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(85)90212-9","volume":"38","author":"C Beeri","year":"1985","unstructured":"Beeri, C., Vardi, M.Y.: Formal systems for join dependencies. Theor. Comput. Sci. 38, 99\u2013116 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1007\/11733836_45","volume-title":"Database Systems for Advanced Applications","author":"R B\u011blohl\u00e1vek","year":"2006","unstructured":"B\u011blohl\u00e1vek, R., Vychodil, V.: Data tables with similarity relations: functional dependencies, complete rules and non-redundant bases. In: Li Lee, M., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 644\u2013658. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11733836_45"},{"key":"17_CR17","unstructured":"Berge, C.: Hypergraphs: Combinatorics of Finite Sets, volume 45 of North-Holland Mathematical Library. North-Holland, Amsterdam (1989)"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Bohannon, P., Fan, W., Geerts, F., Jia, X., Kementsietsidis, A.: Conditional functional dependencies for data cleaning. In: ICDE, pp. 746\u2013755 (2007)","DOI":"10.1109\/ICDE.2007.367920"},{"key":"17_CR19","first-page":"03","volume":"49","author":"J Brault-Baron","year":"2014","unstructured":"Brault-Baron, J.: Hypergraph acyclicity revisited. ACM Comput. Surv. 49, 03 (2014)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"17_CR20","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0166-218X(02)00209-3","volume":"127","author":"N Caspard","year":"2003","unstructured":"Caspard, N., Monjardet, B.: The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey. Discrete Appl. Math. 127(2), 241\u2013269 (2003)","journal-title":"Discrete Appl. Math."},{"key":"17_CR21","unstructured":"Codd, E.F.: Further normalization of the data base relational model. IBM Research Report, San Jose, California, RJ909 (1971)"},{"issue":"04","key":"17_CR22","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1142\/S0218196792000256","volume":"02","author":"A Day","year":"1992","unstructured":"Day, A.: The lattice theory of functionnal dependencies and normal decompositions. Int. J. Algebr. Comput. 02(04), 409\u2013431 (1992)","journal-title":"Int. J. Algebr. Comput."},{"key":"17_CR23","unstructured":"Day, A.: A lattice interpretation of database dependencies. In: Semantics of Programming Languages and Model Theory, pp. 305\u2013325. Gordon and Breach Science Publishers Inc, Newark (1993)"},{"issue":"3","key":"17_CR24","first-page":"141","volume":"10","author":"J Demetrovics","year":"1992","unstructured":"Demetrovics, J., Hencsey, G., Libkin, L., Muchnik, I.B.: Normal form relation schemes: a new characterization. Acta Cybern. 10(3), 141\u2013153 (1992)","journal-title":"Acta Cybern."},{"issue":"2","key":"17_CR25","first-page":"143","volume":"11","author":"J Demetrovics","year":"1992","unstructured":"Demetrovics, J., Huy, N.: Representation of closure for functional, multivalued and join dependencies. Comput. Artif. Intell. 11(2), 143\u2013154 (1992)","journal-title":"Comput. Artif. Intell."},{"issue":"2","key":"17_CR26","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0166-218X(92)90028-9","volume":"40","author":"J Demetrovics","year":"1992","unstructured":"Demetrovics, J., Libkin, L., Muchnik, I.B.: Functional dependencies in relational databases: a lattice point of view. Discrete Appl. Math. 40(2), 155\u2013185 (1992)","journal-title":"Discrete Appl. Math."},{"key":"17_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Berlin (1999). https:\/\/doi.org\/10.1007\/978-3-642-59830-2"},{"issue":"1","key":"17_CR28","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/5236.5237","volume":"11","author":"M Gyssens","year":"1986","unstructured":"Gyssens, M.: On the complexity of join dependencies. ACM Trans. Database Syst. 11(1), 81\u2013108 (1986)","journal-title":"ACM Trans. Database Syst."},{"issue":"10","key":"17_CR29","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1023\/A:1012435612567","volume":"62","author":"SO Kuznetsov","year":"2001","unstructured":"Kuznetsov, S.O.: Machine learning on the basis of formal concept analysis. Autom. Remote Control 62(10), 1543\u20131564 (2001)","journal-title":"Autom. Remote Control"},{"issue":"2\u20133","key":"17_CR30","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1080\/09528130210164143","volume":"14","author":"S Lopes","year":"2002","unstructured":"Lopes, S., Petit, J.-M., Lakhal, L.: Functional and approximate dependency mining: database and fca points of view. J. Exp. Theor. Artif. Intell. 14(2\u20133), 93\u2013114 (2002)","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"17_CR31","volume-title":"The Theory of Relational Databases","author":"D Maier","year":"1983","unstructured":"Maier, D.: The Theory of Relational Databases. Computer Science Press, Rockville (1983)"},{"issue":"3","key":"17_CR32","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0020-0190(98)00148-3","volume":"68","author":"F Malvestuto","year":"1998","unstructured":"Malvestuto, F.: A complete axiomatization of full acyclic join dependencies. Inf. Process. Lett. 68(3), 133\u2013139 (1998)","journal-title":"Inf. Process. Lett."},{"key":"17_CR33","volume-title":"Principles of Database Systems and Knowledge-Based Systems","author":"J Ullman","year":"1989","unstructured":"Ullman, J.: Principles of Database Systems and Knowledge-Based Systems, vol. 1\u20132. Computer Science Press, Rockville (1989)"}],"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_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:57:40Z","timestamp":1710233860000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21462-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030214616","9783030214623"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21462-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}