{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:27:00Z","timestamp":1742912820511,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":29,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811675010"},{"type":"electronic","value":"9789811675027"}],"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-981-16-7502-7_36","type":"book-chapter","created":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T09:06:55Z","timestamp":1635498415000},"page":"375-386","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Contingency Axiomatic System for Rough Sets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9841-3393","authenticated-orcid":false,"given":"Sujie","family":"Guan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0848-5343","authenticated-orcid":false,"given":"Shaobo","family":"Deng","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8213-1626","authenticated-orcid":false,"given":"Hui","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5428-6276","authenticated-orcid":false,"given":"Min","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,30]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Hughes, G.E., Cresswell, M.J., Cresswell, M.M.: A New Introduction to Modal Logic, Psychology Press, East Sussex (1996)","DOI":"10.4324\/9780203290644"},{"issue":"2","key":"36_CR2","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1305\/ndjfl\/1040248455","volume":"36","author":"L Humberstone","year":"1995","unstructured":"Humberstone, L.: The logic of non-contingency. Notre Dame J. Formal Log. 36(2), 214\u2013229 (1995)","journal-title":"Notre Dame J. Formal Log."},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Cresswell, M.J.: Necessity and contingency. Studia Log. 47(2), 145\u2013149 (1988)","DOI":"10.1007\/BF00370288"},{"key":"36_CR4","first-page":"425","volume":"224","author":"C Pizzi","year":"2013","unstructured":"Pizzi, C.: Bimodal fragments of contingency logics. Log. Anal. 224, 425\u2013438 (2013)","journal-title":"Log. Anal."},{"issue":"1","key":"36_CR5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s11787-012-0071-8","volume":"7","author":"C Pizzi","year":"2013","unstructured":"Pizzi, C.: Relative contingency and bimodality. Log. Univ. 7(1), 113\u2013123 (2013)","journal-title":"Log. Univ."},{"issue":"6","key":"36_CR6","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1007\/s10670-012-9412-5","volume":"78","author":"L Humberstone","year":"2013","unstructured":"Humberstone, L.: Zolin and pizzi: defining necessity from noncontingency. Erkenntnis 78(6), 1275\u20131302 (2013)","journal-title":"Erkenntnis"},{"issue":"35\/36","key":"36_CR7","first-page":"318","volume":"9","author":"H Montgomery","year":"1966","unstructured":"Montgomery, H., Routley, R.: Contingency and non-contingency bases for normal modal logics. Log. Anal. 9(35\/36), 318\u2013328 (1966)","journal-title":"Log. Anal."},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Steven, T.K.: Minimal non-contingency logic. Notre Dame J. Formal Log. 36(2), 230\u2013234 (1995)","DOI":"10.1305\/ndjfl\/1040248456"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Rosalie, I.: Uniform interpolation and sequent calculi in modal logic. Arch. Math. Log. 58(1-2), 155\u2013181 (2019)","DOI":"10.1007\/s00153-018-0629-0"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Manisha, J., Alexandre, M., Martins, M.A.: A fuzzy modal logic for fuzzy transition systems. Electron. Notes Theor. Comput. Sci. 348, 85\u2013103 (2020)","DOI":"10.1016\/j.entcs.2020.02.006"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Anantha, P., Ramanujam, R.: The monodic fragment of propositional term modal logic. Studia Log. 107(3), 533\u2013557 (2019)","DOI":"10.1007\/s11225-018-9784-x"},{"issue":"43","key":"36_CR12","first-page":"422","volume":"11","author":"H Montgomery","year":"1968","unstructured":"Montgomery, H., Routley, R.: Non-contingency axioms for s4 and s5. Log. Anal. 11(43), 422\u2013424 (1968)","journal-title":"Log. Anal."},{"issue":"47","key":"36_CR13","first-page":"225","volume":"12","author":"H Montgomery","year":"1969","unstructured":"Montgomery, H., Routley, R.: Modalities in a sequence of normal noncontingency modal systems. Log. Anal. 12(47), 225\u2013227 (1969)","journal-title":"Log. Anal."},{"issue":"3","key":"36_CR14","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11225-007-9044-y","volume":"85","author":"C Pizzi","year":"2007","unstructured":"Pizzi, C.: Necessity and relative contingency. Studia Log. 85(3), 395\u2013410 (2007)","journal-title":"Studia Log."},{"issue":"1","key":"36_CR15","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1017\/S1755020314000343","volume":"8","author":"J Fan","year":"2015","unstructured":"Fan, J., Wang, Y., Van Ditmarsch, H.: Contingency and knowing whether. Rev. Symb. Log. 8(1), 75\u2013107 (2015)","journal-title":"Rev. Symb. Log."},{"key":"36_CR16","first-page":"253","volume":"35","author":"Z Pawlak","year":"1987","unstructured":"Pawlak, Z.: Rough logic. Bull. Polish Acad. Sci. Tech. Sci. 35, 253\u2013258 (1987)","journal-title":"Bull. Polish Acad. Sci. Tech. Sci."},{"key":"36_CR17","unstructured":"Zdzis\u0142aw, P.: Rough sets: Theoretical aspects of reasoning about data. Springer Science & Business Media (2012)"},{"issue":"7","key":"36_CR18","doi-asserted-by":"publisher","first-page":"2069","DOI":"10.1007\/s13042-021-01293-w","volume":"12","author":"SB Salem","year":"2021","unstructured":"Salem, S.B., Naouali, S., Chtourou, Z.: A rough set based algorithm for updating the modes in categorical clustering. Int. J. Mach. Learn. Cybern. 12(7), 2069\u20132090 (2021). https:\/\/doi.org\/10.1007\/s13042-021-01293-w","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"36_CR19","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.ins.2020.08.049","volume":"547","author":"A Hamed","year":"2021","unstructured":"Hamed, A., Sobhy, A., Nassar, H.: Distributed approach for computing rough set approximations of big incomplete information systems. Inform. Sci. 547, 427\u2013449 (2021)","journal-title":"Inform. Sci."},{"key":"36_CR20","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ijar.2018.12.013","volume":"106","author":"C Wang","year":"2019","unstructured":"Wang, C., Shi, Y., Fan, X., Shao, M.: Attribute reduction based on k-nearest neighborhood rough sets. Int. J. Approximate Reason. 106, 18\u201331 (2019)","journal-title":"Int. J. Approximate Reason."},{"key":"36_CR21","doi-asserted-by":"crossref","unstructured":"Jihong, W., Hongmei, C., Zhong, Y., Tianrui, L., Xiaoling, Y., BinBin, S.: A novel hybrid feature selection method considering feature interaction in neighborhood rough set. Knowledge-Based Systems, p. 107167 (2021)","DOI":"10.1016\/j.knosys.2021.107167"},{"key":"36_CR22","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.ins.2020.03.064","volume":"527","author":"H Wang","year":"2020","unstructured":"Wang, H., Wang, W., Xiao, S., Cui, Z., Minyang, X., Zhou, X.: Improving artificial bee colony algorithm using a new neighborhood selection mechanism. Inform. Sci. 527, 227\u2013240 (2020)","journal-title":"Inform. Sci."},{"issue":"3","key":"36_CR23","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1007\/s40747-020-00171-2","volume":"7","author":"H Wang","year":"2020","unstructured":"Wang, H., et al.: Artificial bee colony algorithm based on knowledge fusion. Complex Intell. Syst. 7(3), 1139\u20131152 (2020). https:\/\/doi.org\/10.1007\/s40747-020-00171-2","journal-title":"Complex Intell. Syst."},{"key":"36_CR24","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.ijar.2019.11.002","volume":"116","author":"Y Yao","year":"2020","unstructured":"Yao, Y.: Three-way granular computing, rough sets, and formal concept analysis. Int. J. Approximate Reason. 116, 106\u2013125 (2020)","journal-title":"Int. J. Approximate Reason."},{"key":"36_CR25","doi-asserted-by":"crossref","unstructured":"Orlowska, E.: A logic of indiscernibility relations. Symposium on Computation Theory, pp. 177\u2013186. Berlin, Heidelberg (1984)","DOI":"10.1007\/3-540-16066-3_17"},{"key":"36_CR26","doi-asserted-by":"crossref","unstructured":"Helena, R., Andrzej, S.: Rough concepts logic. Symposium on Computation Theory, p. 288\u2013297. Berlin, Heidelberg (1985)","DOI":"10.1007\/3-540-16066-3_24"},{"key":"36_CR27","doi-asserted-by":"crossref","unstructured":"Qing, L., Lan, L.: Rough logic and its reasoning. Transactions on Computational Science II, pp. 84\u201399. Berlin, Heidelberg (2008)","DOI":"10.1007\/978-3-540-87563-5_5"},{"issue":"1\u20132","key":"36_CR28","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/S0304-3975(96)00334-9","volume":"179","author":"I D\u00fcntsch","year":"1997","unstructured":"D\u00fcntsch, I.: A logic for rough sets. Theor. Comput. Sci. 179(1\u20132), 427\u2013436 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"36_CR29","doi-asserted-by":"crossref","unstructured":"Yao, Y.Y., Tsau, Y.L.: Generalization of rough sets using modal logics. Intell. Autom. Soft Comput. 2(2), 103\u2013119 (1996)","DOI":"10.1080\/10798587.1996.10750660"}],"container-title":["Communications in Computer and Information Science","Data Mining and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-7502-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T09:13:30Z","timestamp":1635498810000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-7502-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9789811675010","9789811675027"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-7502-7_36","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DMBD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Data Mining and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"20 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dmbd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/dmbd2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"258","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":"57","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":"28","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":"22% - 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":"2.5","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":"8","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)"}}]}}