{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T01:58:04Z","timestamp":1781143084596,"version":"3.54.1"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Approximate Reasoning"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.ijar.2026.109735","type":"journal-article","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T04:31:21Z","timestamp":1780720281000},"page":"109735","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Some versions of six-set approximation theorem"],"prefix":"10.1016","volume":"197","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8567-8643","authenticated-orcid":false,"given":"Emilia","family":"Przemska","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.ijar.2026.109735_bib0001","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","article-title":"Rough sets","volume":"11","author":"Pawlak","year":"1982","journal-title":"Int. J. Comput. Inf. Sci."},{"key":"10.1016\/j.ijar.2026.109735_bib0002","series-title":"Rough-Neural Computing: techniques for Computing with Words","first-page":"5","article-title":"Elementary rough set granules: toward a rough set processor","author":"Pawlak","year":"2003"},{"issue":"4","key":"10.1016\/j.ijar.2026.109735_bib0003","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0888-613X(96)00071-0","article-title":"Two views of the theory of rough sets in finite universes","volume":"15","author":"Yao","year":"1996","journal-title":"Int. J. Approx. Reason."},{"issue":"1\u20134","key":"10.1016\/j.ijar.2026.109735_bib0004","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0020-0255(98)10006-3","article-title":"Relational interpretations of neighborhood operators and rough set approximation operators","volume":"111","author":"Yao","year":"1998","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ijar.2026.109735_bib0005","series-title":"Proc. IEEE Canadian Conf. on Electrical and Computer Engineering","first-page":"1553","article-title":"Rough sets, neighborhood systems, and granular computing","author":"Yao","year":"1999"},{"key":"10.1016\/j.ijar.2026.109735_bib0006","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.ijar.2019.09.011","article-title":"Six-set approximation theorem of neighborhood related rough sets","volume":"115","author":"Ma","year":"2019","journal-title":"Int. J. Approx. Reason."},{"key":"10.1016\/j.ijar.2026.109735_bib0007","article-title":"A novel approach to rough set model via neighborhood systems","author":"Shi","year":"2025","journal-title":"Fuzzy Set. Syst."},{"issue":"1","key":"10.1016\/j.ijar.2026.109735_bib0008","doi-asserted-by":"crossref","first-page":"182","DOI":"10.4064\/fm-3-1-182-199","article-title":"Sur l\u2019op\u00e9ration A de l\u2019analysis situs","volume":"3","author":"Kuratowski","year":"1922","journal-title":"Fundamenta Math."},{"key":"10.1016\/j.ijar.2026.109735_bib0009","first-page":"89","article-title":"On topological rough sets","volume":"37","author":"Wiweger","year":"1989","journal-title":"Bull. Pol. Acad. Sci., Math."},{"key":"10.1016\/j.ijar.2026.109735_bib0010","series-title":"Fuzzy Sets, Fuzzy Logic, and Fuzzy Systems: selected Papers by Lotfi A Zadeh","first-page":"433","article-title":"Fuzzy sets and information granularity","author":"Zadeh","year":"1996"},{"issue":"2","key":"10.1016\/j.ijar.2026.109735_bib0011","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0165-0114(97)00077-8","article-title":"Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic","volume":"90","author":"Zadeh","year":"1997","journal-title":"Fuzzy Sets Syst."},{"key":"10.1016\/j.ijar.2026.109735_bib0012","series-title":"1998 IEEE International Conference on Fuzzy Systems Proceedings. IEEE World Congress on Computational Intelligence (Cat. No 98CH36228)","first-page":"106","article-title":"Granularity of knowledge, indiscernibility and rough sets","volume":"1","author":"Pawlak","year":"1998"},{"key":"10.1016\/j.ijar.2026.109735_bib0013","first-page":"291","article-title":"Some remarks on sets of communicating sequential processes in topological rough set framework","volume":"60","author":"Polkowski","year":"2004","journal-title":"Fundam. Inform."},{"key":"10.1016\/j.ijar.2026.109735_bib0014","series-title":"1998 IEEE International Conference on Fuzzy Systems Proceedings. IEEE World Congress on Computational Intelligence (Cat. No 98CH36228)","first-page":"111","article-title":"Towards adaptive calculus of granules","volume":"1","author":"Polkowski","year":"1998"},{"key":"10.1016\/j.ijar.2026.109735_bib0015","first-page":"107","article-title":"Data mining and neighborhood systems, granular computing on binary relation I","author":"Lin","year":"1998","journal-title":"Granular Comput. Binary Rel. I."},{"key":"10.1016\/j.ijar.2026.109735_bib0016","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.ins.2023.02.020","article-title":"A topological approach to rough sets from a granular computing perspective","volume":"627","author":"Yao","year":"2023","journal-title":"Inf. Sci."},{"issue":"23","key":"10.1016\/j.ijar.2026.109735_bib0017","doi-asserted-by":"crossref","first-page":"5365","DOI":"10.1016\/j.ins.2007.07.008","article-title":"Granular computing and dual Galois connection","volume":"177","author":"Ma","year":"2007","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ijar.2026.109735_bib0018","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/978-3-540-27794-1_11","article-title":"A partition model of granular computing","volume":"3100","author":"Yao","year":"2004","journal-title":"Transac. Rough Sets, I. J. Subline"},{"key":"10.1016\/j.ijar.2026.109735_bib0019","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.ijar.2018.05.008","article-title":"The investigation of covering rough sets by Boolean matrices","volume":"100","author":"Ma","year":"2018","journal-title":"Int. J. Approx. Reason."},{"key":"10.1016\/j.ijar.2026.109735_bib0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijar.2025.109543","article-title":"Optimizations of approximation operators in covering rough set theory","author":"Zhang","year":"2025","journal-title":"Int. J. Approx. Reason."},{"key":"10.1016\/j.ijar.2026.109735_bib0021","article-title":"Important matrix computations in finite topological spaces","volume":"395","author":"Ma","year":"2021","journal-title":"Appl. Math. Comput."},{"issue":"22","key":"10.1016\/j.ijar.2026.109735_bib0022","doi-asserted-by":"crossref","first-page":"7479","DOI":"10.2298\/FIL2322479M","article-title":"Modular matrix calculations in the finite topological spaces","volume":"37","author":"Ma","year":"2023","journal-title":"Filomat"},{"key":"10.1016\/j.ijar.2026.109735_bib0023","first-page":"667","article-title":"Rough sets and Heyting algebra valued sets","volume":"35","author":"Obtulowicz","year":"1987","journal-title":"Bull. Polish Acad. Sci. Math."}],"container-title":["International Journal of Approximate Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X26001106?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X26001106?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T01:10:28Z","timestamp":1781140228000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0888613X26001106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":23,"alternative-id":["S0888613X26001106"],"URL":"https:\/\/doi.org\/10.1016\/j.ijar.2026.109735","relation":{},"ISSN":["0888-613X"],"issn-type":[{"value":"0888-613X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Some versions of six-set approximation theorem","name":"articletitle","label":"Article Title"},{"value":"International Journal of Approximate Reasoning","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ijar.2026.109735","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"109735"}}