{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T16:53:23Z","timestamp":1773939203377,"version":"3.50.1"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"3","funder":[{"DOI":"10.13039\/100020595","name":"National Science and Technology Council of Taiwan","doi-asserted-by":"crossref","award":["NSTC 113-2221-E-001-018-MY3 and NSTC 113-2221-E-001-021-MY3"],"award-info":[{"award-number":["NSTC 113-2221-E-001-018-MY3 and NSTC 113-2221-E-001-021-MY3"]}],"id":[{"id":"10.13039\/100020595","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2025,7,31]]},"abstract":"<jats:p>A formal context consists of objects, properties, and the incidence relation between them. Various notions of concepts defined with respect to formal contexts and their associated algebraic structures have been studied extensively, including formal concepts in formal concept analysis (FCA), rough concepts arising from rough set theory (RST), and semiconcepts and protoconcepts for dealing with negation. While all these kinds of concepts are associated with lattices, semiconcepts and protoconcepts additionally yield an ordered algebraic structure, called double Boolean algebras. As the name suggests, a double Boolean algebra contains two underlying Boolean algebras.<\/jats:p>\n          <jats:p>\n            In this article, we investigate logical and algebraic aspects of the representation and reasoning about different concepts with respect to formal contexts. We first review our previous work on two-sorted modal logic systems\n            <jats:bold>KB<\/jats:bold>\n            and\n            <jats:bold>KF<\/jats:bold>\n            for the representation and reasoning of rough concepts and formal concepts, respectively. Then, in order to represent and reason about both formal and rough concepts in a single framework, these two logics are unified into a two-sorted Boolean modal logic\n            <jats:bold>BM<\/jats:bold>\n            , in which semiconcepts and protoconcepts are also expressible. Based on the logical representation of semiconcepts and protoconcepts, we prove the characterization of double Boolean algebras in terms of their underlying Boolean algebras. Finally, we also discuss the possibilities of extending our logical systems for the representation and reasoning of more fine-grained quantitative information in formal contexts.\n          <\/jats:p>","DOI":"10.1145\/3733832","type":"journal-article","created":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T11:06:33Z","timestamp":1746443193000},"page":"1-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Logical and Algebraic Aspects of Reasoning with Formal Contexts"],"prefix":"10.1145","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8932-126X","authenticated-orcid":false,"given":"Prosenjit","family":"Howlader","sequence":"first","affiliation":[{"name":"Institute of Information Science, Academia Sinica, Taipei, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6842-9637","authenticated-orcid":false,"given":"Churn-Jung","family":"Liau","sequence":"additional","affiliation":[{"name":"Institute of Information Science, Academia Sinica, Taipei, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,7,14]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-319-74681-4_6","volume-title":"Interactions between Computational Intelligence and Mathematics","author":"Antoni L.","year":"2018","unstructured":"L. Antoni S. Kraj\u010di and O. Kr\u00eddlo. 2018. On fuzzy generalizations of concept lattices. In Interactions between Computational Intelligence and Mathematics. L. K\u00f3czy and J. Medina (Eds.), Springer, 79\u2013103."},{"issue":"3","key":"e_1_3_3_3_2","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.jal.2012.04.003","article-title":"Deciding the word problem in pure double Boolean algebras","volume":"10","author":"Balbiani P.","year":"2012","unstructured":"P. Balbiani. 2012. Deciding the word problem in pure double Boolean algebras. Journal of Applied Logic 10, 3 (2012), 260\u2013273.","journal-title":"Journal of Applied Logic"},{"issue":"1","key":"e_1_3_3_4_2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.apal.2003.01.001","article-title":"Concept lattices and order in fuzzy logic","volume":"128","author":"Belohl\u00e1vek R.","year":"2004","unstructured":"R. Belohl\u00e1vek. 2004. Concept lattices and order in fuzzy logic. Annals of Pure and Applied Logic 128, 1\u20133 (2004), 277\u2013298.","journal-title":"Annals of Pure and Applied Logic"},{"key":"e_1_3_3_5_2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-642-21881-1_4","volume-title":"Proceedings of 13th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC \u201911)and","volume":"6743","author":"Belohl\u00e1vek R.","year":"2011","unstructured":"R. Belohl\u00e1vek. 2011. What is a fuzzy concept lattice? II. In Proceedings of 13th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC \u201911). S. Kuznetsov, D. Slezak, D. Hepting, and B. Mirkin (Eds.), Lecture Notes in Computer Science, Vol. 6743, Springer, 19\u201326."},{"key":"e_1_3_3_6_2","series-title":"CEUR Workshop Proceedings","volume-title":"Proceedings of the International Workshop on Concept Lattices and Their Applications (CLA)","author":"Belohl\u00e1vek R.","year":"2005","unstructured":"R. Belohl\u00e1vek and V. Vychodil. 2005. What is a fuzzy concept lattice? In Proceedings of the International Workshop on Concept Lattices and Their Applications (CLA). R. Belohl\u00e1vek and V. Sn\u00e1sel (Eds.), CEUR Workshop Proceedings, Vol. 162, CEUR-WS.org."},{"issue":"3","key":"e_1_3_3_7_2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1305\/ndjfl\/1063372199","article-title":"Four-valued logic","volume":"42","author":"Bimb\u00f3 K.","year":"2001","unstructured":"K. Bimb\u00f3 and J. M. Dunn. 2001. Four-valued logic. Notre Dame Journal of Formal Logic 42, 3 (2001), 171\u2013192.","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"e_1_3_3_8_2","volume-title":"Lattice Theory","author":"Birkhoff G.","year":"1940","unstructured":"G. Birkhoff. 1940. Lattice Theory, Vol. 25. American Mathematical Soc."},{"key":"e_1_3_3_9_2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"Blackburn P.","year":"2001","unstructured":"P. Blackburn M. De Rijke and Y. Venema. 2001. Modal Logic. Cambridge University Press Cambridge."},{"issue":"5","key":"e_1_3_3_10_2","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1093\/logcom\/exp062","article-title":"On the minimum many-valued modal logic over a finite residuated lattice","volume":"21","author":"Bou F.","year":"2011","unstructured":"F. Bou F. Esteva L. Godo and R. Rodr\u00edguez. 2011. On the minimum many-valued modal logic over a finite residuated lattice. Journal of Logic and Computation 21, 5 (2011), 739\u2013790.","journal-title":"Journal of Logic and Computation"},{"key":"e_1_3_3_11_2","first-page":"192","volume-title":"Proceedings of the 37th Conference of the North American Fuzzy Information Processing Society (NAFIPS)Communications in Computer and Information Science","author":"Brito A.","year":"2018","unstructured":"A. Brito L. Barros E. Esmi F. Bertato and M. Coniglio. 2018. Fuzzy formal concept analysis. In Proceedings of the 37th Conference of the North American Fuzzy Information Processing Society (NAFIPS). G. A. Barreto and R. Coelho (Eds.), Communications in Computer and Information Science, Vol. 831, Springer, 192\u2013205."},{"key":"e_1_3_3_12_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00374047","article-title":"Graded modalities, II (canonical models)","volume":"47","author":"Caro F. D.","year":"1988","unstructured":"F. D. Caro. 1988. Graded modalities, II (canonical models). Studia Logica 47, 1 (1988), 1\u201310.","journal-title":"Studia Logica"},{"issue":"2","key":"e_1_3_3_13_2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF00935601","article-title":"General canonical models for graded normal logics (graded modalities IV)","volume":"49","author":"Cerrato C.","year":"1990","unstructured":"C. Cerrato. 1990. General canonical models for graded normal logics (graded modalities IV). Studia Logica 49, 2 (1990), 241\u2013252.","journal-title":"Studia Logica"},{"issue":"1","key":"e_1_3_3_14_2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01053022","article-title":"Decidability by filtrations for graded normal logics (graded modalities V)","volume":"53","author":"Cerrato C.","year":"1994","unstructured":"C. Cerrato. 1994. Decidability by filtrations for graded normal logics (graded modalities V). Studia Logica 53, 1 (1994), 61\u201373.","journal-title":"Studia Logica"},{"key":"e_1_3_3_15_2","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.ins.2020.05.074","article-title":"Rough concepts","volume":"561","author":"Conradie W.","year":"2021","unstructured":"W. Conradie S. Frittella K. Manoorkar S. Nazari A. Palmigiano A. Tzimoulis and N. M. Wijnberg. 2021. Rough concepts. Information Sciences 561 (2021), 371\u2013413.","journal-title":"Information Sciences"},{"key":"e_1_3_3_16_2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-3-662-52921-8_10","volume-title":"Logic, Language, Information, and Computation","author":"Conradie W.","year":"2016","unstructured":"W. Conradie S. Frittella A. Palmigiano M. Piazzai A. Tzimoulis and N. M. Wijnberg. 2016. Categories: How I learned to stop worrying and love two sorts. In Logic, Language, Information, and Computation. J. V\u00e4\u00e4n\u00e4nen (Ed.), Springer, Berlin, 145\u2013164."},{"key":"e_1_3_3_17_2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.4204\/EPTCS.251.12","article-title":"Toward an epistemic-logical theory of categorization","volume":"251","author":"Conradie W.","year":"2017","unstructured":"W. Conradie, S. Frittella, A. Palmigiano, M. Piazzai, A. Tzimoulis, and N. M. Wijnberg. 2017. Toward an epistemic-logical theory of categorization. Electronic Proceedings in Theoretical Computer Science 251 (2017), 167\u2013186.","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"issue":"9","key":"e_1_3_3_18_2","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1016\/j.apal.2019.04.003","article-title":"Algorithmic correspondence and canonicity for non-distributive logics","volume":"170","author":"Conradie W.","year":"2019","unstructured":"W. Conradie and A. Palmigiano. 2019. Algorithmic correspondence and canonicity for non-distributive logics. Annals of Pure and Applied Logic 170, 9 (2019), 923\u2013974.","journal-title":"Annals of Pure and Applied Logic"},{"key":"e_1_3_3_19_2","series-title":"Landscapes in Logic","first-page":"38","volume-title":"Contemporary Logic and Computing","author":"Conradie W.","year":"2020","unstructured":"W. Conradie, A. Palmigiano, C. Robinson, and N. Wijnberg. 2020. Non-distributive logics: From semantics to meaning. In Contemporary Logic and Computing, A. Rezus (Ed.), Landscapes in Logic, Vol. 1. Coll. Publ., London, 38\u201386."},{"key":"e_1_3_3_20_2","first-page":"279","volume-title":"Proceedings of the 17th European Conference on Logics in Artificial Intelligence (JELIA)Lecture Notes in Computer Science","author":"Dautovic S.","year":"2021","unstructured":"S. Dautovic, D. Doder, and Z. Ognjanovic. 2021. An epistemic probabilistic logic with conditional probabilities. In Proceedings of the 17th European Conference on Logics in Artificial Intelligence (JELIA). W. Faber, G. Friedrich, M. Gebser, and M. Morak (Eds.), Lecture Notes in Computer Science, Vol. 12678, Springer, 279\u2013293."},{"key":"e_1_3_3_21_2","doi-asserted-by":"crossref","first-page":"109037","DOI":"10.1016\/j.ijar.2023.109037","article-title":"Reasoning about knowledge and conditional probability","volume":"163","author":"Dautovic S.","year":"2023","unstructured":"S. Dautovic, D. Doder, and Z. Ognjanovic. 2023. Reasoning about knowledge and conditional probability. International Journal of Approximate Reasoning 163 (2023), 109037.","journal-title":"International Journal of Approximate Reasoning"},{"issue":"1","key":"e_1_3_3_22_2","first-page":"195","article-title":"A possibility-theoretic view of formal concept analysis","volume":"75","author":"Dubois D.","year":"2007","unstructured":"D. Dubois, F. D. de Saint-Cyr, and H. Prade. 2007. A possibility-theoretic view of formal concept analysis. Fundamenta Informaticae 75, 1\u20134 (2007), 195\u2013213.","journal-title":"Fundamenta Informaticae"},{"key":"e_1_3_3_23_2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1109\/ICDM.2002.1183898","volume-title":"Proceedings of the 2002 IEEE International Conference on Data Mining","author":"D\u00fcntsch I.","year":"2002","unstructured":"I. D\u00fcntsch and G. Gediga. 2002. Modal-style operators in qualitative data analysis. In Proceedings of the 2002 IEEE International Conference on Data Mining. K. Vipin (Ed.), IEEE Computer Society, 155\u2013162."},{"issue":"2","key":"e_1_3_3_24_2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF00370285","article-title":"Graded modalities. III (the completeness and compactness of S4","volume":"47","author":"Fattorosi-Barnaba M.","year":"1988","unstructured":"M. Fattorosi-Barnaba and C. Cerrato. 1988. Graded modalities. III (the completeness and compactness of S40). Studia Logica 47, 2 (1988), 99\u2013110.","journal-title":"Studia Logica"},{"key":"e_1_3_3_25_2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF00379767","article-title":"Graded modalities. I","volume":"44","author":"Fattorosi-Barnaba M.","year":"1985","unstructured":"M. Fattorosi-Barnaba and F. De Caro. 1985. Graded modalities. I. Studia Logica 44 (1985), 197\u2013221.","journal-title":"Studia Logica"},{"key":"e_1_3_3_26_2","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1002\/malq.19950410410","article-title":"An infinitary graded modal logic (graded modalities VI)","volume":"41","author":"Fattorosi-Barnaba M.","year":"1995","unstructured":"M. Fattorosi-Barnaba and S. Grassotti. 1995. An infinitary graded modal logic (graded modalities VI). Mathematical Logic Quarterly 41 (1995), 547\u2013563.","journal-title":"Mathematical Logic Quarterly"},{"key":"e_1_3_3_27_2","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1002\/malq.19990450406","article-title":"The modality of finite (graded modalities VII)","volume":"45","author":"Fattorosi-Barnaba M.","year":"1999","unstructured":"M. Fattorosi-Barnaba and U. P. Balestrini. 1999. The modality of finite (graded modalities VII). Mathematical Logic Quarterly 45 (1999), 471\u2013480.","journal-title":"Mathematical Logic Quarterly"},{"key":"e_1_3_3_28_2","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198537915.001.0001","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming (Vol. 4): Epistemic and Temporal Reasoning","author":"Gabbay D. M.","year":"1995","unstructured":"D. M. Gabbay, C. J. Hogger, and J. A. Robinson, Eds. 1995. Handbook of Logic in Artificial Intelligence and Logic Programming (Vol. 4): Epistemic and Temporal Reasoning. Oxford University Press, Inc."},{"key":"e_1_3_3_29_2","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/978-1-4613-0897-3_17","volume-title":"Mathematical Logic and Its Applications","author":"Gargov G.","year":"1987","unstructured":"G. Gargov, S. Passy, and T. Tinchev. 1987. Modal environment for Boolean speculations. In Mathematical Logic and Its Applications. D. G. Skordev (Ed.), Springer, 253\u2013263."},{"issue":"2","key":"e_1_3_3_30_2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s11225-006-9008-7","article-title":"Generalized Kripke frames","volume":"84","author":"Gehrke M.","year":"2006","unstructured":"M. Gehrke. 2006. Generalized Kripke frames. Studia Logica 84, 2 (2006), 241\u2013275.","journal-title":"Studia Logica"},{"issue":"1","key":"e_1_3_3_31_2","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/3632526","article-title":"Algebraic proof theory for","volume":"25","author":"Greco G.","year":"2024","unstructured":"G. Greco, P. Jipsen, F. Liang, A. Palmigiano, and A. Tzimoulis. 2024. Algebraic proof theory for LE-logics. ACM Transactions on Computational Logic 25, 1, Article 6 (2024), 37.","journal-title":"ACM Transactions on Computational Logic"},{"key":"e_1_3_3_32_2","volume-title":"Reasoning about Uncertainty","author":"Halpern J.","year":"2005","unstructured":"J. Halpern. 2005. Reasoning about Uncertainty. MIT Press."},{"key":"e_1_3_3_33_2","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"Harel D.","year":"2000","unstructured":"D. Harel, J. Tiuryn, and D. Kozen. 2000. Dynamic Logic. MIT Press."},{"issue":"5","key":"e_1_3_3_34_2","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1093\/jigpal\/jzy079","article-title":"Game-theoretic semantics for non-distributive logics","volume":"27","author":"Hartonas C.","year":"2019","unstructured":"C. Hartonas. 2019. Game-theoretic semantics for non-distributive logics. Logic Journal of the IGPL 27, 5 (2019), 718\u2013742.","journal-title":"Logic Journal of the IGPL"},{"issue":"2","key":"e_1_3_3_35_2","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1080\/11663081.2018.1547515","article-title":"Lattice logic as a fragment of (2-sorted) residuated modal logic","volume":"29","author":"Hartonas C.","year":"2019","unstructured":"C. Hartonas. 2019. Lattice logic as a fragment of (2-sorted) residuated modal logic. Journal of Applied Non-Classical Logics 29, 2 (2019), 152\u2013170.","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"e_1_3_3_36_2","first-page":"440","volume-title":"Proceedings of the International Joint Conference on Rough Sets","author":"Howlader P.","year":"2018","unstructured":"P. Howlader and M. Banerjee. 2018. Algebras from semiconcepts in rough set theory. In Proceedings of the International Joint Conference on Rough Sets. H. S. Nguyen (Ed.), Springer, Cham, 440\u2013454."},{"key":"e_1_3_3_37_2","first-page":"308","volume-title":"Proceedings of the International Joint Conference on Rough Sets","author":"Howlader P.","year":"2020","unstructured":"P. Howlader and M. Banerjee. 2020. Object oriented protoconcepts and logics for double and pure double Boolean algebras. In Proceedings of the International Joint Conference on Rough Sets. R. Bello (Ed.), Springer, Cham, 308\u2013323."},{"key":"e_1_3_3_38_2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.ijar.2022.11.015","article-title":"A non-distributive logic for semiconcepts and its modal extension with semantics based on Kripke contexts","volume":"153","author":"Howlader P.","year":"2023","unstructured":"P. Howlader and M. Banerjee. 2023. A non-distributive logic for semiconcepts and its modal extension with semantics based on Kripke contexts. International Journal of Approximate Reasoning 153 (2023), 115\u2013143.","journal-title":"International Journal of Approximate Reasoning"},{"key":"e_1_3_3_39_2","doi-asserted-by":"crossref","DOI":"10.1007\/s00012-023-00811-x","article-title":"Topological representation of double Boolean algebras","volume":"84","author":"Howlader P.","year":"2023","unstructured":"P. Howlader and M. Banerjee. 2023. Topological representation of double Boolean algebras. Algebra Universalis 84 (2023), Paper No. 15, 32.","journal-title":"Algebra Universalis"},{"key":"e_1_3_3_40_2","first-page":"154","volume-title":"Proceedings of the International Joint Conference on Rough Sets (IJCRS)","volume":"14481","author":"Howlader P.","year":"2023","unstructured":"P. Howlader and C. Liau. 2023. Two-sorted modal logic for formal and rough concepts. In Proceedings of the International Joint Conference on Rough Sets (IJCRS). A. Campagner, O. U. Lenz, S. Xia, D. Slezak, J. Was, and J. Yao (Eds.), LNCS, Vol. 14481, Springer, 154\u2013169."},{"key":"e_1_3_3_41_2","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/j.ijar.2017.06.011","article-title":"Typology of axioms for a weighted modal logic","volume":"90","author":"Legastelois B\u00e9n\u00e9dicte","year":"2017","unstructured":"B\u00e9n\u00e9dicte Legastelois, Marie-Jeanne Lesot, and Adrien Revault d'Allonnes. 2017. Typology of axioms for a weighted modal logic. International Journal of Approximate Reasoning 90 (2017), 341\u2013358.","journal-title":"International Journal of Approximate Reasoning"},{"issue":"2","key":"e_1_3_3_42_2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3233\/FI-2020-1921","article-title":"A many-sorted polyadic modal logic","volume":"173","author":"Leu\u015ftean I.","year":"2020","unstructured":"I. Leu\u015ftean, N. Moang\u0103, and T. F. \u015eerb\u0103nu\u0163\u0103. 2020. A many-sorted polyadic modal logic. Fundamenta Informaticae 173, 2\u20133 (2020), 191\u2013215.","journal-title":"Fundamenta Informaticae"},{"key":"e_1_3_3_43_2","first-page":"43","volume-title":"Proceedings of the 10th ECAI","author":"Liau C.","year":"1992","unstructured":"C. Liau and I. Lin. 1992. Quantitative modal logic and possibilistic reasoning. In Proceedings of the 10th ECAI. B. Neumann (Ed.), John Wiley & Sons. Ltd., 43\u201347."},{"issue":"4","key":"e_1_3_3_44_2","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0888-613X(93)90019-A","article-title":"Proof methods for reasoning about possibility and necessity","volume":"9","author":"Liau C.","year":"1993","unstructured":"C. Liau and I. Lin. 1993. Proof methods for reasoning about possibility and necessity. International Journal of Approximate Reasoning 9, 4 (1993), 327\u2013364.","journal-title":"International Journal of Approximate Reasoning"},{"key":"e_1_3_3_45_2","first-page":"316","volume-title":"Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems","author":"Liau C.","year":"1993","unstructured":"C. Liau and I. Lin. 1993. Reasoning about higher order uncertainty in possibilistic logic. In Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems. J. Komorowski and Z. Ra\u015b (Eds.), LNAI, Vol. 689, Springer-Verlag, 316\u2013325."},{"issue":"1","key":"e_1_3_3_46_2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0004-3702(96)00013-6","article-title":"Possibilistic reasoning\u2014A mini-survey and uniform semantics","volume":"88","author":"Liau C.","year":"1996","unstructured":"C. Liau and I. Lin. 1996. Possibilistic reasoning\u2014A mini-survey and uniform semantics. Artificial Intelligence 88, 1\u20132 (1996), 163\u2013193.","journal-title":"Artificial Intelligence"},{"key":"e_1_3_3_47_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-47012-2","volume-title":"Probability Logics\u2014Probability-Based Formalization of Uncertain Reasoning","author":"Ognjanovic Z.","year":"2016","unstructured":"Z. Ognjanovic, M. Raskovic, and Z. Markovic. 2016. Probability Logics\u2014Probability-Based Formalization of Uncertain Reasoning. Springer."},{"issue":"5","key":"e_1_3_3_48_2","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","article-title":"Rough sets","volume":"11","author":"Pawlak Z.","year":"1982","unstructured":"Z. Pawlak. 1982. Rough sets. International Journal of Computer & Information Sciences 11, 5 (1982), 341\u2013356.","journal-title":"International Journal of Computer & Information Sciences"},{"key":"e_1_3_3_49_2","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/978-3-540-70901-5_16","volume-title":"Formal Concept Analysis","author":"Vormbrock B.","year":"2007","unstructured":"B. Vormbrock. 2007. A solution of the word problem for free double Boolean algebras. In Formal Concept Analysis. S. O. Kuznetsov (Ed.), Springer, Berlin, 240\u2013270."},{"key":"e_1_3_3_50_2","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/11528784_2","volume-title":"Formal Concept Analysis: Foundations and Applications","author":"Vormbrock B.","year":"2005","unstructured":"B. Vormbrock and R. Wille. 2005. Semiconcept and protoconcept algebras: The basic theorems. In Formal Concept Analysis: Foundations and Applications. B. Ganter (Ed.), Springer, Berlin, 34\u201348."},{"key":"e_1_3_3_51_2","series-title":"NATO Advanced Study Institutes Series","first-page":"445","volume-title":"Ordered Sets.","author":"Wille R.","year":"1981","unstructured":"R. Wille. 1981. Restructuring lattice theory: An approach based on hierarchies of concepts. In Ordered Sets. I. Rival (Ed.), NATO Advanced Study Institutes Series, Vol. 83. Springer, Dordrecht, 445\u2013470."},{"key":"e_1_3_3_52_2","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/10722280_22","volume-title":"Conceptual Structures: Logical, Linguistic, and Computational Issues","author":"Wille R.","year":"2000","unstructured":"R. Wille. 2000. Boolean concept logic. In Conceptual Structures: Logical, Linguistic, and Computational Issues. B. Ganter (Ed.), Springer, Berlin, 317\u2013331."},{"key":"e_1_3_3_53_2","first-page":"59","volume-title":"Proceedings of the International Conference on Rough Sets and Current Trends in ComputingS. Tsumoto","author":"Yao Y. Y.","year":"2004","unstructured":"Y. Y. Yao. 2004. A comparative study of formal concept analysis and rough set theory in data analysis. In Proceedings of the International Conference on Rough Sets and Current Trends in Computing. S. Tsumoto (Ed.), Springer, Berlin, 59\u201368."},{"key":"e_1_3_3_54_2","first-page":"796","volume-title":"Proceedings of the IEEE Annual Meeting of the Fuzzy Information Processing Society (NAFIPS)","volume":"2","author":"Yao Y. Y.","year":"2004","unstructured":"Y. Y. Yao. 2004. Concept lattices in rough set theory. In Proceedings of the IEEE Annual Meeting of the Fuzzy Information Processing Society (NAFIPS), Vol. 2. IEEE, 796\u2013801."}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3733832","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T00:16:12Z","timestamp":1752538572000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3733832"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,14]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,7,31]]}},"alternative-id":["10.1145\/3733832"],"URL":"https:\/\/doi.org\/10.1145\/3733832","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"value":"1529-3785","type":"print"},{"value":"1557-945X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,14]]},"assertion":[{"value":"2024-07-12","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-04-23","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-07-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}