{"id":"https://openalex.org/W2086423911","doi":"https://doi.org/10.2168/lmcs-4(4:13)2008","title":"Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning","display_name":"Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning","publication_year":2008,"publication_date":"2008-12-05","ids":{"openalex":"https://openalex.org/W2086423911","doi":"https://doi.org/10.2168/lmcs-4(4:13)2008","mag":"2086423911"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-4(4:13)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(4:13)2008","pdf_url":"https://lmcs.episciences.org/860/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/860/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Samuel R. Buss","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Samuel R. Buss","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Jan Hoffmann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jan Hoffmann","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Jan Johannsen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jan Johannsen","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.8811,"has_fulltext":true,"cited_by_count":47,"citation_normalized_percentile":{"value":0.9079045,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"Volume 4, Issue 4","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.362199991941452,"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.362199991941452,"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.21879999339580536,"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.10419999808073044,"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/resolution","display_name":"Resolution (logic)","score":0.8389000296592712},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.6941999793052673},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.685699999332428},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.529699981212616},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.49810001254081726},{"id":"https://openalex.org/keywords/unit","display_name":"Unit (ring theory)","score":0.43479999899864197},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.37959998846054077}],"concepts":[{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.8389000296592712},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.6941999793052673},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.685699999332428},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6643999814987183},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.529699981212616},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.49810001254081726},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4959999918937683},{"id":"https://openalex.org/C122637931","wikidata":"https://www.wikidata.org/wiki/Q118084","display_name":"Unit (ring theory)","level":2,"score":0.43479999899864197},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4131999909877777},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.37959998846054077},{"id":"https://openalex.org/C2780587432","wikidata":"https://www.wikidata.org/wiki/Q4291893","display_name":"Extension method","level":3,"score":0.31040000915527344},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.3068999946117401},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.2930000126361847},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.2838999927043915},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2752000093460083},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.2694999873638153},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.25929999351501465},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.25699999928474426}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-4(4:13)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(4:13)2008","pdf_url":"https://lmcs.episciences.org/860/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0811.1075","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0811.1075","pdf_url":"https://arxiv.org/pdf/0811.1075","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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:doaj.org/article:9860ff3ed37349baa9af6375e11ececc","is_oa":true,"landing_page_url":"https://doaj.org/article/9860ff3ed37349baa9af6375e11ececc","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 4, Issue 4 (2008)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-4(4:13)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(4:13)2008","pdf_url":"https://lmcs.episciences.org/860/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G97963251","display_name":"Proof complexity, computation, and algorithms","funder_award_id":"0700533","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"},{"id":"https://openalex.org/F4320322572","display_name":"Studienstiftung des Deutschen Volkes","ror":"https://ror.org/05xwwfy96"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2086423911.pdf"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W103439665","https://openalex.org/W1498071874","https://openalex.org/W1541525032","https://openalex.org/W1556434751","https://openalex.org/W1902951782","https://openalex.org/W1950282396","https://openalex.org/W2040813688","https://openalex.org/W2048051309","https://openalex.org/W2058900023","https://openalex.org/W2062897452","https://openalex.org/W2096307462","https://openalex.org/W2113932434","https://openalex.org/W2133527541","https://openalex.org/W2171790376","https://openalex.org/W4233090747"],"related_works":[],"abstract_inverted_index":{"Resolution":[0],"refinements":[1],"called":[2,93],"w-resolution":[3],"trees":[4],"with":[5,9,77,130],"lemmas":[6,11,155],"(WRTL)":[7],"and":[8,22,40,44,126],"input":[10],"(WRTI)":[12],"are":[13,82,156],"introduced.":[14],"Dag-like":[15],"resolution":[16,39,113,142],"is":[17,26,47,50,95,98,107,161],"equivalent":[18,83,99],"to":[19,84,100,109,139,158],"both":[20,41],"WRTL":[21,43,152],"WRTI":[23,46],"when":[24],"there":[25],"no":[27],"regularity":[28],"condition.":[29],"For":[30],"regular":[31,37,42,45,70,85,101,115],"proofs,":[32],"an":[33,147],"exponential":[34,148],"separation":[35],"between":[36],"dag-like":[38],"given.":[48],"It":[49],"proved":[51],"that":[52,57,97],"DLL":[53,75,128],"proof":[54,122],"search":[55],"algorithms":[56,76,129],"use":[58,136],"clause":[59,91],"learning":[60,78,131],"based":[61],"on":[62],"unit":[63,80,133],"propagation":[64,81,134],"can":[65,135],"be":[66],"polynomially":[67],"simulated":[68],"by":[69,79,114,132],"WRTI.":[71,86],"More":[72],"generally,":[73],"non-greedy":[74,127],"A":[87,103],"general":[88,141],"form":[89,120],"of":[90,112,121],"learning,":[92],"DLL-Learn,":[94],"defined":[96],"WRTL.":[102],"variable":[104,137],"extension":[105],"method":[106],"used":[108],"give":[110],"simulations":[111],"WRTI,":[116],"using":[117],"a":[118],"simplified":[119],"trace":[123],"extensions.":[124],"DLL-Learn":[125],"extensions":[138],"simulate":[140],"without":[143],"doing":[144],"restarts.":[145],"Finally,":[146],"lower":[149],"bound":[150],"for":[151],"where":[153],"the":[154],"restricted":[157],"short":[159],"clauses":[160],"shown.":[162]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":27},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2016-06-24T00:00:00"}