{"id":"https://openalex.org/W2102886905","doi":"https://doi.org/10.1109/lics.2003.1210060","title":"Satisfiability in alternating-time temporal logic","display_name":"Satisfiability in alternating-time temporal logic","publication_year":2003,"publication_date":"2003-12-22","ids":{"openalex":"https://openalex.org/W2102886905","doi":"https://doi.org/10.1109/lics.2003.1210060","mag":"2102886905"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2003.1210060","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2003.1210060","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","raw_type":"proceedings-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/A5017572366","display_name":"Govert van Drimmelen","orcid":null},"institutions":[{"id":"https://openalex.org/I24027795","display_name":"University of Johannesburg","ror":"https://ror.org/04z6c2n17","country_code":"ZA","type":"education","lineage":["https://openalex.org/I24027795"]}],"countries":["ZA"],"is_corresponding":true,"raw_author_name":"G. van Drimmelen","raw_affiliation_strings":["Department of Mathematics, Rand Afrikaans University, Johannesburg, South Africa","Dept. of Math., Rand Afrikaans Univ., Johannesburg, South Africa"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Rand Afrikaans University, Johannesburg, South Africa","institution_ids":[]},{"raw_affiliation_string":"Dept. of Math., Rand Afrikaans Univ., Johannesburg, South Africa","institution_ids":["https://openalex.org/I24027795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5017572366"],"corresponding_institution_ids":["https://openalex.org/I24027795"],"apc_list":null,"apc_paid":null,"fwci":3.9003,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.94013453,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"208","last_page":"217"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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.9995999932289124,"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.9993000030517578,"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/temporal-logic","display_name":"Temporal logic","score":0.7433791160583496},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.7150385975837708},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7097962498664856},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6517941355705261},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6119849681854248},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.5990273356437683},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.5823518633842468},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5816618800163269},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5319286584854126},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.5166916847229004},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5089054107666016},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5087302327156067},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4889642000198364},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4547540247440338},{"id":"https://openalex.org/keywords/exptime","display_name":"EXPTIME","score":0.43714290857315063},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4343884289264679},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.42533713579177856},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.41749900579452515},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41363561153411865},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3465127944946289},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.2590547800064087},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19861170649528503},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.18836423754692078}],"concepts":[{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.7433791160583496},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.7150385975837708},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7097962498664856},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6517941355705261},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6119849681854248},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.5990273356437683},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.5823518633842468},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5816618800163269},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5319286584854126},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.5166916847229004},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5089054107666016},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5087302327156067},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4889642000198364},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4547540247440338},{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.43714290857315063},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4343884289264679},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.42533713579177856},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.41749900579452515},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41363561153411865},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3465127944946289},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2590547800064087},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19861170649528503},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.18836423754692078},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"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":1,"locations":[{"id":"doi:10.1109/lics.2003.1210060","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2003.1210060","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8100000023841858,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1500928105","https://openalex.org/W1582438979","https://openalex.org/W1612453857","https://openalex.org/W1976043843","https://openalex.org/W1988808695","https://openalex.org/W2023808162","https://openalex.org/W2048905609","https://openalex.org/W2109058602","https://openalex.org/W2160254449","https://openalex.org/W2170234080","https://openalex.org/W2546438959","https://openalex.org/W4285719527","https://openalex.org/W6630074841","https://openalex.org/W6634824088","https://openalex.org/W6644450621","https://openalex.org/W6684967763"],"related_works":["https://openalex.org/W1532447905","https://openalex.org/W858755136","https://openalex.org/W1981889059","https://openalex.org/W3005864166","https://openalex.org/W31328628","https://openalex.org/W2798742893","https://openalex.org/W3091862538","https://openalex.org/W4320560294","https://openalex.org/W1986350521","https://openalex.org/W2102886905"],"abstract_inverted_index":{"Alternating-time":[0],"temporal":[1,7],"logic":[2,8],"(ATL)":[3],"is":[4,67,91,97,109],"a":[5,68,77,80,105,115],"branching-time":[6],"that":[9,63,76,89],"naturally":[10],"describes":[11],"computations":[12],"of":[13,28,83,107,125],"multi-agent":[14],"distributed":[15],"systems":[16],"and":[17,121],"multi-player":[18],"games.":[19],"In":[20],"particular,":[21],"ATL":[22,48,90,120],"explicitly":[23],"allows":[24],"for":[25,40,47,53,73],"the":[26,44,50,54,99],"expression":[27],"coalitional":[29],"ability":[30],"in":[31,79,93,103,128],"such":[32],"situations.":[33],"We":[34],"present":[35],"an":[36,123],"automata-based":[37],"decision":[38],"procedure":[39],"ATL,":[41,74,108],"by":[42],"translating":[43],"satisfiability":[45,102],"problem":[46,52],"to":[49],"nonemptiness":[51],"alternating":[55],"automata":[56,129],"on":[57],"infinite":[58],"trees.":[59],"The":[60,111],"key":[61],"result":[62],"enables":[64],"this":[65],"translation":[66],"bounded-branching":[69],"tree":[70,81],"model":[71,82],"theorem":[72],"proving":[75],"satisfiable":[78],"bounded":[84],"branching":[85],"degree.":[86],"It":[87],"follows":[88],"decidable":[92],"exponential":[94],"time,":[95],"which":[96],"also":[98],"optimal":[100],"complexity:":[101],"CTL,":[104],"fragment":[106],"EXPTIME-complete.":[110],"paper":[112],"thus":[113],"answers":[114],"fundamental":[116],"logical":[117],"question":[118],"about":[119],"provides":[122],"example":[124],"how":[126],"alternation":[127],"may":[130],"elegantly":[131],"express":[132],"game-like":[133],"transitions.":[134]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}