{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:27:26Z","timestamp":1760171246784,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T00:00:00Z","timestamp":1658880000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T00:00:00Z","timestamp":1658880000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001412","name":"Council of Scientific and Industrial Research, India","doi-asserted-by":"publisher","award":["09\/092(0950)\/2016-EMR-I"],"award-info":[{"award-number":["09\/092(0950)\/2016-EMR-I"]}],"id":[{"id":"10.13039\/501100001412","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J of Log Lang and Inf"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10849-022-09370-1","type":"journal-article","created":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T19:11:51Z","timestamp":1658949111000},"page":"117-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Kripke Contexts, Double Boolean Algebras with Operators and Corresponding Modal Systems"],"prefix":"10.1007","volume":"32","author":[{"given":"Prosenjit","family":"Howlader","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7517-0923","authenticated-orcid":false,"given":"Mohua","family":"Banerjee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,27]]},"reference":[{"issue":"3","key":"9370_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. (2012). Deciding the word problem in pure double Boolean algebras. Journal of Applied Logic, 10(3), 260\u2013273.","journal-title":"Journal of Applied Logic"},{"key":"9370_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal logic","author":"P Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., & Venema, Y. (2001). Modal logic. Cambridge: Cambridge University Press."},{"issue":"1","key":"9370_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.24193\/subbmath.2019.1.02","volume":"64","author":"BE Breckner","year":"2019","unstructured":"Breckner, B. E., & S\u0103c\u0103rea, C. (2019). A topological representation of double Boolean lattices. Studia Universitatis Babe\u015f-Bolyai Mathematica, 64(1), 11\u201323.","journal-title":"Studia Universitatis Babe\u015f-Bolyai Mathematica"},{"key":"9370_CR4","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. (1981). A Course in Universal Algebra. New York, Berlin: Springer."},{"key":"9370_CR5","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. (2002). Introduction to lattices and order. New York: Cambridge University Press."},{"key":"9370_CR6","doi-asserted-by":"crossref","unstructured":"D\u00fcntsch, I., & Gediga, G. (2002). Modal-style operators in qualitative data analysis. In Vipin, K., et al. (Eds.), Proceedings of the 2002 IEEE international conference on data mining, (pp. 155\u2013162). IEEE Computer Society.","DOI":"10.1109\/ICDM.2002.1183898"},{"key":"9370_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-21563-6_3","volume-title":"Transactions on rough sets XIV","author":"B Ganter","year":"2011","unstructured":"Ganter, B., & Meschke, C., et al. (2011). A formal concept analysis approach to rough data tables. In J. F. Peters (Ed.), Transactions on rough sets XIV (pp. 37\u201361). Berlin: Springer."},{"key":"9370_CR8","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. (1999). Formal concept analysis: Mathematical foundations. Berlin: Springer."},{"key":"9370_CR9","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-319-99368-3_34","volume-title":"International Joint conference on rough sets","author":"P Howlader","year":"2018","unstructured":"Howlader, P., & Banerjee, M., et al. (2018). Algebras from semiconcepts in rough set theory. In H. S. Nguyen (Ed.), International Joint conference on rough sets (pp. 440\u2013454). Cham: Springer."},{"key":"9370_CR10","doi-asserted-by":"crossref","unstructured":"Howlader, P., & Banerjee, M., et al. (2020a). Object oriented protoconcepts and logics for double and pure double Boolean algebras. In R. Bello (Ed.), International joint conference on rough sets (pp. 308\u2013323). Cham: Springer.","DOI":"10.1007\/978-3-030-52705-1_23"},{"key":"9370_CR11","unstructured":"Howlader, P., & Banerjee, M., et al. (2020b). Remarks on prime ideal and representation theorems for double Boolean algebras. In F. J. Valverde-Albacete (Ed.), CLA 2020. CEUR workshop proceedings (pp. 83\u201394)."},{"key":"9370_CR12","first-page":"167","volume-title":"Advances in knowledge discovery and data mining","author":"K Hu","year":"2001","unstructured":"Hu, K., Sui, Y., Lu, Y., Wang, J., & Shi, C., et al. (2001). Concept approximation in concept lattice. In D. Cheung (Ed.), Advances in knowledge discovery and data mining (pp. 167\u2013173). Berlin: Springer."},{"issue":"4","key":"9370_CR13","doi-asserted-by":"publisher","first-page":"891","DOI":"10.2307\/2372123","volume":"73","author":"B Jonsson","year":"1951","unstructured":"Jonsson, B., & Tarski, A. (1951). Boolean algebras with operators. Part I. American Journal of Mathematics, 73(4), 891\u2013939.","journal-title":"American Journal of Mathematics"},{"key":"9370_CR14","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-1-4471-3238-7_30","volume-title":"Rough sets, fuzzy sets and knowledge discovery","author":"RE Kent","year":"1994","unstructured":"Kent, R. E. (1994). Rough concept analysis. In W. P. Ziarko (Ed.), Rough sets, fuzzy sets and knowledge discovery (pp. 248\u2013255). London: Springer."},{"key":"9370_CR15","doi-asserted-by":"publisher","first-page":"169","DOI":"10.3233\/FI-1996-272305","volume":"27","author":"RE Kent","year":"1996","unstructured":"Kent, R. E. (1996). Rough concept analysis: A synthesis of rough sets and formal concept analysis. Fundamenta Informaticae, 27, 169\u2013181.","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"9370_CR16","doi-asserted-by":"publisher","first-page":"263","DOI":"10.7151\/dmgaa.1130","volume":"27","author":"L Kwuida","year":"2007","unstructured":"Kwuida, L. (2007). Prime ideal theorem for double Boolean algebras. Discussiones Mathematicae-General Algebra and Applications, 27(2), 263\u2013275.","journal-title":"Discussiones Mathematicae-General Algebra and Applications"},{"key":"9370_CR17","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-76307-6_21","volume-title":"Classification, data analysis, and knowledge organization","author":"P Luksch","year":"1991","unstructured":"Luksch, P., & Wille, R., et al. (1991). A mathematical model for conceptual knowledge systems. In H. H. Bock (Ed.), Classification, data analysis, and knowledge organization (pp. 156\u2013162). Berlin: Springer."},{"key":"9370_CR18","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-11928-6_8","volume-title":"Formal concept analysis","author":"C Meschke","year":"2010","unstructured":"Meschke, C., et al. (2010). Approximations in concept lattices. In L. Kwuida (Ed.), Formal concept analysis (pp. 104\u2013123). Berlin: Springer."},{"issue":"5","key":"9370_CR19","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak, Z. (1982). Rough sets. International Journal of Computer and Information Sciences, 11(5), 341\u2013356.","journal-title":"International Journal of Computer and Information Sciences"},{"key":"9370_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3534-4","volume-title":"Rough sets: Theoretical Aspects of reasoning about data","author":"Z Pawlak","year":"1991","unstructured":"Pawlak, Z. (1991). Rough sets: Theoretical Aspects of reasoning about data. Dordrecht: Kluwer Academic Publishers."},{"key":"9370_CR21","unstructured":"Rasiowa, H. (1974). An algebraic approach to non-classical logics. Amsterdam, London: North-Holland Publishing Co.\/New York: American Elsevier Publishing Co., Inc.."},{"issue":"3","key":"9370_CR22","first-page":"655","volume":"11","author":"J Saquer","year":"2001","unstructured":"Saquer, J., & Deogun, J. S. (2001). Concept approximations based on rough sets and similarity measures. International Journal of Applied Mathematics and Computer Science, 11(3), 655\u2013674.","journal-title":"International Journal of Applied Mathematics and Computer Science"},{"key":"9370_CR23","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-540-70901-5_16","volume-title":"Formal concept analysis","author":"B Vormbrock","year":"2007","unstructured":"Vormbrock, B., et al. (2007). A solution of the word problem for free double Boolean algebras. In S. O. Kuznetsov (Ed.), Formal concept analysis (pp. 240\u2013270). Berlin: Springer."},{"key":"9370_CR24","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/11528784_2","volume-title":"Formal concept analysis: Foundations and applications","author":"B Vormbrock","year":"2005","unstructured":"Vormbrock, B., & Wille, R. (2005). Semiconcept and protoconcept algebras: The basic theorems. In B. Ganter, G. Stumme, & R. Wille (Eds.), Formal concept analysis: Foundations and applications (pp. 34\u201348). Berlin: Springer."},{"key":"9370_CR25","first-page":"445","volume-title":"Ordered Sets NATO advanced study institutes series (series C\u2014mathematical and physical sciences)","author":"R Wille","year":"1982","unstructured":"Wille, R. (1982). Restructuring lattice theory: An approach based on hierarchies of concepts. In I. Rival (Ed.), Ordered Sets NATO advanced study institutes series (series C\u2014mathematical and physical sciences) (pp. 445\u2013470). Dordrecht: Springer."},{"key":"9370_CR26","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/10722280_22","volume-title":"Conceptual structures: Logical, linguistic, and computational issues","author":"R Wille","year":"2000","unstructured":"Wille, R., et al. (2000). Boolean concept logic. In B. Ganter (Ed.), Conceptual structures: Logical, linguistic, and computational issues (pp. 317\u2013331). Berlin: Springer."},{"key":"9370_CR27","doi-asserted-by":"crossref","unstructured":"Yao, Y. Y., & Chen, Y. (2006). Rough set approximations in formal concept analysis. In J. F. Peters, et al. (Ed.), Transactions on rough sets V (pp. 285\u2013305). Berlin: Springer.","DOI":"10.1007\/11847465_14"},{"issue":"2","key":"9370_CR28","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1080\/10798587.1996.10750660","volume":"2","author":"YY Yao","year":"1996","unstructured":"Yao, Y. Y., & Lin, T. Y. (1996). Generalization of rough sets using modal logics. Intelligent Automation and Soft Computing, 2(2), 103\u2013119.","journal-title":"Intelligent Automation and Soft Computing"},{"key":"9370_CR29","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-25929-9_6","volume-title":"International conference on rough sets and current trends in computing","author":"YY Yao","year":"2004","unstructured":"Yao, Y. Y., et al. (2004). A comparative study of formal concept analysis and rough set theory in data analysis. In S. Tsumoto (Ed.), International conference on rough sets and current trends in computing (pp. 59\u201368). Berlin: Springer."}],"container-title":["Journal of Logic, Language and Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-022-09370-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10849-022-09370-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-022-09370-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T12:09:10Z","timestamp":1676635750000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10849-022-09370-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,27]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["9370"],"URL":"https:\/\/doi.org\/10.1007\/s10849-022-09370-1","relation":{},"ISSN":["0925-8531","1572-9583"],"issn-type":[{"type":"print","value":"0925-8531"},{"type":"electronic","value":"1572-9583"}],"subject":[],"published":{"date-parts":[[2022,7,27]]},"assertion":[{"value":"1 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}