{"id":"https://openalex.org/W2903954122","doi":"https://doi.org/10.1609/aaai.v33i01.33012638","title":"Satisfiability in Strategy Logic Can Be Easier than Model Checking","display_name":"Satisfiability in Strategy Logic Can Be Easier than Model Checking","publication_year":2019,"publication_date":"2019-07-17","ids":{"openalex":"https://openalex.org/W2903954122","doi":"https://doi.org/10.1609/aaai.v33i01.33012638","mag":"2903954122"},"language":"en","primary_location":{"id":"doi:10.1609/aaai.v33i01.33012638","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v33i01.33012638","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/4112/3990","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojs.aaai.org/index.php/AAAI/article/download/4112/3990","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042454545","display_name":"Erman Acar","orcid":"https://orcid.org/0000-0001-7541-2999"},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Erman Acar","raw_affiliation_strings":["Vrije Universiteit Amsterdam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Vrije Universiteit Amsterdam","institution_ids":["https://openalex.org/I865915315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048258273","display_name":"Massimo Benerecetti","orcid":"https://orcid.org/0000-0003-4664-6061"},"institutions":[{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Massimo Benerecetti","raw_affiliation_strings":["Universit\u00e0 degli Studi di Napoli Federico II"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 degli Studi di Napoli Federico II","institution_ids":["https://openalex.org/I71267560"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052215915","display_name":"Fabio Mogavero","orcid":"https://orcid.org/0000-0002-5140-5783"},"institutions":[{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Fabio Mogavero","raw_affiliation_strings":["Universit\u00e0 degli Studi di Napoli Federico II"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 degli Studi di Napoli Federico II","institution_ids":["https://openalex.org/I71267560"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6648,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.75257558,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"33","issue":"01","first_page":"2638","last_page":"2645"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9904000163078308,"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.9904000163078308,"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.9869999885559082,"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/T11182","display_name":"Auction Theory and Applications","score":0.9760000109672546,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.8324703574180603},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7450594305992126},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.7212604880332947},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7007306218147278},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6425682902336121},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5968754291534424},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.549614667892456},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5469191670417786},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.534845769405365},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5156439542770386},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.4392291009426117},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3230423629283905},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3138946294784546},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3136470317840576},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3084859848022461}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8324703574180603},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7450594305992126},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.7212604880332947},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7007306218147278},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6425682902336121},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5968754291534424},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.549614667892456},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5469191670417786},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.534845769405365},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5156439542770386},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4392291009426117},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3230423629283905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3138946294784546},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3136470317840576},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3084859848022461}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1609/aaai.v33i01.33012638","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v33i01.33012638","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/4112/3990","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:research.vu.nl:publications/247edc0b-0733-419c-a4a3-083de52374e5","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/247edc0b-0733-419c-a4a3-083de52374e5","pdf_url":"https://research.vu.nl/en/publications/247edc0b-0733-419c-a4a3-083de52374e5","source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Acar , E , Benerecetti , M & Mogavero , F 2019 , ' Satisfiability in Strategy Logic Can Be Easier than Model Checking ' , Proceedings of the AAAI Conference on Artificial Intelligence , vol. 33 , no. 1 , pp. 2638-2645 . https://doi.org/10.1609/aaai.v33i01.33012638","raw_type":"article"},{"id":"pmh:oai:ojs.aaai.org:article/4112","is_oa":false,"landing_page_url":"https://ojs.aaai.org/index.php/AAAI/article/view/4112","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2159-5399","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:vu:oai:research.vu.nl:publications/63c7e83a-b52b-4b23-8fe2-330453321bf0","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/63c7e83a-b52b-4b23-8fe2-330453321bf0","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence, 33, 2638 - 2645","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1609/aaai.v33i01.33012638","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v33i01.33012638","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/4112/3990","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7900000214576721,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G4490847993","display_name":"MaestroGraph: The Meaning and Structure of Very Large Knowledge Graphs","funder_award_id":"612.001.552","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2903954122.pdf","grobid_xml":"https://content.openalex.org/works/W2903954122.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W97887531","https://openalex.org/W185780771","https://openalex.org/W187081080","https://openalex.org/W1501731334","https://openalex.org/W1566513654","https://openalex.org/W1613221887","https://openalex.org/W1859095875","https://openalex.org/W1976540310","https://openalex.org/W1988808695","https://openalex.org/W1992762998","https://openalex.org/W2003227046","https://openalex.org/W2018794476","https://openalex.org/W2023808162","https://openalex.org/W2026209850","https://openalex.org/W2033071128","https://openalex.org/W2104974242","https://openalex.org/W2124110813","https://openalex.org/W2251308061","https://openalex.org/W2271301048","https://openalex.org/W2395270758","https://openalex.org/W2473183186","https://openalex.org/W2559113132","https://openalex.org/W2743286910","https://openalex.org/W2952842534","https://openalex.org/W2986444891","https://openalex.org/W4236652038","https://openalex.org/W4251307572","https://openalex.org/W4295744948","https://openalex.org/W4298268148","https://openalex.org/W4312534390","https://openalex.org/W6607599517","https://openalex.org/W6633882847","https://openalex.org/W6644458159","https://openalex.org/W6651463537","https://openalex.org/W6656255003","https://openalex.org/W6658842655","https://openalex.org/W6676468133","https://openalex.org/W6688750559","https://openalex.org/W6691719732","https://openalex.org/W6693928430","https://openalex.org/W6758525803","https://openalex.org/W6758942667","https://openalex.org/W6758960577","https://openalex.org/W6813096674"],"related_works":["https://openalex.org/W1880816751","https://openalex.org/W1543051890","https://openalex.org/W2585890227","https://openalex.org/W2995528133","https://openalex.org/W2167135424","https://openalex.org/W1523732197","https://openalex.org/W3209871473","https://openalex.org/W2056142535","https://openalex.org/W2584881689","https://openalex.org/W2903954122"],"abstract_inverted_index":{"In":[0,56],"the":[1,18,40,49,61,64,91,102,126,160,191,194],"design":[2],"of":[3,71,94,128,144,150,186,190,196,205],"complex":[4],"systems,":[5,146],"model-checking":[6,16,112,176],"and":[7,152],"satisfiability":[8,26,167,195],"arise":[9],"as":[10,148,155,157],"two":[11,65],"prominent":[12],"decision":[13],"problems.":[14],"While":[15],"requires":[17],"designed":[19],"system":[20,33],"to":[21,28,45,87,107,139,158],"be":[22,46,108],"provided":[23],"in":[24,96],"advance,":[25],"allows":[27],"check":[29],"if":[30],"such":[31,147,169],"a":[32,53,68,97,170,200],"even":[34],"exists.":[35],"With":[36],"very":[37],"few":[38],"exceptions,":[39],"second":[41],"problem":[42,192],"turns":[43],"out":[44],"harder":[47],"than":[48],"first":[50],"one":[51],"from":[52],"complexity-theoretic":[54],"standpoint.":[55],"this":[57],"paper,":[58],"we":[59,117],"investigate":[60],"connection":[62],"between":[63],"problems":[66],"for":[67,75,101,168],"non-trivial":[69],"fragment":[70,116,171,204],"Strategy":[72],"Logic":[73],"(SL,":[74],"short).":[76],"SL":[77,115],"extends":[78],"LTL":[79],"with":[80],"first-order":[81,198,206],"quantifications":[82,124],"over":[83],"strategies,":[84],"thus":[85],"allowing":[86,138],"explicitly":[88],"reason":[89],"about":[90],"strategic":[92,123],"abilities":[93],"agents":[95],"multi-agent":[98,145],"system.":[99],"Satisfiability":[100],"full":[103],"logic":[104,133],"is":[105,113,119,134,172,178,182],"known":[106],"highly":[109],"undecidable,":[110],"while":[111,174],"non-elementary.The":[114],"consider":[118],"obtained":[120,183],"by":[121,184],"preventing":[122],"within":[125],"scope":[127],"temporal":[129],"operators.":[130],"The":[131,180],"resulting":[132],"quite":[135],"powerful,":[136],"still":[137],"express":[140],"important":[141],"game-theoretic":[142],"properties":[143],"existence":[149],"Nash":[151],"immune":[153],"equilibria,":[154],"well":[156],"formalize":[159],"rational":[161],"synthesis":[162],"problem.":[163],"We":[164],"show":[165],"that":[166],"PSPACE-COMPLETE,":[173],"its":[175],"complexity":[177],"2EXPTIME-HARD.":[179],"result":[181],"means":[185],"an":[187],"elegant":[188],"encoding":[189],"into":[193],"conjunctive-binding":[197],"logic,":[199],"recently":[201],"discovered":[202],"decidable":[203],"logic.":[207]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-06-22T08:00:12.763002","created_date":"2025-10-10T00:00:00"}