{"id":"https://openalex.org/W6891648646","doi":"https://doi.org/10.4230/lipics.ccc.2025.14","title":"On the Automatability of Tree-Like k-DNF Resolution","display_name":"On the Automatability of Tree-Like k-DNF Resolution","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W6891648646","doi":"https://doi.org/10.4230/lipics.ccc.2025.14"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23708","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2025.14","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol339-ccc2025/LIPIcs.CCC.2025.14/LIPIcs.CCC.2025.14.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol339-ccc2025/LIPIcs.CCC.2025.14/LIPIcs.CCC.2025.14.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Carenini, Gaia","orcid":"https://orcid.org/0000-0003-3427-183X"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Carenini, Gaia","raw_affiliation_strings":["University of Cambridge, UK"],"raw_orcid":"https://orcid.org/0000-0003-3427-183X","affiliations":[{"raw_affiliation_string":"University of Cambridge, UK","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"last","author":{"id":null,"display_name":"de Rezende, Susanna F.","orcid":"https://orcid.org/0000-0001-8923-1240"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"de Rezende, Susanna F.","raw_affiliation_strings":["Lund University, Sweden"],"raw_orcid":"https://orcid.org/0000-0001-8923-1240","affiliations":[{"raw_affiliation_string":"Lund University, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I241749"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.39528362,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.2976999878883362,"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.2976999878883362,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.24699999392032623,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.13830000162124634,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7652999758720398},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5669000148773193},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.558899998664856},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.49790000915527344},{"id":"https://openalex.org/keywords/existential-quantification","display_name":"Existential quantification","score":0.3912999927997589},{"id":"https://openalex.org/keywords/direct-proof","display_name":"Direct proof","score":0.3249000012874603}],"concepts":[{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.7652999758720398},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7243000268936157},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5669000148773193},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.558899998664856},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.49790000915527344},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45570001006126404},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40119999647140503},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.3912999927997589},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.365200012922287},{"id":"https://openalex.org/C161505775","wikidata":"https://www.wikidata.org/wiki/Q3240280","display_name":"Direct proof","level":2,"score":0.3249000012874603},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.3098999857902527},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.29030001163482666},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.27239999175071716},{"id":"https://openalex.org/C124978682","wikidata":"https://www.wikidata.org/wiki/Q1201019","display_name":"Proof of concept","level":2,"score":0.25920000672340393},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.2587999999523163},{"id":"https://openalex.org/C3020199158","wikidata":"https://www.wikidata.org/wiki/Q210521","display_name":"High resolution","level":2,"score":0.2531999945640564}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:23708","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2025.14","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol339-ccc2025/LIPIcs.CCC.2025.14/LIPIcs.CCC.2025.14.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"pmh:oai:lup.lub.lu.se:f6155fad-29a6-46ad-8df2-67c14e380b64","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/f6155fad-29a6-46ad-8df2-67c14e380b64","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1868-8969","raw_type":"text"},{"id":"doi:10.4230/lipics.ccc.2025.14","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2025.14","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23708","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2025.14","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol339-ccc2025/LIPIcs.CCC.2025.14/LIPIcs.CCC.2025.14.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6891648646.pdf","grobid_xml":"https://content.openalex.org/works/W6891648646.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"proof":[1,32,127,143],"system":[2,33],"\ud835\udcab":[3,34],"is":[4,40,64,85,114,124],"said":[5],"to":[6,88],"be":[7],"automatable":[8,65,116],"in":[9,30,35,66,92,107,117],"time":[10,36,67,118],"f(N)":[11],"if":[12],"there":[13],"exists":[14],"an":[15,21],"algorithm":[16],"that":[17,60,98],"given":[18],"as":[19],"input":[20],"unsatisfiable":[22],"formula":[23],"F":[24,29,48],"outputs":[25],"a":[26,71,89],"refutation":[27],"of":[28,43,47,52,110,112],"the":[31,41,44,50,79,93,108,130],"f(N),":[37],"where":[38],"N":[39],"size":[42,51],"smallest":[45],"\ud835\udcab-refutation":[46],"plus":[49],"F.":[53],"Atserias":[54,136],"and":[55,137,152,156],"Bonet":[56],"(ECCC":[57],"2002),":[58],"observed":[59],"tree-like":[61,99,158],"k-DNF":[62,100],"resolution":[63,134,159],"N^{c\u22c5klog":[68],"N}":[69],"for":[70,102,133,141,157],"universal":[72],"constant":[73],"c.":[74],"We":[75],"show":[76],"that,":[77],"under":[78],"randomized":[80],"exponential-time":[81],"hypothesis":[82],"(rETH),":[83],"this":[84],"tight":[86],"up":[87],"O(log":[90],"k)-factor":[91],"exponent,":[94],"i.e.,":[95],"we":[96],"prove":[97],"resolution,":[101],"k":[103],"at":[104],"most":[105],"logarithmic":[106],"number":[109],"variables":[111],"F,":[113],"not":[115],"N^o((k/log":[119],"k)\u22c5log":[120],"N)":[121],"unless":[122],"rETH":[123],"false.":[125],"Our":[126],"builds":[128],"on":[129],"non-automatability":[131],"results":[132],"by":[135,145,160],"M\u00fcller":[138],"(FOCS":[139],"2019),":[140],"algebraic":[142],"systems":[144],"de":[146,161],"Rezende,":[147],"G\u00f6\u00f6s,":[148],"Nordstr\u00f6m,":[149],"Pitassi,":[150],"Robere":[151],"Sokolov":[153],"(STOC":[154],"2021),":[155],"Rezende":[162],"(LAGOS":[163],"2021).":[164]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}