{"id":"https://openalex.org/W2795570893","doi":"https://doi.org/10.23638/lmcs-15(2:2)2019","title":"Canonical Models and the Complexity of Modal Team Logic","display_name":"Canonical Models and the Complexity of Modal Team Logic","publication_year":2019,"publication_date":"2019-04-11","ids":{"openalex":"https://openalex.org/W2795570893","doi":"https://doi.org/10.23638/lmcs-15(2:2)2019","mag":"2795570893"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-15(2:2)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(2:2)2019","pdf_url":"https://lmcs.episciences.org/5370/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/5370/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062261702","display_name":"Martin L\u00fcck","orcid":null},"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":true,"raw_author_name":"Martin L\u00fcck","raw_affiliation_strings":["Leibniz University Hannover, Hanover, Germany"],"affiliations":[{"raw_affiliation_string":"Leibniz University Hannover, Hanover, Germany","institution_ids":["https://openalex.org/I114112103"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062261702"],"corresponding_institution_ids":["https://openalex.org/I114112103"],"apc_list":null,"apc_paid":null,"fwci":0.7233,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.77578538,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"Volume 15, Issue 2","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.995199978351593,"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.995199978351593,"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9896000027656555,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9785000085830688,"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/modal-logic","display_name":"Modal logic","score":0.6641330718994141},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6332419514656067},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.5692129731178284},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5522913932800293},{"id":"https://openalex.org/keywords/multimodal-logic","display_name":"Multimodal logic","score":0.5464864373207092},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.509971022605896},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.4877922832965851},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4745384454727173},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.47139862179756165},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4672159254550934},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4578063189983368},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4479517340660095},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.44041168689727783},{"id":"https://openalex.org/keywords/normal-modal-logic","display_name":"Normal modal logic","score":0.4368622899055481},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.43331417441368103},{"id":"https://openalex.org/keywords/accessibility-relation","display_name":"Accessibility relation","score":0.42218726873397827},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3917122185230255},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.2195104956626892},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09659036993980408}],"concepts":[{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.6641330718994141},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6332419514656067},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.5692129731178284},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5522913932800293},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.5464864373207092},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.509971022605896},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.4877922832965851},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4745384454727173},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.47139862179756165},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4672159254550934},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4578063189983368},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4479517340660095},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.44041168689727783},{"id":"https://openalex.org/C114092440","wikidata":"https://www.wikidata.org/wiki/Q840226","display_name":"Normal modal logic","level":4,"score":0.4368622899055481},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.43331417441368103},{"id":"https://openalex.org/C11191006","wikidata":"https://www.wikidata.org/wiki/Q2663311","display_name":"Accessibility relation","level":4,"score":0.42218726873397827},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3917122185230255},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.2195104956626892},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09659036993980408},{"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.23638/lmcs-15(2:2)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(2:2)2019","pdf_url":"https://lmcs.episciences.org/5370/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:9697","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.30","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:arXiv.org:1709.05253","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1709.05253","pdf_url":"https://arxiv.org/pdf/1709.05253","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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"},{"id":"doi:10.4230/lipics.csl.2018.30","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.csl.2018.30","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"doi:10.23638/lmcs-15(2:2)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(2:2)2019","pdf_url":"https://lmcs.episciences.org/5370/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.800000011920929,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2795570893.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2950681618","https://openalex.org/W2048592740","https://openalex.org/W2143042096","https://openalex.org/W2287532945","https://openalex.org/W2343671770","https://openalex.org/W1498755214","https://openalex.org/W2568815622","https://openalex.org/W2949067431","https://openalex.org/W338087933","https://openalex.org/W1571267585","https://openalex.org/W1999165408","https://openalex.org/W1721572253","https://openalex.org/W2161518325","https://openalex.org/W1492684518","https://openalex.org/W1560883166","https://openalex.org/W1495080122","https://openalex.org/W187636597","https://openalex.org/W2072934838","https://openalex.org/W2522715943","https://openalex.org/W2133922504"],"abstract_inverted_index":{"We":[0,128],"study":[1],"modal":[2,10,21,138,166],"team":[3],"logic":[4,11],"MTL,":[5],"the":[6,32,36,56,62,73,91,132,143,146,165,169,175],"team-semantical":[7,63],"extension":[8],"of":[9,39,58,67,76,106,123,134,145,164,177],"ML":[12],"closed":[13],"under":[14],"Boolean":[15,34],"negation.":[16],"Its":[17],"fragments,":[18],"such":[19,68],"as":[20,125],"dependence,":[22],"independence,":[23],"and":[24,115,121,168,172,179],"inclusion":[25],"logic,":[26],"are":[27,140],"well-understood.":[28],"However,":[29],"due":[30],"to":[31,46,78,100],"unrestricted":[33],"negation,":[35],"satisfiability":[37,74,120],"problem":[38,75],"full":[40],"MTL":[41,77,124,135],"has":[42],"been":[43],"notoriously":[44],"resistant":[45],"a":[47,69,110],"complexity":[48,112],"theoretical":[49],"classification.":[50],"In":[51],"our":[52],"approach,":[53],"we":[54,71,83,108],"introduce":[55,109],"notion":[57],"canonical":[59],"models":[60],"into":[61],"setting.":[64],"By":[65],"construction":[66],"model,":[70],"reduce":[72],"simple":[79],"model":[80],"checking.":[81],"Afterwards,":[82],"show":[84],"that":[85,93,117,131],"this":[86],"approach":[87],"is":[88],"optimal":[89],"in":[90,104],"sense":[92],"MTL-formulas":[94],"can":[95],"efficiently":[96],"enforce":[97],"canonicity.":[98],"Furthermore,":[99],"capture":[101],"these":[102],"results":[103,156],"terms":[105],"complexity,":[107],"non-elementary":[111],"class,":[113],"TOWER(poly),":[114],"prove":[116,130],"it":[118],"contains":[119],"validity":[122],"complete":[126,141],"problems.":[127],"also":[129,173],"fragments":[133],"with":[136],"bounded":[137],"depth":[139],"for":[142,158],"levels":[144],"elementary":[147],"hierarchy":[148],"(with":[149],"polynomially":[150],"many":[151],"alternations).":[152],"The":[153],"respective":[154],"hardness":[155],"hold":[157],"both":[159],"strict":[160],"or":[161],"lax":[162],"semantics":[163],"operators":[167],"splitting":[170],"disjunction,":[171],"over":[174],"class":[176],"reflexive":[178],"transitive":[180],"frames.":[181]},"counts_by_year":[{"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},{"year":2019,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}