{"id":"https://openalex.org/W2015932695","doi":"https://doi.org/10.1016/0004-3702(95)00051-8","title":"Hard random 3-SAT problems and the Davis-Putnam procedure","display_name":"Hard random 3-SAT problems and the Davis-Putnam procedure","publication_year":1996,"publication_date":"1996-03-01","ids":{"openalex":"https://openalex.org/W2015932695","doi":"https://doi.org/10.1016/0004-3702(95)00051-8","mag":"2015932695"},"language":"en","primary_location":{"id":"doi:10.1016/0004-3702(95)00051-8","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0004-3702(95)00051-8","pdf_url":null,"source":{"id":"https://openalex.org/S196139623","display_name":"Artificial Intelligence","issn_l":"0004-3702","issn":["0004-3702","1872-7921"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/0004-3702(95)00051-8","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064280621","display_name":"Jon Freeman","orcid":null},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jon W. Freeman","raw_affiliation_strings":["Department of Computer and Information Science, School of Engineering and Applied Science, University of Pennsylvania, Philadelphia, PA 19104, USA","Department of Computer and Information Science, School of Engineering and Applied Science, University of Pennsylvania, Philadelphia, PA, 19104, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, School of Engineering and Applied Science, University of Pennsylvania, Philadelphia, PA 19104, USA","institution_ids":["https://openalex.org/I79576946"]},{"raw_affiliation_string":"Department of Computer and Information Science, School of Engineering and Applied Science, University of Pennsylvania, Philadelphia, PA, 19104, USA","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5064280621"],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":{"value":3670,"currency":"USD","value_usd":3670},"apc_paid":{"value":3670,"currency":"USD","value_usd":3670},"fwci":6.6228,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.96367063,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"81","issue":"1-2","first_page":"183","last_page":"198"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9993000030517578,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9921000003814697,"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.9832000136375427,"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/mathematics","display_name":"Mathematics","score":0.6569856405258179},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5740536451339722},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.5271208882331848},{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.5138552188873291},{"id":"https://openalex.org/keywords/piecewise-linear-function","display_name":"Piecewise linear function","score":0.5130993127822876},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4855058193206787},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.46307432651519775},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.44023987650871277},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4347917437553406},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40570947527885437},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36643609404563904},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34097468852996826},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.2814144790172577}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6569856405258179},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5740536451339722},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.5271208882331848},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.5138552188873291},{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.5130993127822876},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4855058193206787},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.46307432651519775},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.44023987650871277},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4347917437553406},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40570947527885437},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36643609404563904},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34097468852996826},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2814144790172577},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0004-3702(95)00051-8","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0004-3702(95)00051-8","pdf_url":null,"source":{"id":"https://openalex.org/S196139623","display_name":"Artificial Intelligence","issn_l":"0004-3702","issn":["0004-3702","1872-7921"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/0004-3702(95)00051-8","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0004-3702(95)00051-8","pdf_url":null,"source":{"id":"https://openalex.org/S196139623","display_name":"Artificial Intelligence","issn_l":"0004-3702","issn":["0004-3702","1872-7921"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W4983232","https://openalex.org/W1556434751","https://openalex.org/W1597271110","https://openalex.org/W1599103728","https://openalex.org/W1963913579","https://openalex.org/W1968198053","https://openalex.org/W2022695609","https://openalex.org/W2033656824","https://openalex.org/W2057361103","https://openalex.org/W2062897452","https://openalex.org/W2085301456","https://openalex.org/W2087662271","https://openalex.org/W2126420408","https://openalex.org/W2776836749","https://openalex.org/W2956131382","https://openalex.org/W3121548287","https://openalex.org/W6600203084","https://openalex.org/W6633392352","https://openalex.org/W6633400202","https://openalex.org/W6635849912","https://openalex.org/W6641350426","https://openalex.org/W7055933472"],"related_works":["https://openalex.org/W2486267010","https://openalex.org/W1678820847","https://openalex.org/W1596838019","https://openalex.org/W3182827720","https://openalex.org/W2133947431","https://openalex.org/W2490196280","https://openalex.org/W3208509670","https://openalex.org/W2100864966","https://openalex.org/W2109304297","https://openalex.org/W2083709218"],"abstract_inverted_index":{"It":[0],"is":[1,26,30,43,62,169],"by":[2,77],"now":[3],"well":[4],"known":[5],"that":[6],"randomly":[7],"generated":[8],"3-SAT":[9],"problems":[10,72],"are":[11,73],"very":[12],"difficult":[13],"to":[14,24,33,38,63,65,101,148],"solve":[15],"on":[16,160,172],"the":[17,20,49,85,103,138,161,181,188],"average":[18,104],"when":[19],"ratio":[21],"of":[22,47,59,69,87,99,106,117,132,141,184,199,203],"clauses":[23],"variables":[25,108],"a":[27,45,95,127,144],"constant":[28],"which":[29,191],"approximately":[31],"equal":[32],"4.24.":[34],"This":[35],"difficulty":[36],"appears":[37],"be":[39],"algorithm-independent,":[40],"but":[41],"it":[42],"certainly":[44],"consequence":[46],"using":[48],"popular":[50],"Davis-Putnam":[51],"procedure":[52],"in":[53],"Loveland's":[54],"form":[55],"(DPL).":[56],"The":[57],"purpose":[58],"this":[60],"paper":[61],"try":[64],"provide":[66],"an":[67,133],"explanation":[68],"why":[70,156,166],"these":[71,185],"hard":[74],"for":[75,113,201],"DPL":[76,100,157],"experimentally":[78],"determining":[79],"how":[80],"their":[81,88],"complexity":[82],"decreases":[83],"as":[84,196],"depth":[86,112,189],"associated":[89],"search":[90,110],"trees":[91],"increases.":[92],"We":[93],"use":[94,180],"highly":[96],"optimized":[97],"version":[98],"plot":[102],"number":[105,140],"remaining":[107],"versus":[109],"tree":[111],"several":[114],"nontrivial":[115],"sizes":[116],"critically":[118,162],"constrained,":[119],"underconstrained,":[120],"and":[121,143,165,174],"overconstrained":[122,175],"problems.":[123,176],"These":[124],"plots":[125],"have":[126],"distinct":[128],"piecewise-linear":[129],"shape,":[130],"consisting":[131],"initial,":[134],"gradual":[135],"descent":[136,147],"from":[137],"original":[139],"variables,":[142],"second,":[145],"steeper":[146],"substantially":[149],"smaller":[150],"subproblems.":[151],"They":[152],"help":[153],"explain":[154],"exactly":[155],"performs":[158],"poorly":[159],"constrained":[163],"problems,":[164],"its":[167],"performance":[168],"much":[170],"better":[171],"under-":[173],"Also,":[177],"we":[178],"can":[179],"key":[182],"parameters":[183],"plots,":[186],"e.g.,":[187],"at":[190],"rapid":[192],"constraint":[193],"propagation":[194],"occurs,":[195],"another":[197],"basis":[198],"comparison":[200],"implementations":[202],"DPL.":[204]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-10T00:00:00"}