{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:37:08Z","timestamp":1743057428780,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030778668"},{"type":"electronic","value":"9783030778675"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-77867-5_18","type":"book-chapter","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T23:27:55Z","timestamp":1624318075000},"page":"270-280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Filters, Ideals and Congruences on Double Boolean Algebras"],"prefix":"10.1007","author":[{"given":"Tenkeu Jeufack Yannick","family":"L\u00e9a","sequence":"first","affiliation":[]},{"given":"Etienne Romuald Alomo","family":"Temgoua","sequence":"additional","affiliation":[]},{"given":"L\u00e9onard","family":"Kwuida","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,22]]},"reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.jal.2012.04.003","volume":"10","author":"P Balbiani","year":"2012","unstructured":"Balbiani, P.: Deciding the word problem in pure double Boolean algebras. J. Appl. Logic 10(3), 260\u2013273 (2012)","journal-title":"J. Appl. Logic"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Breckner, B.E., Sacarea, C.: A Topological representation of double Boolean lattices. Stud. Univ. Babes-Bolyai Math. 64(1), 11\u201323 (2019)","DOI":"10.24193\/subbmath.2019.1.02"},{"key":"18_CR3","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8130-3","volume-title":"A Course in Universal Algebra","author":"S Burris","year":"1981","unstructured":"Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra. Graduate Texts in Mathematics. Springer, New York (1981)"},{"key":"18_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":"18_CR5","unstructured":"Howlader, P., Banerjee, M.: Remarks on prime ideal and representation theorem for double Boolean algebras. In: The 15th International Conference on Concept Lattices and Their Applications (CLA 2020), pp. 83\u201394. Tallinn (2020)"},{"key":"18_CR6","unstructured":"Howlader, P., Banerjee, M.: Topological Representation of Double Boolean Algebras. ArXiv:2103.11387. (March 2021)"},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"263","DOI":"10.7151\/dmgaa.1130","volume":"27","author":"L Kwuida","year":"2005","unstructured":"Kwuida, L.: Prime ideal theorem for double Boolean algebras. Discus. Math. Gen. Algebra Appl. 27(2), 263\u2013275 (2005)","journal-title":"Discus. Math. Gen. Algebra Appl."},{"key":"18_CR8","unstructured":"Kwuida, L.: Dicomplemented lattices. A contextual generalization of Boolean algebras. Dissertation, TU Dresden, Shaker Verlag (2004)"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Vormbrock, B., Wille, R.: Semiconcept and protoconcept algebras: the basic theorem. In Ganter, B., Stumme, G., Wille, R. (eds.) Formal Concept Analysis: Foundations and Applications. pp. 34\u201348. Springer, Berlin Heidelberg (2005)","DOI":"10.1007\/11528784_2"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Wille, R.: Boolean concept logic. In Ganter, B, Mineau, G.W. (eds.) Conceptual Structures: Logical Linguistic, and Computational Issue. pp. 317\u2013331. Springer, Berlin Heidelberg (2000)","DOI":"10.1007\/10722280_22"}],"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-77867-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T23:31:05Z","timestamp":1624318265000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77867-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030778668","9783030778675"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77867-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 June 2021","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":"Strasbourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icfca2021.sciencesconf.org\/","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.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","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":"14","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":"44% - 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":"1,6","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)"}}]}}