{"id":"https://openalex.org/W2043154866","doi":"https://doi.org/10.1007/s00165-011-0193-4","title":"A tableau-based decision procedure for CTL*","display_name":"A tableau-based decision procedure for CTL*","publication_year":2011,"publication_date":"2011-08-09","ids":{"openalex":"https://openalex.org/W2043154866","doi":"https://doi.org/10.1007/s00165-011-0193-4","mag":"2043154866"},"language":"en","primary_location":{"id":"doi:10.1007/s00165-011-0193-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-011-0193-4","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-011-0193-4","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-011-0193-4","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036930915","display_name":"Mark Reynolds","orcid":"https://orcid.org/0000-0002-5415-0544"},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"The University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Mark Reynolds","raw_affiliation_strings":["CSSE, The University of Western Australia (UWA), M002, Stirling Highway, 6009, Crawley, WA, Australia","CSSE, The University of Western Australia (UWA), M002, Stirling Highway, 6009, Crawley, WA, Australia#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CSSE, The University of Western Australia (UWA), M002, Stirling Highway, 6009, Crawley, WA, Australia","institution_ids":["https://openalex.org/I177877127"]},{"raw_affiliation_string":"CSSE, The University of Western Australia (UWA), M002, Stirling Highway, 6009, Crawley, WA, Australia#TAB#","institution_ids":["https://openalex.org/I177877127"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5036930915"],"corresponding_institution_ids":["https://openalex.org/I177877127"],"apc_list":{"value":2780,"currency":"USD","value_usd":2780},"apc_paid":null,"fwci":1.1864,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.78651173,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"23","issue":"6","first_page":"739","last_page":"779"},"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.9994999766349792,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9991999864578247,"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/computer-science","display_name":"Computer science","score":0.66695237159729},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.625182032585144},{"id":"https://openalex.org/keywords/ctl*","display_name":"CTL*","score":0.6199783086776733},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.5839167237281799},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5828829407691956},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.5491556525230408},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5232721567153931},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5104860067367554},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4951767027378082},{"id":"https://openalex.org/keywords/repetition","display_name":"Repetition (rhetorical device)","score":0.46968749165534973},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.46223288774490356},{"id":"https://openalex.org/keywords/dpll-algorithm","display_name":"DPLL algorithm","score":0.43813854455947876},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4199025332927704},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.3252444267272949}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.66695237159729},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.625182032585144},{"id":"https://openalex.org/C147969180","wikidata":"https://www.wikidata.org/wiki/Q5014579","display_name":"CTL*","level":4,"score":0.6199783086776733},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.5839167237281799},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5828829407691956},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.5491556525230408},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5232721567153931},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5104860067367554},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4951767027378082},{"id":"https://openalex.org/C2776141515","wikidata":"https://www.wikidata.org/wiki/Q1274479","display_name":"Repetition (rhetorical device)","level":2,"score":0.46968749165534973},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.46223288774490356},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.43813854455947876},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4199025332927704},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.3252444267272949},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C202751555","wikidata":"https://www.wikidata.org/wiki/Q221681","display_name":"In vitro","level":2,"score":0.0},{"id":"https://openalex.org/C154317977","wikidata":"https://www.wikidata.org/wiki/Q376266","display_name":"Cytotoxic T cell","level":3,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00165-011-0193-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-011-0193-4","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-011-0193-4","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/74c3fc2f-c5cf-4a9f-a495-ed866506f241","is_oa":false,"landing_page_url":"https://research-repository.uwa.edu.au/en/publications/74c3fc2f-c5cf-4a9f-a495-ed866506f241","pdf_url":null,"source":{"id":"https://openalex.org/S4306402523","display_name":"UWA Profiles and Research Repository (University of Western Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177877127","host_organization_name":"The University of Western Australia","host_organization_lineage":["https://openalex.org/I177877127"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Reynolds , M 2011 , ' A tableau-based decision procedure for CTL* ' , FORMAL ASPECTS OF COMPUTING , vol. 23 , no. 6 , pp. 739-779 . https://doi.org/10.1007/s00165-011-0193-4","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s00165-011-0193-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-011-0193-4","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-011-0193-4","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7799999713897705}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2043154866.pdf","grobid_xml":"https://content.openalex.org/works/W2043154866.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W3296631","https://openalex.org/W202022948","https://openalex.org/W1483339275","https://openalex.org/W1497109150","https://openalex.org/W1503002024","https://openalex.org/W1517241109","https://openalex.org/W1525725185","https://openalex.org/W1527982431","https://openalex.org/W1534088363","https://openalex.org/W1539868891","https://openalex.org/W1570374618","https://openalex.org/W1583412304","https://openalex.org/W1590315663","https://openalex.org/W1603255212","https://openalex.org/W1604132373","https://openalex.org/W1612453857","https://openalex.org/W1841579870","https://openalex.org/W1872012219","https://openalex.org/W2004306067","https://openalex.org/W2016206563","https://openalex.org/W2023808162","https://openalex.org/W2048355938","https://openalex.org/W2062458205","https://openalex.org/W2067441543","https://openalex.org/W2072887965","https://openalex.org/W2075664249","https://openalex.org/W2083732130","https://openalex.org/W2084671676","https://openalex.org/W2102548669","https://openalex.org/W2107171883","https://openalex.org/W2127075564","https://openalex.org/W2141139458","https://openalex.org/W2144347980","https://openalex.org/W2146659698","https://openalex.org/W2153737593","https://openalex.org/W2163151383","https://openalex.org/W2163751633","https://openalex.org/W2176705267","https://openalex.org/W2497183712","https://openalex.org/W2607230115","https://openalex.org/W2615078972","https://openalex.org/W2798579874","https://openalex.org/W4285719527","https://openalex.org/W6632308403"],"related_works":["https://openalex.org/W2007316622","https://openalex.org/W2408711288","https://openalex.org/W1024451821","https://openalex.org/W2094368841","https://openalex.org/W858755136","https://openalex.org/W2048447692","https://openalex.org/W2143025323","https://openalex.org/W1981889059","https://openalex.org/W2089119454","https://openalex.org/W4312622265"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"present":[2],"a":[3,59,112],"sound,":[4],"complete":[5],"and":[6,66,80],"implementable":[7],"tableau":[8,56,126],"method":[9],"for":[10,85,92],"deciding":[11],"satisfiability":[12,76],"of":[13,19,70,77,82,125],"formulas":[14,79],"in":[15],"the":[16,26,68,75,123],"propositional":[17],"version":[18],"computation":[20],"tree":[21],"logic":[22,36],"CTL*.":[23,54],"This":[24],"is":[25,31,47,58,90,105,118],"first":[27],"such":[28],"tableau.":[29],"CTL*":[30],"an":[32],"exceptionally":[33],"important":[34],"temporal":[35],"with":[37],"applications":[38],"from":[39],"hardware":[40],"design":[41],"to":[42,53,120],"agent":[43],"reasoning,":[44],"but":[45,100],"there":[46],"no":[48],"easily":[49],"automated":[50],"reasoning":[51],"approach":[52],"The":[55],"here":[57],"traditional":[60],"tree-shaped":[61],"or":[62],"top-down":[63],"style":[64],"tableau,":[65],"affords":[67],"possibility":[69],"reasonably":[71],"quick":[72],"decisions":[73],"on":[74],"medium-sized":[78],"construction":[81],"small":[83],"models":[84],"them.":[86],"A":[87],"straightforward":[88],"subroutine":[89],"given":[91],"determining":[93],"when":[94],"looping":[95],"allows":[96],"successful":[97],"branch":[98],"termination,":[99],"much":[101],"needed":[102,119],"further":[103],"development":[104],"left":[106],"as":[107],"future":[108],"work.":[109],"In":[110],"particular,":[111],"more":[113],"general":[114],"repetition":[115],"prevention":[116],"mechanism":[117],"speed":[121],"up":[122],"task":[124],"construction.":[127]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}