{"id":"https://openalex.org/W2044558209","doi":"https://doi.org/10.1142/s0129054110007258","title":"THE COMPLEXITY OF MODEL CHECKING FOR BOOLEAN FORMULAS","display_name":"THE COMPLEXITY OF MODEL CHECKING FOR BOOLEAN FORMULAS","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2044558209","doi":"https://doi.org/10.1142/s0129054110007258","mag":"2044558209"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054110007258","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054110007258","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":"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/A5109427518","display_name":"Henning Schnoor","orcid":null},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"HENNING SCHNOOR","raw_affiliation_strings":["Institut f\u00fcr Informatik, Christian-Albrechts-Universit\u00e4t Kiel, Christian-Albrechts-Platz 4, D-24118 Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Christian-Albrechts-Universit\u00e4t Kiel, Christian-Albrechts-Platz 4, D-24118 Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109427518"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":null,"apc_paid":null,"fwci":3.3453,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.9201827,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"21","issue":"03","first_page":"289","last_page":"309"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.994700014591217,"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/T11567","display_name":"semigroups and automata theory","score":0.9890000224113464,"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/modulo","display_name":"Modulo","score":0.6899159550666809},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6763474941253662},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6061328649520874},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5846260190010071},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.5507538914680481},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5191304087638855},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5006539821624756},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.48447489738464355},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.4749577045440674},{"id":"https://openalex.org/keywords/product-term","display_name":"Product term","score":0.4585224986076355},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.4437021017074585},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.43620920181274414},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42526745796203613},{"id":"https://openalex.org/keywords/two-element-boolean-algebra","display_name":"Two-element Boolean algebra","score":0.2667868733406067},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2602313160896301},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.23271280527114868},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.10180479288101196}],"concepts":[{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.6899159550666809},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6763474941253662},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6061328649520874},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5846260190010071},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.5507538914680481},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5191304087638855},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5006539821624756},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.48447489738464355},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.4749577045440674},{"id":"https://openalex.org/C9429942","wikidata":"https://www.wikidata.org/wiki/Q1781698","display_name":"Product term","level":5,"score":0.4585224986076355},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4437021017074585},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.43620920181274414},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42526745796203613},{"id":"https://openalex.org/C207764348","wikidata":"https://www.wikidata.org/wiki/Q7858706","display_name":"Two-element Boolean algebra","level":4,"score":0.2667868733406067},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2602313160896301},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.23271280527114868},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.10180479288101196},{"id":"https://openalex.org/C169171071","wikidata":"https://www.wikidata.org/wiki/Q5449241","display_name":"Filtered algebra","level":3,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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.1142/s0129054110007258","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054110007258","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7799999713897705}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1997129529","https://openalex.org/W2052936500","https://openalex.org/W2055594799","https://openalex.org/W2082723133","https://openalex.org/W2158800868","https://openalex.org/W2175195593","https://openalex.org/W2951449870","https://openalex.org/W3082353674","https://openalex.org/W4210321366"],"related_works":["https://openalex.org/W3141532631","https://openalex.org/W2037737738","https://openalex.org/W2376964534","https://openalex.org/W2131164334","https://openalex.org/W2516690985","https://openalex.org/W1996276855","https://openalex.org/W1505060907","https://openalex.org/W2996462315","https://openalex.org/W2187008505","https://openalex.org/W4252281389"],"abstract_inverted_index":{"We":[0,29],"examine":[1],"the":[2,5,14,32,44,49,79],"complexity":[3,33],"of":[4,34,43,78],"model":[6,58],"checking":[7,59],"problem":[8,36,60],"for":[9,64,75],"Boolean":[10,20],"formulas,":[11],"which":[12],"is":[13,37,61],"following":[15],"decision":[16],"problem:":[17],"Given":[18],"a":[19,53,76],"formula":[21,57],"without":[22],"variables,":[23],"does":[24],"it":[25],"evaluate":[26],"to":[27,47,69],"true?":[28],"show":[30],"that":[31],"this":[35],"determined":[38],"by":[39],"certain":[40],"closure":[41],"properties":[42],"connectives":[45],"allowed":[46],"build":[48],"formula,":[50],"and":[51],"achieve":[52],"complete":[54,63,74],"classification:":[55],"The":[56],"either":[62],"NC":[65],"1":[66],",":[67],"equivalent":[68],"counting":[70],"modulo":[71],"2,":[72],"or":[73],"level":[77],"logarithmic":[80],"time":[81],"hierarchy":[82],"under":[83],"very":[84],"strict":[85],"reductions.":[86]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}