{"id":"https://openalex.org/W7119512719","doi":"https://doi.org/10.1093/logcom/exaf057","title":"Reasoning about attribute-relative approximations in multi-source environments: a modal framework with axiomatization","display_name":"Reasoning about attribute-relative approximations in multi-source environments: a modal framework with axiomatization","publication_year":2025,"publication_date":"2025-10-14","ids":{"openalex":"https://openalex.org/W7119512719","doi":"https://doi.org/10.1093/logcom/exaf057"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exaf057","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exaf057","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078473465","display_name":"Md. Aquil Khan","orcid":"https://orcid.org/0000-0001-9235-8613"},"institutions":[{"id":"https://openalex.org/I64295750","display_name":"Indian Institute of Technology Indore","ror":"https://ror.org/01hhf7w52","country_code":"IN","type":"education","lineage":["https://openalex.org/I64295750"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Md Aquil Khan","raw_affiliation_strings":["Department of Mathematics, Indian Institute of Technology Indore , Indore 453552,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Indian Institute of Technology Indore , Indore 453552,","institution_ids":["https://openalex.org/I64295750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5095091488","display_name":"Amal Talukdar","orcid":null},"institutions":[{"id":"https://openalex.org/I64295750","display_name":"Indian Institute of Technology Indore","ror":"https://ror.org/01hhf7w52","country_code":"IN","type":"education","lineage":["https://openalex.org/I64295750"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Amal Talukdar","raw_affiliation_strings":["Department of Mathematics, Indian Institute of Technology Indore , Indore 453552,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Indian Institute of Technology Indore , Indore 453552,","institution_ids":["https://openalex.org/I64295750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I64295750"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.8854,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.8346949,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"36","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9810000061988831,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9810000061988831,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.004399999976158142,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.002400000113993883,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rough-set","display_name":"Rough set","score":0.6933000087738037},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.6912999749183655},{"id":"https://openalex.org/keywords/modal-logic","display_name":"Modal logic","score":0.6373000144958496},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6248000264167786},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5978000164031982},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5809999704360962},{"id":"https://openalex.org/keywords/normal-modal-logic","display_name":"Normal modal logic","score":0.5753999948501587},{"id":"https://openalex.org/keywords/accessibility-relation","display_name":"Accessibility relation","score":0.5616999864578247},{"id":"https://openalex.org/keywords/modal-operator","display_name":"Modal operator","score":0.519599974155426}],"concepts":[{"id":"https://openalex.org/C111012933","wikidata":"https://www.wikidata.org/wiki/Q3137210","display_name":"Rough set","level":2,"score":0.6933000087738037},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.6912999749183655},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.6373000144958496},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6248000264167786},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5978000164031982},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5809999704360962},{"id":"https://openalex.org/C114092440","wikidata":"https://www.wikidata.org/wiki/Q840226","display_name":"Normal modal logic","level":4,"score":0.5753999948501587},{"id":"https://openalex.org/C11191006","wikidata":"https://www.wikidata.org/wiki/Q2663311","display_name":"Accessibility relation","level":4,"score":0.5616999864578247},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5605000257492065},{"id":"https://openalex.org/C78344899","wikidata":"https://www.wikidata.org/wiki/Q638442","display_name":"Modal operator","level":4,"score":0.519599974155426},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.44510000944137573},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.42879998683929443},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42250001430511475},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4163999855518341},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4018000066280365},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.35580000281333923},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.35420000553131104},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.35350000858306885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35269999504089355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3517000079154968},{"id":"https://openalex.org/C199879729","wikidata":"https://www.wikidata.org/wiki/Q205140","display_name":"Infinite set","level":3,"score":0.3328999876976013},{"id":"https://openalex.org/C86602344","wikidata":"https://www.wikidata.org/wiki/Q7667918","display_name":"T-norm fuzzy logics","level":5,"score":0.3122999966144562},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.30300000309944153},{"id":"https://openalex.org/C39105242","wikidata":"https://www.wikidata.org/wiki/Q5290286","display_name":"Dominance-based rough set approach","level":3,"score":0.29499998688697815},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C159032336","wikidata":"https://www.wikidata.org/wiki/Q2488768","display_name":"Non-monotonic logic","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C173125200","wikidata":"https://www.wikidata.org/wiki/Q5275729","display_name":"Modal \u03bc-calculus","level":5,"score":0.26750001311302185},{"id":"https://openalex.org/C102565666","wikidata":"https://www.wikidata.org/wiki/Q1378301","display_name":"Universal set","level":3,"score":0.2669000029563904},{"id":"https://openalex.org/C47030870","wikidata":"https://www.wikidata.org/wiki/Q467606","display_name":"Model theory","level":2,"score":0.2632000148296356},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.2554999887943268},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25429999828338623}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/logcom/exaf057","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exaf057","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W344132161","https://openalex.org/W1491083121","https://openalex.org/W1514529756","https://openalex.org/W1593210281","https://openalex.org/W1968255854","https://openalex.org/W1979029381","https://openalex.org/W1997362234","https://openalex.org/W2005312531","https://openalex.org/W2015749347","https://openalex.org/W2015787064","https://openalex.org/W2049204733","https://openalex.org/W2053749030","https://openalex.org/W2060671215","https://openalex.org/W2071988067","https://openalex.org/W2088296434","https://openalex.org/W2099341534","https://openalex.org/W2121520822","https://openalex.org/W2149400607","https://openalex.org/W2170755382","https://openalex.org/W2414329562","https://openalex.org/W2555933387","https://openalex.org/W2608746496","https://openalex.org/W2750921783","https://openalex.org/W2786150474","https://openalex.org/W3140030144","https://openalex.org/W3163311721","https://openalex.org/W4211144022","https://openalex.org/W4232953319","https://openalex.org/W4245978097","https://openalex.org/W4246790623","https://openalex.org/W4382680691","https://openalex.org/W4387341359","https://openalex.org/W4393995296"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"The":[1],"study":[2],"of":[3,20,101,133,142],"rough":[4,24,71,134],"set":[5,25,72,135],"theory":[6,136],"in":[7,22],"multi-agent/multi-source":[8],"contexts,":[9],"and":[10,48,58,65,87,92,109,137],"its":[11],"extension":[12],"to":[13,119,139],"attribute-relative":[14,86],"approximations,":[15],"constitutes":[16],"a":[17,32,76,115],"significant":[18],"line":[19],"research":[21],"the":[23,96,120,130,140],"literature.":[26],"Motivated":[27],"by":[28,46,50],"these,":[29],"we":[30],"propose":[31],"unified":[33],"modal":[34,61,131],"framework":[35],"based":[36],"on":[37,124],"multiple-source":[38],"information":[39],"structures,":[40],"where":[41],"accessibility":[42],"relations":[43],"are":[44],"indexed":[45],"sources":[47],"parameterized":[49],"attribute":[51],"sets.":[52],"We":[53,89],"introduce":[54],"two":[55],"semantics,":[56,121],"W-semantics":[57],"S-semantics,":[59],"interpreting":[60],"formulas":[62],"via":[63],"weak":[64],"strong":[66],"approximation":[67,144],"operators":[68],"from":[69],"multi-granulation":[70],"models.":[73],"These":[74],"provide":[75],"formal":[77],"system":[78],"for":[79,95],"reasoning":[80],"about":[81],"uncertainty":[82],"that":[83],"is":[84],"both":[85],"source-sensitive.":[88],"establish":[90],"sound":[91],"complete":[93],"axiomatizations":[94],"corresponding":[97],"logics":[98],"over":[99],"classes":[100],"models":[102],"satisfying":[103],"structural":[104],"properties":[105],"like":[106],"reflexivity,":[107],"symmetry":[108],"transitivity.":[110],"Our":[111],"completeness":[112],"proofs":[113],"use":[114],"step-by-step":[116],"construction":[117],"adapted":[118],"avoiding":[122],"reliance":[123],"copying":[125],"techniques.":[126],"This":[127],"work":[128],"deepens":[129],"foundations":[132],"contributes":[138],"logic":[141],"complex":[143],"systems.":[145]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-06-18T08:10:14.011955","created_date":"2026-01-09T00:00:00"}