{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:08:35Z","timestamp":1742980115388,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"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_6","type":"book-chapter","created":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T19:05:15Z","timestamp":1560452715000},"page":"73-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reduction and Introducers in d-contexts"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Bazin","sequence":"first","affiliation":[]},{"given":"Giacomo","family":"Kahn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,23]]},"reference":[{"key":"6_CR1","unstructured":"Rudolph, S., Sacarea, C., Troanca, D.: Reduction in triadic data sets. In: Proceedings of the 4th International Workshop \u201cWhat Can FCA do for Artificial Intelligence?\u201d FCA4AI 2015, Co-located with the International Joint Conference on Artificial Intelligence (IJCAI 2015), Buenos Aires, Argentina, 25 July 2015, pp. 55\u201362 (2015)"},{"key":"6_CR2","volume-title":"Lattice Theory","author":"G Birkhoff","year":"1940","unstructured":"Birkhoff, G.: Lattice Theory, vol. 25. American Mathematical Society, New York (1940)"},{"key":"6_CR3","unstructured":"Barbut, M., Monjardet, B.: Ordre et classification. Algebre et Combinatoire, Volumes 1 and 2 (1970)"},{"key":"6_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis - Mathematical Foundations","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis - Mathematical Foundations. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-59830-2"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/3-540-60161-9_27","volume-title":"Conceptual Structures: Applications, Implementation and Theory","author":"F Lehmann","year":"1995","unstructured":"Lehmann, F., Wille, R.: A triadic approach to formal concept analysis. In: Ellis, G., Levinson, R., Rich, W., Sowa, J.F. (eds.) ICCS-ConceptStruct 1995. LNCS, vol. 954, pp. 32\u201343. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60161-9_27"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF01108624","volume":"12","author":"R Wille","year":"1995","unstructured":"Wille, R.: The basic theorem of triadic concept analysis. Order 12(2), 149\u2013158 (1995)","journal-title":"Order"},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1021252203599","volume":"19","author":"G Voutsadakis","year":"2002","unstructured":"Voutsadakis, G.: Polyadic concept analysis. Order 19(3), 295\u2013304 (2002)","journal-title":"Order"},{"key":"6_CR8","volume-title":"Foundations of Measurement","author":"DH Krantz","year":"1971","unstructured":"Krantz, D.H., Suppes, P., Luce, R.D.: Foundations of Measurement. Academic Press, New York (1971)"},{"key":"6_CR9","unstructured":"Wille, U.: Geometric representation of ordinal contexts. Ph.D. thesis, University Gie\u00dfen (1995)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Godin, R., Mili, H.: Building and maintaining analysis-level class hierarchies using Galois lattices. In: 8th Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA), pp. 394\u2013410 (1993)","DOI":"10.1145\/167962.165931"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BFb0054916","volume-title":"Conceptual Structures: Theory, Tools and Applications","author":"K Biedermann","year":"1998","unstructured":"Biedermann, K.: Powerset trilattices. In: Mugnier, M.-L., Chein, M. (eds.) ICCS-ConceptStruct 1998. LNCS, vol. 1453, pp. 209\u2013221. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054916"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s11083-007-9055-3","volume":"24","author":"G Voutsadakis","year":"2007","unstructured":"Voutsadakis, G.: Dedekind-Macneille completion of n-ordered sets. Order 24(1), 15\u201329 (2007)","journal-title":"Order"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:56:27Z","timestamp":1710233787000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21462-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030214616","9783030214623"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21462-3_6","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)"}}]}}