{"id":"https://openalex.org/W2975393337","doi":"https://doi.org/10.1145/3356043","title":"Satisfiability of Modal Inclusion Logic","display_name":"Satisfiability of Modal Inclusion Logic","publication_year":2019,"publication_date":"2019-09-27","ids":{"openalex":"https://openalex.org/W2975393337","doi":"https://doi.org/10.1145/3356043","mag":"2975393337"},"language":"en","primary_location":{"id":"doi:10.1145/3356043","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3356043","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","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/A5078573449","display_name":"Lauri Hella","orcid":"https://orcid.org/0000-0002-9117-8124"},"institutions":[{"id":"https://openalex.org/I166825849","display_name":"Tampere University","ror":"https://ror.org/033003e23","country_code":"FI","type":"education","lineage":["https://openalex.org/I166825849"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Lauri Hella","raw_affiliation_strings":["Tampere University, Kanslerinrinne, Tampere, Finland"],"affiliations":[{"raw_affiliation_string":"Tampere University, Kanslerinrinne, Tampere, Finland","institution_ids":["https://openalex.org/I166825849"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059829668","display_name":"Antti Kuusisto","orcid":"https://orcid.org/0000-0003-1356-8749"},"institutions":[{"id":"https://openalex.org/I166825849","display_name":"Tampere University","ror":"https://ror.org/033003e23","country_code":"FI","type":"education","lineage":["https://openalex.org/I166825849"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Antti Kuusisto","raw_affiliation_strings":["Tampere University, Kanslerinrinne, Tampere, Finland"],"affiliations":[{"raw_affiliation_string":"Tampere University, Kanslerinrinne, Tampere, Finland","institution_ids":["https://openalex.org/I166825849"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025571978","display_name":"Arne Meier","orcid":"https://orcid.org/0000-0002-8061-5376"},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Arne Meier","raw_affiliation_strings":["Leibniz Universit\u00fct Hannover, Hannover, Germany"],"affiliations":[{"raw_affiliation_string":"Leibniz Universit\u00fct Hannover, Hannover, Germany","institution_ids":["https://openalex.org/I114112103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008982209","display_name":"Heribert Vollmer","orcid":"https://orcid.org/0000-0002-9292-1960"},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Heribert Vollmer","raw_affiliation_strings":["Leibniz Universit\u00fct Hannover, Hannover, Germany"],"affiliations":[{"raw_affiliation_string":"Leibniz Universit\u00fct Hannover, Hannover, Germany","institution_ids":["https://openalex.org/I114112103"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5078573449"],"corresponding_institution_ids":["https://openalex.org/I166825849"],"apc_list":null,"apc_paid":null,"fwci":0.434,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.72260062,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"21","issue":"1","first_page":"1","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9994000196456909,"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.9994000196456909,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9976999759674072,"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/T10142","display_name":"Formal Methods in Verification","score":0.9969000220298767,"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/exptime","display_name":"EXPTIME","score":0.7234171032905579},{"id":"https://openalex.org/keywords/multimodal-logic","display_name":"Multimodal logic","score":0.6311863660812378},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6280195713043213},{"id":"https://openalex.org/keywords/modal-logic","display_name":"Modal logic","score":0.6246774792671204},{"id":"https://openalex.org/keywords/normal-modal-logic","display_name":"Normal modal logic","score":0.5642141103744507},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5440064072608948},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5194239616394043},{"id":"https://openalex.org/keywords/dynamic-logic","display_name":"Dynamic logic (digital electronics)","score":0.5141818523406982},{"id":"https://openalex.org/keywords/modal-\u03bc-calculus","display_name":"Modal \u03bc-calculus","score":0.4685189425945282},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.466633141040802},{"id":"https://openalex.org/keywords/s5","display_name":"S5","score":0.4343813955783844},{"id":"https://openalex.org/keywords/accessibility-relation","display_name":"Accessibility relation","score":0.4262446165084839},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.41851842403411865},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41790467500686646},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4162661135196686},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.39723488688468933},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39361581206321716},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.35508036613464355},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28512662649154663},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.13944166898727417}],"concepts":[{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.7234171032905579},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.6311863660812378},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6280195713043213},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.6246774792671204},{"id":"https://openalex.org/C114092440","wikidata":"https://www.wikidata.org/wiki/Q840226","display_name":"Normal modal logic","level":4,"score":0.5642141103744507},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5440064072608948},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5194239616394043},{"id":"https://openalex.org/C2777796570","wikidata":"https://www.wikidata.org/wiki/Q2351326","display_name":"Dynamic logic (digital electronics)","level":4,"score":0.5141818523406982},{"id":"https://openalex.org/C173125200","wikidata":"https://www.wikidata.org/wiki/Q5275729","display_name":"Modal \u03bc-calculus","level":5,"score":0.4685189425945282},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.466633141040802},{"id":"https://openalex.org/C192609573","wikidata":"https://www.wikidata.org/wiki/Q7388341","display_name":"S5","level":5,"score":0.4343813955783844},{"id":"https://openalex.org/C11191006","wikidata":"https://www.wikidata.org/wiki/Q2663311","display_name":"Accessibility relation","level":4,"score":0.4262446165084839},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.41851842403411865},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41790467500686646},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4162661135196686},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.39723488688468933},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39361581206321716},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.35508036613464355},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28512662649154663},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.13944166898727417},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C165801399","wikidata":"https://www.wikidata.org/wiki/Q25428","display_name":"Voltage","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C172385210","wikidata":"https://www.wikidata.org/wiki/Q5339","display_name":"Transistor","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3356043","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3356043","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8199999928474426,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G4340905651","display_name":null,"funder_award_id":"247444366","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W582265660","https://openalex.org/W1435774229","https://openalex.org/W1491357268","https://openalex.org/W1608479762","https://openalex.org/W1901350436","https://openalex.org/W1973302434","https://openalex.org/W1983126204","https://openalex.org/W1989783863","https://openalex.org/W1993151238","https://openalex.org/W2018462672","https://openalex.org/W2033647831","https://openalex.org/W2034690236","https://openalex.org/W2073491323","https://openalex.org/W2117189826","https://openalex.org/W2137379463","https://openalex.org/W2156038678","https://openalex.org/W2186175345","https://openalex.org/W2238398106","https://openalex.org/W2256709336","https://openalex.org/W2782381758","https://openalex.org/W2795570893","https://openalex.org/W2963674548","https://openalex.org/W2964051209","https://openalex.org/W2964084990","https://openalex.org/W3093094759","https://openalex.org/W4211144022"],"related_works":["https://openalex.org/W2793267953","https://openalex.org/W2188462059","https://openalex.org/W142011187","https://openalex.org/W2534562289","https://openalex.org/W3108798275","https://openalex.org/W2179506702","https://openalex.org/W2795425183","https://openalex.org/W4233254255","https://openalex.org/W2260113151","https://openalex.org/W1542111937"],"abstract_inverted_index":{"We":[0,13],"investigate":[1],"the":[2,6,18,22,28],"computational":[3],"complexity":[4],"of":[5,9,17,49],"satisfiability":[7],"problem":[8],"modal":[10],"inclusion":[11],"logic.":[12],"distinguish":[14],"two":[15],"variants":[16],"problem:":[19],"one":[20,26],"for":[21,27,45,52],"strict":[23,56],"and":[24],"another":[25],"lax":[29],"semantics.":[30],"Both":[31],"problems":[32,54],"turn":[33],"out":[34],"to":[35],"be":[36,59],"EXPTIME-complete":[37],"on":[38],"general":[39],"structures.":[40],"Finally,":[41],"we":[42],"show":[43],"how":[44],"a":[46],"specific":[47],"class":[48],"structures":[50],"NEXPTIME-completeness":[51],"these":[53],"under":[55],"semantics":[57],"can":[58],"achieved.":[60]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}