{"id":"https://openalex.org/W2792151209","doi":"https://doi.org/10.3233/sat-231505","title":"The Riis Complexity Gap for QBF Resolution","display_name":"The Riis Complexity Gap for QBF Resolution","publication_year":2024,"publication_date":"2024-10-29","ids":{"openalex":"https://openalex.org/W2792151209","doi":"https://doi.org/10.3233/sat-231505","mag":"2792151209"},"language":"en","primary_location":{"id":"doi:10.3233/sat-231505","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat-231505","pdf_url":null,"source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.3233/sat-231505","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042128349","display_name":"Olaf Beyersdorff","orcid":"https://orcid.org/0000-0002-2870-1648"},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Olaf Beyersdorff","raw_affiliation_strings":["Institute of Computer Science, Friedrich Schiller University Jena, 07743 Jena, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Friedrich Schiller University Jena, 07743 Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053916764","display_name":"Judith Clymo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Judith Clymo","raw_affiliation_strings":["School of Computing, University of Leeds, Leeds LS2 9JT, U.K"],"affiliations":[{"raw_affiliation_string":"School of Computing, University of Leeds, Leeds LS2 9JT, U.K","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038346780","display_name":"Stefan Dantchev","orcid":"https://orcid.org/0000-0003-4534-2242"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stefan Dantchev","raw_affiliation_strings":["Department of Computer Science, University of Durham, Durham DH1 3LE, U.K"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Durham, Durham DH1 3LE, U.K","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013230954","display_name":"Barnaby Martin","orcid":"https://orcid.org/0000-0002-4642-8614"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Barnaby Martin","raw_affiliation_strings":["Department of Computer Science, University of Durham, Durham DH1 3LE, U.K"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Durham, Durham DH1 3LE, U.K","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5042128349"],"corresponding_institution_ids":["https://openalex.org/I76198965"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00092208,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"1","first_page":"9","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11801","display_name":"Reservoir Engineering and Simulation Methods","score":0.8440999984741211,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11801","display_name":"Reservoir Engineering and Simulation Methods","score":0.8440999984741211,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8187999725341797,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.8055999875068665,"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/resolution","display_name":"Resolution (logic)","score":0.5713621377944946},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3888559937477112},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34299713373184204},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10602426528930664}],"concepts":[{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.5713621377944946},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3888559937477112},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34299713373184204},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10602426528930664}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/sat-231505","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat-231505","pdf_url":null,"source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},{"id":"pmh:oai:durham-repository.worktribe.com:3090404","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/3090404","pdf_url":"https://durham-repository.worktribe.com/file/3090404/1/Published%20Journal%20Article","source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"}],"best_oa_location":{"id":"doi:10.3233/sat-231505","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat-231505","pdf_url":null,"source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4794090369","display_name":null,"funder_award_id":"60842","funder_id":"https://openalex.org/F4320306193","funder_display_name":"John Templeton Foundation"}],"funders":[{"id":"https://openalex.org/F4320306193","display_name":"John Templeton Foundation","ror":"https://ror.org/035tnyy05"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W34759408","https://openalex.org/W141966453","https://openalex.org/W1525848078","https://openalex.org/W1851471023","https://openalex.org/W1976876676","https://openalex.org/W2046194288","https://openalex.org/W2051846104","https://openalex.org/W2067510740","https://openalex.org/W2103193591","https://openalex.org/W2112145019","https://openalex.org/W2121015471","https://openalex.org/W2570844665","https://openalex.org/W2726059329","https://openalex.org/W2778491775","https://openalex.org/W2972754151","https://openalex.org/W3014737894","https://openalex.org/W3127382562","https://openalex.org/W3135720677","https://openalex.org/W4362237097","https://openalex.org/W4387148412"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"We":[0],"give":[1],"an":[2],"analogue":[3],"of":[4,29,41],"the":[5,71,86,98,111,118],"Riis":[6],"Complexity":[7],"Gap":[8],"Theorem":[9],"in":[10,34,53,95,110],"Resolution":[11,37],"for":[12,78,97],"Quantified":[13],"Boolean":[14],"Formulas":[15],"(QBFs).":[16],"Every":[17],"first-order":[18],"sentence":[19],"\u03d5":[20,45,56],"without":[21],"finite":[22],"models":[23],"gives":[24],"rise":[25],"to":[26,70,88,102,125],"a":[27,122],"sequence":[28],"QBFs":[30],"whose":[31],"minimal":[32],"refutations":[33],"tree-like":[35,84,113],"QBF":[36,80,89],"systems":[38],"are":[39,76],"either":[40],"polynomial":[42,99],"size":[43,54],"(if":[44,55],"has":[46,57],"no":[47],"models)":[48],"or":[49],"at":[50],"least":[51],"exponential":[52],"some":[58],"infinite":[59],"model).":[60],"However,":[61],"we":[62,116],"show":[63],"that":[64],"this":[65],"gap":[66,120],"theorem":[67],"is":[68,107],"sensitive":[69],"translation":[72,87,124],"and":[73],"different":[74,79],"translations":[75],"needed":[77,109],"resolution":[81],"systems.":[82],"For":[83],"Q-Resolution,":[85],"must":[90],"be":[91],"given":[92],"additional":[93],"structure":[94,106],"order":[96],"upper":[100],"bound":[101],"hold.":[103],"This":[104],"extra":[105],"not":[108],"system":[112],"\u2200Exp+Res,":[114],"where":[115],"see":[117],"complexity":[119],"on":[121],"natural":[123],"QBF.":[126]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}