{"id":"https://openalex.org/W1993033025","doi":"https://doi.org/10.1145/1119439.1119442","title":"Complexity results on DPLL and resolution","display_name":"Complexity results on DPLL and resolution","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1993033025","doi":"https://doi.org/10.1145/1119439.1119442","mag":"1993033025"},"language":"en","primary_location":{"id":"doi:10.1145/1119439.1119442","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1119439.1119442","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/cs/0209032","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Paolo Liberatore","orcid":null},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Paolo Liberatore","raw_affiliation_strings":["Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.12714816,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"7","issue":"1","first_page":"84","last_page":"107"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.6790000200271606,"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.6790000200271606,"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.13300000131130219,"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.056299999356269836,"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/dpll-algorithm","display_name":"DPLL algorithm","score":0.9552000164985657},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.7067999839782715},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6100000143051147},{"id":"https://openalex.org/keywords/literal","display_name":"Literal (mathematical logic)","score":0.5570999979972839},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.45649999380111694},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.4072999954223633},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3720000088214874}],"concepts":[{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.9552000164985657},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7254999876022339},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.7067999839782715},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6100000143051147},{"id":"https://openalex.org/C2780882242","wikidata":"https://www.wikidata.org/wiki/Q14235582","display_name":"Literal (mathematical logic)","level":2,"score":0.5570999979972839},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.45649999380111694},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.4072999954223633},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3901999890804291},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3720000088214874},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.3481999933719635},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.334199994802475},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3068000078201294},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.30070000886917114},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.2939000129699707},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29030001163482666},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.26840001344680786},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.25130000710487366}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1119439.1119442","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1119439.1119442","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:cs/0209032","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0209032","pdf_url":"https://arxiv.org/pdf/cs/0209032","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:iris.uniroma1.it:11573/125447","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/125447","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:cs/0209032","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0209032","pdf_url":"https://arxiv.org/pdf/cs/0209032","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1537470063","https://openalex.org/W1583771634","https://openalex.org/W1999069928","https://openalex.org/W2006906201","https://openalex.org/W2044722214","https://openalex.org/W2047237020","https://openalex.org/W2057361103","https://openalex.org/W2057832617","https://openalex.org/W2058277150","https://openalex.org/W2062897452","https://openalex.org/W2069767473","https://openalex.org/W2092984557","https://openalex.org/W2098022011","https://openalex.org/W2100738443","https://openalex.org/W2133527541","https://openalex.org/W2137407595","https://openalex.org/W6681432771"],"related_works":[],"abstract_inverted_index":{"DPLL":[0,33,85],"and":[1,93,116,136],"resolution":[2,44,112],"are":[3,18],"two":[4],"popular":[5],"methods":[6],"for":[7,134,154],"solving":[8],"the":[9,36,39,47,50,63,78,122,125],"problem":[10,119,151],"of":[11,20,38,49,52,61,106,120,124],"propositional":[12],"satisfiability.":[13],"Rather":[14],"than":[15],"algorithms,":[16,21],"they":[17,29],"families":[19],"as":[22],"their":[23],"behavior":[24],"depends":[25,34,45],"on":[26,35,46,83,103],"some":[27],"choices":[28],"face":[30],"during":[31],"execution:":[32],"choice":[37,48,65,109],"literal":[40,80],"to":[41,54,81],"branch":[42,82],"on;":[43],"pair":[51],"clauses":[53],"resolve":[55],"at":[56],"each":[57],"step.":[58],"The":[59,118],"complexity":[60],"making":[62],"optimal":[64,79,126],"is":[66,86,100,113,128,132,148,152],"analyzed":[67],"in":[68,84,110],"this":[69],"article.":[70],"Extending":[71],"previous":[72],"results,":[73],"we":[74,146],"prove":[75],"that":[76],"choosing":[77],"\u0394":[87,137],"p":[88,138],"2":[89,139],"[log":[90,140],"n":[91,141],"]-hard,":[92],"becomes":[94],"NP":[95],"PP":[96],"-hard":[97],"if":[98,143],"branching":[99],"only":[101],"allowed":[102],"a":[104,144],"subset":[105],"variables.":[107],"Optimal":[108],"regular":[111,155],"both":[114],"NP-hard":[115],"coNP-hard.":[117],"determining":[121],"size":[123],"proofs":[127],"also":[129],"analyzed:":[130],"it":[131],"coNP-hard":[133,153],"DPLL,":[135],"]-hard":[142],"conjecture":[145],"make":[147],"true.":[149],"This":[150],"resolution.":[156]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}