{"id":"https://openalex.org/W1843567604","doi":"https://doi.org/10.1142/s0129054118500028","title":"Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic","display_name":"Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W1843567604","doi":"https://doi.org/10.1142/s0129054118500028","mag":"1843567604"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054118500028","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054118500028","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1510.08786","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":["Institut f\u00fcr Theoretische Informatik, Gottfried Wilhelm Leibniz Universit\u00e4t, Appelstra\u00dfe 4, 30167 Hannover, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik, Gottfried Wilhelm Leibniz Universit\u00e4t, Appelstra\u00dfe 4, 30167 Hannover, 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.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00567776,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"29","issue":"01","first_page":"17","last_page":"61"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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/T11567","display_name":"semigroups and automata theory","score":0.9957000017166138,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.9273094534873962},{"id":"https://openalex.org/keywords/ctl*","display_name":"CTL*","score":0.7913818359375},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.7028420567512512},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6489114761352539},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5996687412261963},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5622079372406006},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.5510901212692261},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.54108726978302},{"id":"https://openalex.org/keywords/nesting","display_name":"Nesting (process)","score":0.5292103886604309},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5291160941123962},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5119960904121399},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.5071604251861572},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.4965549111366272},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.4756966531276703},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47000035643577576},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4266379177570343},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42069023847579956},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41015052795410156},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3643474578857422},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3307880163192749},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2506796717643738}],"concepts":[{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.9273094534873962},{"id":"https://openalex.org/C147969180","wikidata":"https://www.wikidata.org/wiki/Q5014579","display_name":"CTL*","level":4,"score":0.7913818359375},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.7028420567512512},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6489114761352539},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5996687412261963},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5622079372406006},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.5510901212692261},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.54108726978302},{"id":"https://openalex.org/C2776937656","wikidata":"https://www.wikidata.org/wiki/Q2229669","display_name":"Nesting (process)","level":2,"score":0.5292103886604309},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5291160941123962},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5119960904121399},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.5071604251861572},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.4965549111366272},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.4756966531276703},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47000035643577576},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4266379177570343},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42069023847579956},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41015052795410156},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3643474578857422},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3307880163192749},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2506796717643738},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"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/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"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/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C191897082","wikidata":"https://www.wikidata.org/wiki/Q11467","display_name":"Metallurgy","level":1,"score":0.0},{"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/C202751555","wikidata":"https://www.wikidata.org/wiki/Q221681","display_name":"In vitro","level":2,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1142/s0129054118500028","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054118500028","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1510.08786","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1510.08786","pdf_url":"https://arxiv.org/pdf/1510.08786","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":"mag:1843567604","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1510.08786.pdf","pdf_url":null,"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":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1510.08786","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1510.08786","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1510.08786","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1510.08786","pdf_url":"https://arxiv.org/pdf/1510.08786","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1843567604.pdf","grobid_xml":"https://content.openalex.org/works/W1843567604.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1504635498","https://openalex.org/W1612453857","https://openalex.org/W1967362250","https://openalex.org/W1997716585","https://openalex.org/W2003227046","https://openalex.org/W2004306067","https://openalex.org/W2023808162","https://openalex.org/W2026379532","https://openalex.org/W2036265926","https://openalex.org/W2067441543","https://openalex.org/W2068728923","https://openalex.org/W2069709605","https://openalex.org/W2073491323","https://openalex.org/W2082723133","https://openalex.org/W2091470957","https://openalex.org/W2117189826","https://openalex.org/W2160811334","https://openalex.org/W2949521423","https://openalex.org/W4212992501","https://openalex.org/W4241108585"],"related_works":["https://openalex.org/W2962838432","https://openalex.org/W2041403185","https://openalex.org/W2401679980","https://openalex.org/W2799335769","https://openalex.org/W1534420134","https://openalex.org/W2008796796","https://openalex.org/W3154865557","https://openalex.org/W1579865136","https://openalex.org/W2752971683","https://openalex.org/W2003216212","https://openalex.org/W1676460682","https://openalex.org/W2027602125","https://openalex.org/W2132914818","https://openalex.org/W3102693153","https://openalex.org/W1534782707","https://openalex.org/W2909742694","https://openalex.org/W2058566227","https://openalex.org/W1600636537","https://openalex.org/W129930684","https://openalex.org/W2165930340"],"abstract_inverted_index":{"The":[0],"satisfiability":[1],"problem":[2],"of":[3,13,40,63],"the":[4,30],"branching":[5],"time":[6],"logic":[7],"CTL":[8,44],"is":[9,34,45,59,79],"studied":[10,35],"in":[11,61],"terms":[12,62],"computational":[14],"complexity.":[15],"Tight":[16],"upper":[17],"and":[18,65],"lower":[19],"bounds":[20],"are":[21],"provided":[22],"for":[23],"each":[24],"temporal":[25,52,76],"operator":[26,53],"fragment.":[27],"In":[28],"parallel,":[29],"minimal":[31,66],"model":[32],"size":[33],"with":[36,49],"a":[37],"suitable":[38],"notion":[39],"minimality.":[41],"Thirdly,":[42],"flat":[43],"investigated,":[46],"i.e.,":[47],"formulas":[48],"very":[50],"low":[51,72],"nesting":[54],"depth.":[55],"A":[56],"sharp":[57],"dichotomy":[58],"shown":[60],"complexity":[64],"models:":[67],"Temporal":[68],"depth":[69,77],"one":[70],"has":[71],"expressive":[73],"power,":[74],"while":[75],"two":[78],"equivalent":[80],"to":[81],"full":[82],"CTL.":[83]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-03-21T08:13:44.787528","created_date":"2016-10-28T00:00:00"}