{"id":"https://openalex.org/W3087047467","doi":"https://doi.org/10.1017/s1471068421000065","title":"Completing the Picture: Complexity of Graded Modal Logics with Converse","display_name":"Completing the Picture: Complexity of Graded Modal Logics with Converse","publication_year":2021,"publication_date":"2021-04-27","ids":{"openalex":"https://openalex.org/W3087047467","doi":"https://doi.org/10.1017/s1471068421000065","mag":"3087047467"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068421000065","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068421000065","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/37017B60A398813C5CF81B84516A63AF/S1471068421000065a.pdf/div-class-title-completing-the-picture-complexity-of-graded-modal-logics-with-converse-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/37017B60A398813C5CF81B84516A63AF/S1471068421000065a.pdf/div-class-title-completing-the-picture-complexity-of-graded-modal-logics-with-converse-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"BARTOSZ BEDNARCZYK","orcid":null},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]},{"id":"https://openalex.org/I78650965","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE","PL"],"is_corresponding":false,"raw_author_name":"BARTOSZ BEDNARCZYK","raw_affiliation_strings":["Computational Logic Group, TU Dresden, Dresden, Germany and Institute of Computer Science, University of Wroc\u0142aw, Wroc\u0142aw, Poland (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computational Logic Group, TU Dresden, Dresden, Germany and Institute of Computer Science, University of Wroc\u0142aw, Wroc\u0142aw, Poland (e-mail:","institution_ids":["https://openalex.org/I219388962","https://openalex.org/I4210087266","https://openalex.org/I78650965"]}]},{"author_position":"middle","author":{"id":null,"display_name":"EMANUEL KIERO\u0143SKI","orcid":null},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"EMANUEL KIERO\u0143SKI","raw_affiliation_strings":["Institute of Computer Science, University of Wroc\u0142aw, Wroc\u0142aw, Poland (e-mails:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Wroc\u0142aw, Wroc\u0142aw, Poland (e-mails:","institution_ids":["https://openalex.org/I219388962","https://openalex.org/I4210087266"]}]},{"author_position":"last","author":{"id":null,"display_name":"PIOTR WITKOWSKI","orcid":"https://orcid.org/0000-0002-1908-0827"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"PIOTR WITKOWSKI","raw_affiliation_strings":["Institute of Computer Science, University of Wroc\u0142aw, Wroc\u0142aw, Poland (e-mails:"],"raw_orcid":"https://orcid.org/0000-0002-1908-0827","affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Wroc\u0142aw, Wroc\u0142aw, Poland (e-mails:","institution_ids":["https://openalex.org/I219388962","https://openalex.org/I4210087266"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3255,"currency":"USD","value_usd":3255},"apc_paid":{"value":3255,"currency":"USD","value_usd":3255},"fwci":0.1402,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.55789007,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"21","issue":"4","first_page":"493","last_page":"520"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.614799976348877,"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"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.614799976348877,"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"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.1615000069141388,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.035999998450279236,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.9684000015258789},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.631600022315979},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.588699996471405},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5824999809265137},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5554999709129333},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5145000219345093},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.44589999318122864},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.42410001158714294}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.9684000015258789},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.631600022315979},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.588699996471405},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5824999809265137},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5554999709129333},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5145000219345093},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47049999237060547},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.44589999318122864},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.42410001158714294},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42160001397132874},{"id":"https://openalex.org/C197115733","wikidata":"https://www.wikidata.org/wiki/Q1003136","display_name":"Forcing (mathematics)","level":2,"score":0.40720000863075256},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40400001406669617},{"id":"https://openalex.org/C2778334786","wikidata":"https://www.wikidata.org/wiki/Q1586270","display_name":"Variation (astronomy)","level":2,"score":0.35830000042915344},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3571000099182129},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.3517000079154968},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.351500004529953},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3357999920845032},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.31209999322891235},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C11191006","wikidata":"https://www.wikidata.org/wiki/Q2663311","display_name":"Accessibility relation","level":4,"score":0.29589998722076416},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.28110000491142273},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.25220000743865967}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068421000065","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068421000065","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/37017B60A398813C5CF81B84516A63AF/S1471068421000065a.pdf/div-class-title-completing-the-picture-complexity-of-graded-modal-logics-with-converse-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1812.04413","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1812.04413","pdf_url":"https://arxiv.org/pdf/1812.04413","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1017/s1471068421000065","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068421000065","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/37017B60A398813C5CF81B84516A63AF/S1471068421000065a.pdf/div-class-title-completing-the-picture-complexity-of-graded-modal-logics-with-converse-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3087047467.pdf","grobid_xml":"https://content.openalex.org/works/W3087047467.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1525403130","https://openalex.org/W1554721881","https://openalex.org/W1636976386","https://openalex.org/W1759871617","https://openalex.org/W1997817571","https://openalex.org/W2073491323","https://openalex.org/W2082313938","https://openalex.org/W2143042096","https://openalex.org/W2605118152","https://openalex.org/W2965256832","https://openalex.org/W4211144022","https://openalex.org/W4244275182","https://openalex.org/W6648954988","https://openalex.org/W6670435879","https://openalex.org/W6725719597"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"A":[1],"complete":[2],"classification":[3,60],"of":[4,7,21,30,40,61,79,143],"the":[5,8,46,54,62,77,89,95,141,144],"complexity":[6],"local":[9],"and":[10,45],"global":[11],"satisfiability":[12],"problems":[13],"for":[14,123],"graded":[15,63,67,98,110,147],"modal":[16,64],"language":[17,65,91,96,145],"over":[18,76,86,135],"traditional":[19],"classes":[20,29],"frames":[22],"has":[23],"already":[24],"been":[25],"established.":[26],"By":[27],"\u201ctraditional\u201d":[28],"frames,":[31,81],"we":[32,52,72],"mean":[33],"those":[34],"characterized":[35],"by":[36],"any":[37],"positive":[38],"combination":[39],"reflexivity,":[41],"seriality,":[42],"symmetry,":[43],"transitivity,":[44],"Euclidean":[47,80],"property.":[48],"In":[49,70],"this":[50,83,87,124],"paper,":[51],"fill":[53],"gaps":[55],"remaining":[56],"in":[57],"an":[58,128],"analogous":[59],"with":[66,140,146],"converse":[68,102,111,117,148],"modalities.":[69,103,118,149],"particular,":[71],"show":[73],"its":[74,107],"NExpTime-completeness":[75],"class":[78,88],"demonstrating":[82],"way":[84],"that":[85,131],"considered":[90],"is":[92,126,133],"harder":[93],"than":[94],"without":[97,101],"modalities":[99],"or":[100],"We":[104],"also":[105],"consider":[106],"variation":[108,125],"disallowing":[109],"modalities,":[112],"but":[113],"still":[114],"admitting":[115],"basic":[116],"Our":[119],"most":[120],"important":[121],"result":[122],"confirming":[127],"earlier":[129],"conjecture":[130],"it":[132],"decidable":[134],"transitive":[136],"frames.":[137],"This":[138],"contrasts":[139],"undecidability":[142]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-08-28T12:50:07.497085","created_date":"2020-09-25T00:00:00"}