{"id":"https://openalex.org/W7168508156","doi":"https://doi.org/10.4230/lipics.sat.2026.29","title":"Automated Reencoding Meets Graph Theory","display_name":"Automated Reencoding Meets Graph Theory","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7168508156","doi":"https://doi.org/10.4230/lipics.sat.2026.29"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26335","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2026.29","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol377-sat2026/LIPIcs.SAT.2026.29/LIPIcs.SAT.2026.29.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":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol377-sat2026/LIPIcs.SAT.2026.29/LIPIcs.SAT.2026.29.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009136134","display_name":"Benjamin Przybocki","orcid":"https://orcid.org/0009-0007-5489-1733"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Przybocki, Benjamin","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0009-0007-5489-1733","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030108071","display_name":"Bernardo Subercaseaux","orcid":"https://orcid.org/0000-0003-2295-1299"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Subercaseaux, Bernardo","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0000-0003-2295-1299","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025921874","display_name":"Marijn J. H. Heule","orcid":"https://orcid.org/0000-0002-5587-8801"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Heule, Marijn J. H.","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0000-0002-5587-8801","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.86368053,"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":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.6790000200271606,"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.6790000200271606,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.22930000722408295,"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"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.01889999955892563,"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/preprocessor","display_name":"Preprocessor","score":0.6284999847412109},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5163000226020813},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5012000203132629},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.49950000643730164},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4246000051498413},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4083000123500824},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.4074999988079071},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4000000059604645}],"concepts":[{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.6284999847412109},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5163000226020813},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5012000203132629},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.49950000643730164},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47859999537467957},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4246000051498413},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4106000065803528},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4083000123500824},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.4074999988079071},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4000000059604645},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3977000117301941},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3833000063896179},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3767000138759613},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35760000348091125},{"id":"https://openalex.org/C169272836","wikidata":"https://www.wikidata.org/wiki/Q5668307","display_name":"Variable elimination","level":3,"score":0.3409999907016754},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3345000147819519},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.32829999923706055},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.30390000343322754},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.2964000105857849},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.28290000557899475},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.2802000045776367},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2799000144004822},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.25780001282691956}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26335","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2026.29","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol377-sat2026/LIPIcs.SAT.2026.29/LIPIcs.SAT.2026.29.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":"InProceedings"},{"id":"doi:10.4230/lipics.sat.2026.29","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sat.2026.29","pdf_url":null,"source":null,"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26335","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2026.29","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol377-sat2026/LIPIcs.SAT.2026.29/LIPIcs.SAT.2026.29.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":"InProceedings"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.49916473031044006,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G383231862","display_name":null,"funder_award_id":"DGE-2140739","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4802935648","display_name":"Collaborative Research: AIMing: Synergy of Machine Learning and Automated Reasoning to Solve Math Challenges","funder_award_id":"2434625","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8051438088","display_name":"Graduate Research Fellowship Program (GRFP)","funder_award_id":"2140739","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8378853900","display_name":null,"funder_award_id":"DMS-2434625","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7168508156.pdf","grobid_xml":"https://content.openalex.org/works/W7168508156.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Bounded":[0],"Variable":[1],"Addition":[2],"(BVA)":[3],"is":[4,146],"a":[5,16,112,141,193,202],"central":[6],"preprocessing":[7,51,62,94],"method":[8,109],"in":[9,187],"modern":[10],"state-of-the-art":[11],"SAT":[12],"solvers.":[13],"We":[14,53],"provide":[15],"graph-theoretic":[17,177],"characterization":[18,178],"of":[19,44,171,179,198],"which":[20,161],"2-CNF":[21,70,78,209],"encodings":[22],"can":[23,67,110],"be":[24,166],"constructed":[25,167],"by":[26,148,168],"an":[27,76],"idealized":[28,56,130],"BVA":[29,45,131,169,180,199],"algorithm.":[30],"Based":[31],"on":[32,124,206],"this":[33,134,153],"insight,":[34],"we":[35,88,127,144],"prove":[36,128,145],"new":[37],"results":[38],"about":[39],"the":[40,92,95,117,121,156,172],"behavior":[41],"and":[42,46,105],"limitations":[43],"its":[47],"interaction":[48],"with":[49,72,80],"other":[50,118],"techniques.":[52],"show":[54,89],"that":[55,90,106,129,143,155,200],"BVA,":[57],"plus":[58],"some":[59],"minor":[60],"additional":[61,93],"(e.g.,":[63],"equivalent":[64,77],"literal":[65],"substitution),":[66],"reencode":[68,133],"any":[69],"formula":[71,79],"n":[73,125],"variables":[74],"into":[75],"(lg(3)/4":[81],"+":[82],"o(1))":[83],"n\u00b2/(lg":[84],"n)":[85],"clauses.":[86],"Furthermore,":[87],"without":[91],"constant":[96,113],"factor":[97],"worsens":[98],"from":[99],"lg(3)/4":[100],"\u2248":[101],"0.396":[102],"to":[103,183,191],"1,":[104],"no":[107],"reencoding":[108],"achieve":[111],"below":[114],"0.25.":[115],"On":[116],"hand,":[119],"for":[120,159],"at-most-one":[122],"constraint":[123,135],"variables,":[126],"cannot":[132,165],"using":[136],"fewer":[137],"than":[138],"3n-6":[139],"clauses,":[140,164],"bound":[142],"achieved":[147],"actual":[149],"implementations.":[150],"In":[151],"particular,":[152],"shows":[154],"product":[157],"encoding":[158],"at-most-one,":[160],"uses":[162],"2n+o(n)":[163],"regardless":[170],"heuristics":[173],"used.":[174],"Finally,":[175],"our":[176],"allows":[181],"us":[182],"leverage":[184],"recent":[185],"work":[186],"algorithmic":[188],"graph":[189],"theory":[190],"develop":[192],"drastically":[194],"more":[195],"efficient":[196],"implementation":[197],"achieves":[201],"comparable":[203],"clause":[204],"reduction":[205],"random":[207],"monotone":[208],"formulas.":[210]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-17T00:00:00"}