{"id":"https://openalex.org/W2076137686","doi":"https://doi.org/10.1016/s1571-0661(05)82544-7","title":"Symbolic Computational Techniques for Solving Games","display_name":"Symbolic Computational Techniques for Solving Games","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2076137686","doi":"https://doi.org/10.1016/s1571-0661(05)82544-7","mag":"2076137686"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)82544-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)82544-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(05)82544-7","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112870293","display_name":"P. Madhusudan","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"P. Madhusudan","raw_affiliation_strings":["#N#               * University of Pennsylvania"],"affiliations":[{"raw_affiliation_string":"#N#               * University of Pennsylvania","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032801269","display_name":"Wonhong Nam","orcid":"https://orcid.org/0000-0003-1450-347X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Wonhong Nam","raw_affiliation_strings":["#N#               * University of Pennsylvania"],"affiliations":[{"raw_affiliation_string":"#N#               * University of Pennsylvania","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065059795","display_name":"Rajeev Alur","orcid":"https://orcid.org/0000-0003-1733-7083"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rajeev Alur","raw_affiliation_strings":["Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, USA","Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, USA ("],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I79576946"]},{"raw_affiliation_string":"Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, USA (","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032801269","https://openalex.org/A5065059795","https://openalex.org/A5112870293"],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":null,"apc_paid":null,"fwci":1.0637,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.77202915,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"89","issue":"4","first_page":"578","last_page":"592"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9987000226974487,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/reduction","display_name":"Reduction (mathematics)","score":0.6912930607795715},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.6311916708946228},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.6044114828109741},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5628350377082825},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.548661470413208},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5460786819458008},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5310400128364563},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.48943081498146057},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4521293342113495},{"id":"https://openalex.org/keywords/substitution","display_name":"Substitution (logic)","score":0.42130881547927856},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40595000982284546},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36214423179626465},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.16018328070640564}],"concepts":[{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6912930607795715},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.6311916708946228},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.6044114828109741},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5628350377082825},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.548661470413208},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5460786819458008},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5310400128364563},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.48943081498146057},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4521293342113495},{"id":"https://openalex.org/C2778220771","wikidata":"https://www.wikidata.org/wiki/Q1522579","display_name":"Substitution (logic)","level":2,"score":0.42130881547927856},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40595000982284546},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36214423179626465},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16018328070640564},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s1571-0661(05)82544-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)82544-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(05)82544-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)82544-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.7799999713897705,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W113173227","https://openalex.org/W240055707","https://openalex.org/W1485489137","https://openalex.org/W1501554968","https://openalex.org/W1503170978","https://openalex.org/W1530308835","https://openalex.org/W1534335973","https://openalex.org/W1553278548","https://openalex.org/W1596365597","https://openalex.org/W1639370926","https://openalex.org/W1787074469","https://openalex.org/W1836852804","https://openalex.org/W2005573219","https://openalex.org/W2025063099","https://openalex.org/W2048905609","https://openalex.org/W2059057465","https://openalex.org/W2075959177","https://openalex.org/W2080267935","https://openalex.org/W2135989067","https://openalex.org/W2142785340","https://openalex.org/W2151398141","https://openalex.org/W2167452021","https://openalex.org/W2913425508","https://openalex.org/W3098378096","https://openalex.org/W4247585869","https://openalex.org/W6631745765","https://openalex.org/W6632082368","https://openalex.org/W6635889333","https://openalex.org/W6638020115","https://openalex.org/W7020825883"],"related_works":["https://openalex.org/W2803843036","https://openalex.org/W2542904743","https://openalex.org/W2471151559","https://openalex.org/W1561659860","https://openalex.org/W3176904788","https://openalex.org/W2611966366","https://openalex.org/W1583869287","https://openalex.org/W2584649593","https://openalex.org/W2348129335","https://openalex.org/W21597398"],"abstract_inverted_index":{"Games":[0],"are":[1],"useful":[2],"in":[3],"modular":[4],"specification":[5],"and":[6,24,35,53,68,129,141],"analysis":[7],"of":[8,44,58,90,109,125],"systems":[9],"where":[10],"the":[11,14,22,54,59,88,107,114,138,155],"distinction":[12],"among":[13],"choices":[15],"controlled":[16],"by":[17,104,121],"different":[18],"components":[19],"(for":[20],"instance,":[21],"system":[23],"its":[25],"environment)":[26],"is":[27,50,57],"made":[28],"explicit.":[29],"In":[30],"this":[31],"paper,":[32],"we":[33,130],"formulate":[34],"compare":[36,154],"various":[37,156],"symbolic":[38,74],"computational":[39],"techniques":[40],"for":[41,64,87,98,149],"deciding":[42],"existence":[43,89],"winning":[45,55,94],"strategies.":[46],"The":[47,70,83],"game":[48],"structure":[49],"given":[51],"implicitly,":[52],"condition":[56],"form":[60],"\u201cp":[61],"until":[62],"q\u201d":[63],"state":[65],"predicates":[66],"p":[67],"q.":[69],"first":[71],"technique":[72,85],"employs":[73],"fixpoint":[75],"computation":[76],"using":[77,161],"ordered":[78],"binary":[79],"decision":[80],"diagrams":[81],"[8].":[82],"second":[84],"checks":[86],"strategies":[91],"that":[92],"ensure":[93],"within":[95],"k":[96],"steps,":[97],"a":[99,146],"user":[100],"specified":[101],"bound":[102],"k,":[103],"reduction":[105,122,150],"to":[106,123,151],"satisfiability":[108,124],"quantified":[110],"boolean":[111,127],"formulas.":[112],"Finally,":[113],"bounded":[115],"case":[116],"can":[117],"also":[118],"be":[119],"solved":[120],"ordinary":[126],"formulas,":[128],"discuss":[131],"two":[132,159],"techniques,":[133],"one":[134,142],"based":[135,143],"on":[136,144,158],"encoding":[137,145],"strategy":[139],"tree,":[140],"witness":[147],"subgraph,":[148],"SAT.":[152],"We":[153],"approaches":[157],"examples":[160],"existing":[162],"tools":[163],"such":[164],"as":[165],"Mocha":[166],"[3],":[167],"Mucke":[168],"[7],":[169],"Semprop":[170],"[17],":[171],"Qube":[172],"[11],":[173],"Berkmin":[174],"[12].":[175]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}