{"id":"https://openalex.org/W2139442450","doi":"https://doi.org/10.1109/sfcs.2002.1181983","title":"Satisfiability, branch-width and Tseitin tautologies","display_name":"Satisfiability, branch-width and Tseitin tautologies","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W2139442450","doi":"https://doi.org/10.1109/sfcs.2002.1181983","mag":"2139442450"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2002.1181983","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181983","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-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/A5108227774","display_name":"M. Alekhnovich","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M. Alekhnovich","raw_affiliation_strings":["Laboratory for Computer Science, MIT, UK","Lab. for Comput Sci., MIT, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Laboratory for Computer Science, MIT, UK","institution_ids":[]},{"raw_affiliation_string":"Lab. for Comput Sci., MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008113826","display_name":"Alexander Razborov","orcid":null},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A.A. Razborov","raw_affiliation_strings":["Institute of Advanced Study in Science and Technology, Princeton, USA","Institute for Advanced study, Princeton, USA"],"affiliations":[{"raw_affiliation_string":"Institute of Advanced Study in Science and Technology, Princeton, USA","institution_ids":["https://openalex.org/I40036882"]},{"raw_affiliation_string":"Institute for Advanced study, Princeton, USA","institution_ids":["https://openalex.org/I40036882"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108227774"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":7.959,"has_fulltext":false,"cited_by_count":54,"citation_normalized_percentile":{"value":0.97396282,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"593","last_page":"603"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9965999722480774,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9965999722480774,"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/T10142","display_name":"Formal Methods in Verification","score":0.9965999722480774,"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.996399998664856,"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/hypergraph","display_name":"Hypergraph","score":0.6612592935562134},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6425069570541382},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6420989632606506},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5674563646316528},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5516072511672974},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.5254589319229126},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5088701248168945},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4981563091278076},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.48013660311698914},{"id":"https://openalex.org/keywords/dpll-algorithm","display_name":"DPLL algorithm","score":0.44597554206848145},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44478875398635864},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.42827755212783813},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42544788122177124},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3954419493675232},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39123034477233887},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2003662884235382}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.6612592935562134},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6425069570541382},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6420989632606506},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5674563646316528},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5516072511672974},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.5254589319229126},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5088701248168945},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4981563091278076},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.48013660311698914},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.44597554206848145},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44478875398635864},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.42827755212783813},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42544788122177124},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3954419493675232},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39123034477233887},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2003662884235382},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/sfcs.2002.1181983","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181983","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.16.7383","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.7383","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://genesis.mi.ras.ru/~razborov/automat_pos.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.205.5569","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.205.5569","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.cs.uchicago.edu/%7Erazborov/files/automat_pos.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.297.4642","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.4642","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.cs.uchicago.edu/~razborov/files/automat_pos.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.6.1652","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.1652","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://genesis.mi.ras.ru/%7Erazborov/automat_pos.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W56285243","https://openalex.org/W1518031539","https://openalex.org/W1607926272","https://openalex.org/W1982180670","https://openalex.org/W1999067488","https://openalex.org/W1999069928","https://openalex.org/W2005079828","https://openalex.org/W2012476164","https://openalex.org/W2016341899","https://openalex.org/W2038264652","https://openalex.org/W2038643780","https://openalex.org/W2047871605","https://openalex.org/W2049645218","https://openalex.org/W2074210283","https://openalex.org/W2084384424","https://openalex.org/W2097113315","https://openalex.org/W2109716789","https://openalex.org/W2110053319","https://openalex.org/W2122055721","https://openalex.org/W2132148988","https://openalex.org/W2136687801","https://openalex.org/W2139212134","https://openalex.org/W2159003936","https://openalex.org/W2986773320","https://openalex.org/W4248733413","https://openalex.org/W6662732454","https://openalex.org/W6683227944"],"related_works":["https://openalex.org/W1836127928","https://openalex.org/W1576158606","https://openalex.org/W943012151","https://openalex.org/W1490290385","https://openalex.org/W1572255008","https://openalex.org/W1970590090","https://openalex.org/W1972515959","https://openalex.org/W2007316622","https://openalex.org/W2408711288","https://openalex.org/W2027388354"],"abstract_inverted_index":{"For":[0],"a":[1,36,51,63,94,107,143,162],"CNF":[2],"/spl":[3,166,214,259],"tau/,":[4],"let":[5],"w/sub":[6],"b/(/spl":[7],"tau/)":[8],"be":[9,149,170],"the":[10,54,68,84,99,104,111,132,154,159,173,177,181,186,227,253],"branch-width":[11,105],"of":[12,53,76,83,87,106,135,142,176,183,189,280],"its":[13,207],"underlying":[14],"hypergraph.":[15],"In":[16,172],"this":[17,196,275],"paper":[18,178],"we":[19,179,204,251],"design":[20],"an":[21],"algorithm":[22,38,49,101,137,155],"for":[23,39,72,102,249,277],"solving":[24],"SAT":[25],"in":[26,33,140,195,238],"time":[27,134,209],"n/sup":[28,230],"O(1)/2/sup":[29],"O(w(b)(/spl":[30],"tau/))/.":[31],"This":[32,237],"particular":[34,239],"implies":[35,240],"polynomial":[37],"testing":[40],"satisfiability":[41],"on":[42,67,98,185,210,245],"instances":[43],"with":[44],"tree-width":[45],"O(log":[46,261],"n).":[47],"Our":[48],"is":[50,62,138,199,216,243],"modification":[52],"width":[55],"based":[56,97],"automated":[57],"theorem":[58],"prover":[59],"(WBATP)":[60],"which":[61,250],"popular":[64],"(at":[65],"least":[66],"theoretical":[69],"level)":[70],"heuristic":[71],"finding":[73],"resolution":[74],"refutations":[75],"unsatisfiable":[77],"CNFs.":[78],"We":[79,109,192,264],"show":[80,205],"that":[81,147,153,194,206,241],"instead":[82],"exhaustive":[85],"enumeration":[86],"all":[88],"provable":[89],"clauses,":[90],"one":[91,266],"can":[92,148],"do":[93],"better":[95,200],"search":[96],"Robertson-Seymour":[100],"approximating":[103],"graph.":[108],"call":[110],"resulting":[112],"procedure":[113],"Branch-Width":[114],"Based":[115],"Automated":[116],"Theorem":[117],"Prover":[118],"(BWBATP).":[119],"As":[120],"opposed":[121,225],"to":[122,169,226],"WBATP,":[123],"it":[124],"always":[125],"produces":[126],"regular":[127],"refutations.":[128],"Perhaps":[129],"more":[130],"importantly,":[131],"running":[133,208],"our":[136],"bounded":[139],"terms":[141],"clean":[144],"combinatorial":[145],"characteristic":[146],"efficiently":[150],"approximated,":[151],"and":[152,269],"also":[156],"produces,":[157],"within":[158],"same":[160],"time,":[161],"satisfying":[163],"assignment":[164],"if":[165],"tau/":[167,215],"happens":[168],"satisfiable.":[171],"second":[174],"part":[175],"investigate":[180],"behavior":[182],"BWBATP":[184,198],"Well-studied":[187],"class":[188],"Tseitin":[190,212,247],"tautologies.":[191],"argue":[193],"case":[197],"than":[201],"WBATP.":[202,236],"Namely,":[203],"any":[211],"tautology":[213],"|/spl":[217],"tau/|/sup":[218],"O(1)/.":[219],"2/sup":[220],"O(w(/spl":[221,231],"tau//spl":[222,232,256],"boxvr/O))/":[223,233],"as":[224],"obvious":[228],"bound":[229],"provided":[234],"by":[235],"Resolution":[242],"automatizable":[244],"those":[246],"tautologies":[248],"know":[252],"relation":[254,276],"w(/spl":[255],"boxvr//spl":[257],"phi/)":[258],"les/":[260],"S(/spl":[262],"tau/)).":[263],"identify":[265],"such":[267],"subclass":[268],"prove":[270],"partial":[271],"results":[272],"toward":[273],"establishing":[274],"larger":[278],"classes":[279],"graphs.":[281]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}